CoChat

Fast Convergence Algorithm for Analog Federated Learning

Xia, Shuhao, Zhu, Jingyang, Yang, Yuhan, Zhou, Yong, Shi, Yuanming, Chen, Wei · 2021 · ICC 2021 - IEEE International Conference on Communications

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

Abstract

In this paper, we consider federated learning (FL) over a noisy fading multiple access channel (MAC), where an edge server aggregates the local models transmitted by multiple end devices through over-the-air computation (AirComp). To realize efficient analog federated learning over wireless channels, we propose an AirComp-based FedSplit algorithm, where a threshold-based device selection scheme is adopted to achieve reliable local model uploading. In particular, we analyze the performance of the proposed algorithm and prove that the proposed algorithm linearly converges to the optimal solutions under the assumption that the objective function is strongly convex and smooth. We also characterize the robustness of proposed algorithm to the ill-conditioned problems, thereby achieving fast convergence rates and reducing communication rounds. A finite error bound is further provided to reveal the relationship between the convergence behavior and the channel fading and noise. Our algorithm is theoretically and experimentally verified to be much more robust to the ill-conditioned problems with faster convergence compared with other benchmark FL algorithms.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1109/icc42927.2021.9500875

Cites

30 of 30 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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 30 references

Cited by

See all 41

Metadata

Authors
Xia, S., Zhu, J., Yang, Y., Zhou, Y., Shi, Y., & Chen, W.
Affiliations
  • ShanghaiTech University (CN)
  • Tsinghua University (CN)
Venue
ICC 2021 - IEEE International Conference on Communications
Publisher
IEEE
Published
2021-06
Pages
1-6
ISSN
1550-3607 (ISSN-L)
OpenAlex
W3192843186
Cited by
33
References
29
Citations by year
2026: 2 · 2025: 3 · 2024: 6 · 2023: 12 · 2022: 6 · 2021: 4
FWCI
3.23
Type
conference paper
Language
en
Open access
closed
Locations
International Conference on Communications (publishedVersion)
Funders
National Natural Science Foundation of China
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Sensor Networks and Detection Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
Keywords
over-the-air computation, multiple access channel, fading channels, device selection, linear convergence, ill-conditioned problems, edge computing

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 Convergence Algorithm for Analog Federated Learning. https://app.cochat.ai/papers/10.1109/icc42927.2021.9500875
The paper
Xia, S., Zhu, J., Yang, Y., Zhou, Y., Shi, Y., & Chen, W. (2021). Fast Convergence Algorithm for Analog Federated Learning. ICC 2021 - IEEE International Conference on Communications. https://doi.org/10.1109/icc42927.2021.9500875

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.