CoChat

On Analog Gradient Descent Learning Over Multiple Access Fading Channels

Open access
Sery, Tomer, Cohen, Kobi · 2020 · IEEE Transactions on Signal Processing

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

Abstract

We consider a distributed learning problem over multiple access channel (MAC) using a large wireless network. The computation is made by the network edge and is based on received data from a large number of distributed nodes which transmit over a noisy fading MAC. The objective function is a sum of the nodes' local loss functions. This problem has attracted a growing interest in distributed sensing systems, and more recently in federated learning. We develop a novel Gradient-Based Multiple Access (GBMA) algorithm to solve the distributed learning problem over MAC. Specifically, the nodes transmit an analog function of the local gradient using common shaping waveforms and the network edge receives a superposition of the analog transmitted signals used for updating the estimate. GBMA does not require power control or beamforming to cancel the fading effect as in other algorithms, and operates directly with noisy distorted gradients. We analyze the performance of GBMA theoretically, and prove that it can approach the convergence rate of the centralized gradient descent (GD) algorithm in large networks. Specifically, we establish a finite-sample bound of the error for both convex and strongly convex loss functions with Lipschitz gradient. Furthermore, we provide energy scaling laws for approaching the centralized convergence rate as the number of nodes increases. Finally, experimental results support the theoretical findings, and demonstrate strong performance of GBMA using synthetic and real data.

Overview

Integrity signals

Registry

Crossref · 10.1109/tsp.2020.2989580

Cites

63 of 63 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 63 references

Research works printed but not linked: 2

  1. 1998, Introductory lectures on convex programming volume i: Basic course, Lecture Notes Series, 3, 51
  2. bertin-mahieux, 0, Proc Int Conf Music Inf Retrieval

Cited by

See all 201

Metadata

Authors
Sery, T., & Cohen, K.
Affiliations
Ben-Gurion University of the Negev (IL)
Venue
IEEE Transactions on Signal Processing
Published
2020
Volume
68
Pages
2897-2911
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W2969343398
Cited by
172
References
64
Citations by year
2026: 8 · 2025: 24 · 2024: 29 · 2023: 29 · 2022: 28 · 2021: 37 · 2020: 15
FWCI
12.81
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Signal Processing (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
United States-Israel Binational Science Foundation (2017723)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Sensor Networks and Detection Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
Keywords
multiple access channel, fading channels, distributed learning, federated learning, noisy gradients, convergence rate, energy scaling law, finite-sample error bounds, large-scale wireless networks

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: On Analog Gradient Descent Learning Over Multiple Access Fading Channels. https://app.cochat.ai/papers/10.1109/tsp.2020.2989580
The paper
Sery, T., & Cohen, K. (2020). On Analog Gradient Descent Learning Over Multiple Access Fading Channels. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2020.2989580

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.