Cited by 139Privacy-Preserving Technologies in DataStochastic Gradient Optimization TechniquesDistributed Sensor Networks and Detection Algorithms

Communication-efficient distributed learning: An overview

Cao, Xuanyu, Başar, Tamer, Diggavi, Suhas, Eldar, Yonina C., Letaief, Khaled B., Poor, H. Vincent, Zhang, Junshan·2023·IEEE Journal on Selected Areas in Communications

Abstract

Distributed learning is envisioned as the bedrock of next-generation intelligent networks, where intelligent agents, such as mobile devices, robots, and sensors, exchange information with each other or a parameter server to train machine learning models collaboratively without uploading raw data to a central entity for centralized processing. By utilizing the computation/communication capability of individual agents, the distributed learning paradigm can mitigate the burden at central processors and help preserve data privacy of users. Despite its promising applications, a downside of distributed learning is its need for iterative information exchange over wireless channels, which may lead to high communication overhead unaffordable in many practical systems with limited radio resources such as energy and bandwidth. To overcome this communication bottleneck, there is an urgent need for the development of communication-efficient distributed learning algorithms capable of reducing the communication cost and achieving satisfactory learning/optimization performance simultaneously. In this paper, we present a comprehensive survey of prevailing methodologies for communication-efficient distributed learning, including reduction of the number of communications, compression and quantization of the exchanged information, radio resource management for efficient learning, and game-theoretic mechanisms incentivizing user participation. We also point out potential directions for future research to further enhance the communication efficiency of distributed learning in various scenarios.

Integrity signals

Registry

Crossref · 10.1109/jsac.2023.3242710

Cites

163 of 163 references verified0 citation errors · 0 not checkable

Statistics

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

Claims the paper makes

This paper’s full text isn’t openly available, 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?

Cites

Flagged first, then by citations

Cited by

Authors
Cao, X., Başar, T., Diggavi, S., Eldar, Y. C., Letaief, K. B., Poor, H. V., & Zhang, J.
Affiliations
  • Hong Kong University of Science and Technology (HK)
  • University of Illinois Urbana-Champaign (US)
  • University of California, Los Angeles (US)
  • Weizmann Institute of Science (IL)
  • Princeton University (US)
  • University of California, Davis (US)
Venue
IEEE Journal on Selected Areas in Communications
Published
2023-04
Volume
41
Issue
4
Pages
851-873
ISSN
  • 0733-8716 (ISSN-L)
  • 1558-0008
OpenAlex
W4320005491
Cited by
139
References
163
Citations by year
2026: 40 · 2025: 47 · 2024: 41 · 2023: 11
FWCI
13.05
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Journal on Selected Areas in Communications (publishedVersion)
  • Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
Funders
  • U.S. National Science Foundation (CNS-2128448, 2007714, 2139304, 2146838)
  • U.S. Army Research Office under MURI (AG285)
  • U.S. Army Research Laboratory Cooperative (W911NF-17-2-0196)
  • National Natural Science Foundation of China (62203373)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Sensor Networks and Detection Algorithms
Keywords
federated learning, communication cost reduction, data compression, quantization, radio resource management, user participation incentives, data privacy, wireless communication

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