REVIEW 1 cited by
Asynchronous Decentralized Learning over Unreliable Wireless Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Asynchronous Decentralized Learning over Unreliable Wireless Networks
read the original abstract
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.
Forward citations
Cited by 1 Pith paper
-
Decentralised Federated Learning over Temporal Networks: The Role of Heterogeneities
DFL under local averaging is lazy random-walk diffusion on temporal networks; real structural and temporal heterogeneities slow mixing by one to two orders of magnitude relative to standard synthetic benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.