Toward Understanding the Impact of Staleness in Distributed Machine Learning
By Wei Dai, Yi Zhou, Nanqing Dong, H. Zhang, Eric P. Xing. 2018
96 citations recorded by the source corpus.
Many distributed machine learning (ML) systems adopt the non-synchronous execution in order to alleviate the network communication bottleneck, resulting in stale parameters that do not reflect the latest updates. Despite much development in large-scale ML, the effects of staleness on learning are inconclusive as it is challenging to directly monitor or control staleness in complex distributed environments. In this work, we study the convergence behaviors of a wide array of ML models and algorithms under delayed updates. Our extensive experiments reveal the rich diversity of the effects of staleness on the convergence of ML algorithms and offer insights into seemingly contradictory reports in the literature. The empirical findings also inspire a new convergence analysis of stochastic gradient descent in non-convex optimization under staleness, matching the best-known convergence rate of O(1/\sqrt{T}).
Subfields: Artificial Intelligence, Computer Networks and Communications
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computer Networks and Communications
Citations in the corpus
- Age-Based Scheduling Policy for Federated Learning in Mobile Edge Networks (2019, background): “As pointed out by [16], the staleness of updates has a significant impact on the convergence rate of distributed machine learning models such as FL.”