Accelerated Gradient Descent Learning over Multiple Access Fading Channels
Raz Paul, Yuval Friedman, Kobi Cohen

TL;DR
This paper introduces AGMA, a novel accelerated gradient descent algorithm for distributed learning over wireless channels, which improves convergence rates without complex power control or beamforming.
Contribution
The paper develops AGMA, a momentum-based distributed learning algorithm that handles noisy fading channels and achieves faster convergence without requiring power control.
Findings
AGMA approaches the best linear convergence rate for strongly convex functions.
AGMA significantly improves sub-linear convergence for convex functions.
Simulation results demonstrate better performance of AGMA on real datasets.
Abstract
We consider a distributed learning problem in a wireless network, consisting of N distributed edge devices and a parameter server (PS). The objective function is a sum of the edge devices' local loss functions, who aim to train a shared model by communicating with the PS over multiple access channels (MAC). This problem has attracted a growing interest in distributed sensing systems, and more recently in federated learning, known as over-the-air computation. In this paper, we develop a novel Accelerated Gradient-descent Multiple Access (AGMA) algorithm that uses momentum-based gradient signals over noisy fading MAC to improve the convergence rate as compared to existing methods. Furthermore, AGMA does not require power control or beamforming to cancel the fading effect, which simplifies the implementation complexity. We analyze AGMA theoretically, and establish a finite-sample bound of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
