mlsanityData to 7 Oct 2026

Ordered Local Momentum for Asynchronous Distributed Learning under Arbitrary Delays

arXiv 2601.12322 ↗First posted 18 Jan 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Momentum SGD (MSGD) serves as a foundational optimizer in training deep models due to momentum's key role in accelerating convergence and enhancing generalization. Meanwhile, asynchronous distributed learning is crucial for training large-scale deep models, especially when the computing capabilities of the workers in the cluster are heterogeneous. To reduce communication frequency, local updates are widely adopted in distributed learning. However, how to implement asynchronous distributed MSGD with local updates remains unexplored. To solve this problem, we propose a novel method, called underlineordered underlinelocal underlinemomentum (OrLoMo), for asynchronous distributed learning. In OrLoMo, each worker runs MSGD locally. Then the local momentum from each worker will be aggregated by the server in order based on its global iteration index. To the best of our knowledge, OrLoMo is the first method to implement asynchronous distributed MSGD with local updates. We prove the convergence of OrLoMo for non-convex problems under arbitrary delays. Experiments validate that OrLoMo can outperform its synchronous counterpart and other asynchronous methods.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 34 references that are in the map. First posted on arXiv 18 Jan 2026.

Builds on

25 of 34 references.

References · 25

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  4. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  5. 2019On the Convergence of Adam and Beyondcited by 834
  6. 2018Local SGD Converges Fast and Communicates Littlecited by 595
  7. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
  8. 2018Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learningcited by 277
  9. 2019PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimizationcited by 234
  10. 2018Don't Use Large Mini-Batches, Use Local SGDcited by 201
  11. 2021Federated Learning with Buffered Asynchronous Aggregationcited by 188
  12. 2019A Survey on Distributed Machine Learningcited by 187
13 more
  1. 2019Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computationscited by 179
  2. 2019On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimizationcited by 178
  3. 2017Asynchronous Decentralized Parallel Stochastic Gradient Descentcited by 159
  4. 2019SlowMo: Improving Communication-Efficient Distributed SGD with Slow Momentumcited by 121
  5. 2015Asynchronous Parallel Stochastic Gradient for Nonconvex Optimizationcited by 115
  6. 2019Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronizationcited by 106
  7. 2016Asynchronous Stochastic Gradient Descent with Delay Compensationcited by 98
  8. 2022Asynchronous SGD Beats Minibatch SGD Under Arbitrary Delayscited by 61
  9. 2018A Tight Convergence Analysis for Stochastic Gradient Descent with Delayed Updatescited by 47
  10. 2025Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexitycited by 17
  11. 2024FADAS: Towards Federated Adaptive Asynchronous Optimizationcited by 10
  12. 2024Federated Learning under Periodic Client Participation and Heterogeneous Data: A New Communication-Efficient Algorithm and Analysiscited by 8
  13. 2024Achieving Linear Speedup in Asynchronous Federated Learning with Heterogeneous Clientscited by 7

Built on by

Not cited yet.