Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 761

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

Broadband Analog Aggregation for Low-Latency Federated Edge Learning

Zhu, Guangxu, Wang, Yong, Huang, Kaibin · 2020 · IEEE Transactions on Wireless Communications

Abstract

To leverage rich data distributed at the network edge, a new machine-learning paradigm, called edge learning, has emerged where learning algorithms are deployed at the edge for providing intelligent services to mobile users. While computing speeds are advancing rapidly, the communication latency is becoming the bottleneck of fast edge learning. To address this issue, this work is focused on designing a low-latency multi-access scheme for edge learning. To this end, we consider a popular privacy-preserving framework, federated edge learning (FEEL), where a global AI-model at an edge-server is updated by aggregating (averaging) local models trained at edge devices. It is proposed that the updates simultaneously transmitted by devices over broadband channels should be analog aggregated “over-the-air” by exploiting the waveform-superposition property of a multi-access channel. Such broadband analog aggregation (BAA) results in dramatical communication-latency reduction compared with the conventional orthogonal access (i.e., OFDMA). In this work, the effects of BAA on learning performance are quantified targeting a single-cell random network. First, we derive two tradeoffs between communication-and-learning metrics, which are useful for network planning and optimization. The power control (“truncated channel inversion”) required for BAA results in a tradeoff between the update-reliability [as measured by the receive signal-to-noise ratio (SNR)] and the expected update-truncation ratio. Consider the scheduling of cell-interior devices to constrain path loss. This gives rise to the other tradeoff between the receive SNR and fraction of data exploited in learning. Next, the latency-reduction ratio of the proposed BAA with respect to the traditional OFDMA scheme is proved to scale almost linearly with the device population. Experiments based on a neural network and a real dataset are conducted for corroborating the theoretical results.

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/twc.2019.2946245

Cites

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

Research works printed but not linked: 15

  1. 2010, Timing Advance (TA) in LTE
  2. goodfellow, 2016, Deep Learning
  3. yang, 2018, Federated learning via over-the-air computation, arXiv 1812 11750
  4. 10.1109/TWC.2013.022113.120506 · doi:10.1109/twc.2013.022113.120506
  5. srivastava, 2014, Dropout: A simple way to prevent neural networks from overfitting, J Mach Learn Res, 15, 1929
  6. arunabha, 2010, Fundamentals of LTE
  7. kamp, 2018, Efficient decentralized deep learning by dynamic model averaging, arXiv 1807 03210
  8. chen, 2018, LAG: Lazily aggregated gradient for communication-efficient distributed learning, Proc Conf Neural Inf Process Syst (NIPS), 5055
  9. lin, 2018, Deep gradient compression: Reducing the communication bandwidth for distributed training, Proc Int Conf Learn Represent (ICLR), 1
  10. mcmahan, 2017, Communication-efficient learning of deep networks from decentralized data, Proc Int Conf Artif Intell Statist (AISTATS), 1
  11. zhu, 2018, Broadband analog aggregation for low-latency federated edge learning (extended version), arXiv 1812 11494
  12. chen, 2017, Revisiting distributed synchronous SGD, arXiv 1604 00981
  13. zhu, 2018, Towards an intelligent edge: Wireless communication meets machine learning, arXiv 1809 00343
  14. tandon, 2017, Gradient coding: Avoiding stragglers in distributed learning, Proc Int Conf Mach Learn (ICML), 3368
  15. poggi, 2017, 3 Key Internet of Things Trends to Keep Your Eye on in 2017

Cited by

See all 761

Metadata

Authors
Zhu, G., Wang, Y., & Huang, K.
Venue
IEEE Transactions on Wireless Communications
Published
2020-01
Volume
19
Issue
1
Pages
491-506
ISSN
  • 1536-1276 (ISSN-L)
  • 1558-2248
OpenAlex
W2944099577
Cited by
761
References
24
FWCI
45.58
Type
journal article
Language
en
Open access
closed
Funders
Hong Kong Research Grants Council (17208319, 17209917, 17259416)

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

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.