mlsanityData to 7 Oct 2026

Asynchronous Decentralized Learning over Unreliable Wireless Networks

arXiv 2202.00955 ↗First posted 2 Feb 2022cs.IT cs.LG eess.SPcited by 13

Not on the map. Why?

Abstract (arXiv)

Decentralized learning enables edge users to collaboratively train models by exchanging information via device-to-device communication, yet prior works have been limited to wireless networks with fixed topologies and reliable workers. In this work, we propose an asynchronous decentralized stochastic gradient descent (DSGD) algorithm, which is robust to the inherent computation and communication failures occurring at the wireless network edge. We theoretically analyze its performance and establish a non-asymptotic convergence guarantee. Experimental results corroborate our analysis, demonstrating the benefits of asynchronicity and outdated gradient information reuse in decentralized learning over unreliable wireless networks.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 9 of its 14 references that are in the map. First posted on arXiv 2 Feb 2022.

Builds on

9 of 14 references.

References · 9

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 361
  3. 2019Decentralized Deep Learning with Arbitrary Communication Compressioncited by 109
  4. 2018Slow and Stale Gradients Can Win the Race: Error-Runtime Trade-offs in Distributed SGDcited by 68
  5. 2021Federated Learning over Wireless Device-to-Device Networks: Algorithms and Convergence Analysiscited by 51
  6. 2020Decentralized Federated Learning via SGD over Wireless D2D Networkscited by 32
  7. 2021Over-the-Air Decentralized Federated Learningcited by 18
  8. 2020Decentralized SGD with Over-the-Air Computationcited by 16
  9. 2021Decentralized optimization with non-identical sampling in presence of stragglerscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 2; 2024: 3; 2025: 1; 2026: 3.

13 papers.

Sort: