Fast-Convergent Federated Learning
Hung T. Nguyen, Vikash Sehwag, Seyyedali Hosseinalipour, Christopher, G. Brinton, Mung Chiang, H. Vincent Poor

TL;DR
This paper introduces FOLB, a federated learning algorithm that accelerates convergence by intelligently sampling devices based on their expected contribution, reducing communication rounds and improving efficiency.
Contribution
The paper presents a novel device sampling method in federated learning that theoretically and practically enhances convergence speed and model accuracy.
Findings
FOLB achieves faster convergence compared to existing algorithms.
FOLB improves model accuracy and stability across multiple datasets.
FOLB effectively handles device heterogeneity in federated learning.
Abstract
Federated learning has emerged recently as a promising solution for distributing machine learning tasks through modern networks of mobile devices. Recent studies have obtained lower bounds on the expected decrease in model loss that is achieved through each round of federated learning. However, convergence generally requires a large number of communication rounds, which induces delay in model training and is costly in terms of network resources. In this paper, we propose a fast-convergent federated learning algorithm, called FOLB, which performs intelligent sampling of devices in each round of model training to optimize the expected convergence speed. We first theoretically characterize a lower bound on improvement that can be obtained in each round if devices are selected according to the expected improvement their local models will provide to the current global model. Then, we show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
