Skip to main content
To refer to this page use:
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 that FOLB obtains this bound through uniform sampling by weighting device updates according to their gradient information. FOLB is able to handle both communication and computation heterogeneity of devices by adapting the aggregations according to estimates of device’s capabilities of contributing to the updates. We evaluate FOLB in comparison with existing federated learning algorithms and experimentally show its improvement in trained model accuracy, convergence speed, and/or model stability across various machine learning tasks and datasets.
Publication Date: 9-Nov-2020
Citation: Nguyen, Hung T, Sehwag, Vikash, Hosseinalipour, Seyyedali, Brinton, Christopher G, Chiang, Mung, Vincent Poor, H. (2021). Fast-Convergent Federated Learning. IEEE Journal on Selected Areas in Communications, 39 (1), 201 - 218. doi:10.1109/jsac.2020.3036952
DOI: doi:10.1109/jsac.2020.3036952
ISSN: 0733-8716
EISSN: 1558-0008
Pages: 201 - 218
Type of Material: Journal Article
Journal/Proceeding Title: IEEE Journal on Selected Areas in Communications
Version: Author's manuscript

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.