Pith. sign in

REVIEW

FedCluster: Boosting the Convergence of Federated Learning via Cluster-Cycling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.10748 v1 pith:X3RKWYX7 submitted 2020-09-22 cs.LG math.OCstat.ML

classification cs.LGmath.OCstat.ML
keywords learningfedclusterfederatedconvergencealgorithmconventionaldatadevice-level
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We develop FedCluster--a novel federated learning framework with improved optimization efficiency, and investigate its theoretical convergence properties. The FedCluster groups the devices into multiple clusters that perform federated learning cyclically in each learning round. Therefore, each learning round of FedCluster consists of multiple cycles of meta-update that boost the overall convergence. In nonconvex optimization, we show that FedCluster with the devices implementing the local {stochastic gradient descent (SGD)} algorithm achieves a faster convergence rate than the conventional {federated averaging (FedAvg)} algorithm in the presence of device-level data heterogeneity. We conduct experiments on deep learning applications and demonstrate that FedCluster converges significantly faster than the conventional federated learning under diverse levels of device-level data heterogeneity for a variety of local optimizers.

Discussion (0). Sign in to comment.

Pith tools