mlsanityData to 14 Oct 2026

Eager Updates For Overlapped Communication and Computation in DiLoCo

arXiv 2502.12996 ↗First posted 18 Feb 2025cs.CLcited by 11

Not on the map. Why?

Abstract (arXiv)

Distributed optimization methods such as DiLoCo have been shown to be effective in training very large models across multiple distributed workers, such as datacenters. These methods split updates into two parts: an inner optimization phase, where the workers independently execute multiple optimization steps on their own local data, and an outer optimization step, where the inner updates are synchronized. While such approaches require orders of magnitude less communication than standard data-parallel training, in settings where the workers are datacenters, even the limited communication requirements of these approaches can still cause significant slow downs due to the blocking necessary at each outer optimization step. In this paper, we investigate techniques to mitigate this issue by overlapping communication with computation in a manner that allows the outer optimization step to fully overlap with the inner optimization phase. We show that a particular variant, dubbed eager updates, provides competitive performance with standard DiLoCo in settings with low bandwidth between workers.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 30 of its 42 references that are in the map. First posted on arXiv 18 Feb 2025.

Builds on

30 of 42 references.

References · 30

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2020Scaling Laws for Neural Language Modelscited by 6,586
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  6. 2019Advances and Open Problems in Federated Learningcited by 3,046
  7. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  8. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  9. 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
  10. 2020Adaptive Federated Optimizationcited by 1,046
  11. 2018Local SGD Converges Fast and Communicates Littlecited by 605
  12. 2024Dolma: an Open Corpus of Three Trillion Tokens for Language Model Pretraining Researchcited by 483
18 more
  1. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 478
  2. 2020Query-Key Normalization for Transformerscited by 280
  3. 2019Asynchronous Federated Optimizationcited by 267
  4. 2018Don't Use Large Mini-Batches, Use Local SGDcited by 202
  5. 2022Patching open-vocabulary models by interpolating weightscited by 190
  6. 2020Memory-Efficient Pipeline-Parallel DNN Trainingcited by 134
  7. 2023DiLoCo: Distributed Low-Communication Training of Language Modelscited by 121
  8. 2015Asynchronous Parallel Stochastic Gradient for Nonconvex Optimizationcited by 116
  9. 2022Petals: Collaborative Inference and Fine-tuning of Large Modelscited by 87
  10. 2021Distributed Deep Learning in Open Collaborationscited by 58
  11. 2021Moshpit SGD: Communication-Efficient Decentralized Training on Heterogeneous Unreliable Devicescited by 36
  12. 2023Towards Federated Foundation Models: Scalable Dataset Pipelines for Group-Structured Learningcited by 29
  13. 2025Streaming DiLoCo with overlapping communication: Towards a Distributed Free Lunchcited by 28
  14. 2024Asynchronous Local-SGD Training for Language Modelingcited by 26
  15. 2020Faster On-Device Training Using New Federated Momentum Algorithmcited by 25
  16. 2024OpenDiLoCo: An Open-Source Framework for Globally Distributed Low-Communication Trainingcited by 24
  17. 2024DrJAX: Scalable and Differentiable MapReduce Primitives in JAXcited by 9
  18. 2024eXmY: A Data Type and Technique for Arbitrary Bit Precision Quantizationcited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 4; 2026: 7.

11 papers.