Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 277

The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.

Fast-Convergent Federated Learning

Open access
Nguyen, Hung T., Sehwag, Vikash, Hosseinalipour, Seyyedali, Brinton, Christopher G., Chiang, Mung, Vincent Poor, H.·2021·IEEE Journal on Selected Areas in Communications

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$\mathsf {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$\mathsf {FOLB}$obtains this bound through uniform sampling by weighting device updates according to their gradient information.$\mathsf {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$\mathsf {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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jsac.2020.3036952

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 15 references

Cited by

See all 277

Metadata

Authors
Nguyen, H. T., Sehwag, V., Hosseinalipour, S., Brinton, C. G., Chiang, M., & Vincent Poor, H.
Venue
IEEE Journal on Selected Areas in Communications
Published
2021-01
Volume
39
Issue
1
Pages
201-218
ISSN
  • 0733-8716 (ISSN-L)
  • 1558-0008
OpenAlex
W3044765474
Cited by
277
References
15
FWCI
12.22
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Fast-Convergent Federated Learning. https://app.cochat.ai/papers/10.1109/jsac.2020.3036952
The paper
Nguyen, H. T., Sehwag, V., Hosseinalipour, S., Brinton, C. G., Chiang, M., & Vincent Poor, H. (2021). Fast-Convergent Federated Learning. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2020.3036952

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.