On Analog Gradient Descent Learning Over Multiple Access Fading Channels
Open accessThe 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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“The convergence behavior demonstrates that the noisy iterates typically introduce non-negligible optimality gap in various FL algorithms, e.g., vanilla gradient method [174], quantized gradient method [175], sparsified gradient method [173], and operator splitting method [87].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [174]
Citations
Cites
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Goldsmith, A. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511841224 · Cited by 10,658
Mathematical Analysis of Random Noise
Rice, S. O. (1944) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1944.tb00874.x · Cited by 5,480
Mathematical Analysis of Random Noise
Rice, S. O. (1945) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1945.tb00453.x · Cited by 2,898
Adaptive Federated Learning in Resource Constrained Edge Computing Systems
Wang, S., Tuor, T., Salonidis, T., Leung, K. K., Makaya, C., He, T., & Chan, K. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2904348 · Cited by 2,232
Robust Stochastic Approximation Approach to Stochastic Programming
Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070704277 · Cited by 1,945
Federated Optimization: Distributed Machine Learning for On-Device Intelligence
Konečný, J., McMahan, H. B., Ramage, D., & Richtárik, P. (2016) · arXiv · doi:10.48550/arxiv.1610.02527 · Cited by 1,563
Pegasos: primal estimated sub-gradient solver for SVM
Shalev-Shwartz, S., Singer, Y., Srebro, N., & Cotter, A. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0420-4 · Cited by 1,477
Federated Learning via Over-the-Air Computation
Yang, K., Jiang, T., Shi, Y., & Ding, Z. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2961673 · Cited by 1,084 · cited 1×
“In [15], [16], multiple antennas were used at the receiver, where beamforming was used to maximize the number of devices scheduled for transmission.”
MethodBertin-Mahieux, T., Ellis, D. P. W., Whitman, B., & Lamere, P. (2011) · Columbia University · doi:10.7916/d8nz8j07 · Cited by 944 · cited 1×
“We used the dataset available by UCI Machine Learning Repository [58], extracted from the Million Song Dataset collaborative project between The Echo Nest and LabROSA [59].”
Method
Research works printed but not linked: 2
- 1998, Introductory lectures on convex programming volume i: Basic course, Lecture Notes Series, 3, 51
- bertin-mahieux, 0, Proc Int Conf Music Inf Retrieval
Cited by
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“The convergence behavior demonstrates that the noisy iterates typically introduce non-negligible optimality gap in various FL algorithms, e.g., vanilla gradient method [174], quantized gradient method [175], sparsified gradient method [173], and operator splitting method [87].”
MethodA Survey on Integrated Sensing, Communication, and Computation
Wen, D., Zhou, Y., Li, X., Shi, Y., Huang, K., & Letaief, K. B. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3521498 · Cited by 360
Over-the-Air Computing for Wireless Data Aggregation in Massive IoT
Zhu, G., Xu, J., Huang, K., & Cui, S. (2021) · IEEE Wireless Communications · doi:10.1109/mwc.011.2000467 · Cited by 235
Privacy for Free: Wireless Federated Learning via Uncoded Transmission With Adaptive Power Control
Liu, D., & Simeone, O. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3036948 · Cited by 234
Over-the-Air Federated Learning From Heterogeneous Data
Sery, T., Shlezinger, N., Cohen, K., & Eldar, Y. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3090323 · Cited by 219
Self-citation
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
- green
- arxiv.org
- Licence
- 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.