The GBMA algorithm lets distributed nodes transmit analog gradients over a fading multiple access channel without power control, and provably approaches centralized gradient descent convergence as the number of nodes grows.
Optimizing Pipelined Computation and Communication for Latency-Constrained Edge Learning
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Consider a device that is connected to an edge processor via a communication channel. The device holds local data that is to be offloaded to the edge processor so as to train a machine learning model, e.g., for regression or classification. Transmission of the data to the learning processor, as well as training based on Stochastic Gradient Descent (SGD), must be both completed within a time limit. Assuming that communication and computation can be pipelined, this letter investigates the optimal choice for the packet payload size, given the overhead of each data packet transmission and the ratio between the computation and the communication rates. This amounts to a tradeoff between bias and variance, since communicating the entire data set first reduces the bias of the training process but it may not leave sufficient time for learning. Analytical bounds on the expected optimality gap are derived so as to enable an effective optimization, which is validated in numerical results.
fields
cs.LG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Analog Gradient Descent Learning over Multiple Access Fading Channels
The GBMA algorithm lets distributed nodes transmit analog gradients over a fading multiple access channel without power control, and provably approaches centralized gradient descent convergence as the number of nodes grows.