CoChat

Federated Learning Over Noisy Channels: Convergence Analysis and Design Examples

Open access
Wei, Xizixiang, Shen, Cong · 2022 · IEEE Transactions on Cognitive Communications and Networking
Cited by 90

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

Abstract

Does Federated Learning (FL) work whenbothuplink and downlink communications have errors? How much communication noise can FL handle and what is its impact on the learning performance? This work is devoted to answering these practically important questions by explicitly incorporating both uplink and downlink noisy channels in the FL pipeline. We present several novel convergence analyses of FL over simultaneous uplink and downlink noisy communication channels, which encompass full and partial clients participation, direct model and model differential transmissions, and non-independent and identically distributed (IID) local datasets. These analyses characterize the sufficient conditions for FL over noisy channels to have the same convergence behavior as the ideal case of no communication error. More specifically, in order to maintain the$\mathcal {O}({1}/{T})$convergence rate of FED AVG with perfect communications, the uplink and downlink signal-to-noise ratio (SNR) for direct model transmissions should be controlled such that they scale as$\mathcal {O}(t^{2})$where${t}$is the index of communication rounds, but can stay$\mathcal {O}(1)$(i.e., constant) for model differential transmissions. The key insight of these theoretical results is a “flying under the radar” principle – stochastic gradient descent (SGD) is an inherent noisy process and uplink/downlink communication noises can be tolerated as long as they do not dominate the time-varying SGD noise. We exemplify these theoretical findings with two widely adopted communication techniques – transmit power control and receive diversity combining – and further validate their performance advantages over the standard methods via numerical experiments using several real-world FL tasks.

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/tccn.2022.3140788

Cites

26 of 26 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

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

Cited by

See all 90

Metadata

Authors
Wei, X., & Shen, C.
Venue
IEEE Transactions on Cognitive Communications and Networking
Published
2022-06
Volume
8
Issue
2
Pages
1253-1268
ISSN
  • 2332-7731 (ISSN-L)
  • 2372-2045
OpenAlex
W3118874133
Cited by
90
References
26
FWCI
6.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: Federated Learning Over Noisy Channels: Convergence Analysis and Design Examples. https://app.cochat.ai/papers/10.1109/tccn.2022.3140788
The paper
Wei, X., & Shen, C. (2022). Federated Learning Over Noisy Channels: Convergence Analysis and Design Examples. IEEE Transactions on Cognitive Communications and Networking. https://doi.org/10.1109/tccn.2022.3140788

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.