DiPaCo: Distributed Path Composition
Not on the map. Why?
Abstract (arXiv)
Progress in machine learning (ML) has been fueled by scaling neural network models. This scaling has been enabled by ever more heroic feats of engineering, necessary for accommodating ML approaches that require high bandwidth communication between devices working in parallel. In this work, we propose a co-designed modular architecture and training approach for ML models, dubbed DIstributed PAth COmposition (DiPaCo). During training, DiPaCo distributes computation by paths through a set of shared modules. Together with a Local-SGD inspired optimization (DiLoCo) that keeps modules in sync with drastically reduced communication, Our approach facilitates training across poorly connected and heterogeneous workers, with a design that ensures robustness to worker failures and preemptions. At inference time, only a single path needs to be executed for each input, without the need for any model compression. We consider this approach as a first prototype towards a new paradigm of large-scale learning, one that is less synchronous and more modular. Our experiments on the widely used C4 benchmark show that, for the same amount of training steps but less wall-clock time, DiPaCo exceeds the performance of a 1 billion-parameter dense transformer language model by choosing one of 256 possible paths, each with a size of 150 million parameters.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 20 of its 30 references that are in the map. First posted on arXiv 15 Mar 2024.
Builds on
20 of 30 references.
References · 20
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2022Flamingo: a Visual Language Model for Few-Shot Learningcited by 4,337
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,973
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
- 2021Improving language models by retrieving from trillions of tokenscited by 1,278
- 2020MAD-X: An Adapter-Based Framework for Multi-Task Cross-Lingual Transfercited by 443
- 2013Learning Factored Representations in a Deep Mixture of Expertscited by 275
- 2022Unified Scaling Laws for Routed Language Modelscited by 249
- 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 187
8 more
- 2021Efficient Large Scale Language Modeling with Mixtures of Expertscited by 175
- 2020Memory-Efficient Pipeline-Parallel DNN Trainingcited by 133
- 2019Task-Driven Modular Networks for Zero-Shot Compositional Learningcited by 121
- 2022Petals: Collaborative Inference and Fine-tuning of Large Modelscited by 84
- 2017Hard Mixtures of Experts for Large Scale Weakly Supervised Visioncited by 67
- 2023Scaling Expert Language Models with Unsupervised Domain Discoverycited by 59
- 2020Towards Crowdsourced Training of Large Neural Networks using Decentralized Mixture-of-Expertscited by 43
- 2021Federated Mixture of Expertscited by 27
Built on by
Citing papers per year: 2024: 1; 2025: 4; 2026: 4.
9 papers.
- 2024The Future of Large Language Model Pre-training is Federatedcited by 30
- 2025Streaming DiLoCo with overlapping communication: Towards a Distributed Free Lunchcited by 26
- 2025Communication-Efficient Language Model Training Scales Reliably and Robustly: Scaling Laws for DiLoCocited by 23
- 2026Latent Space Communication via K-V Cache Alignmentcited by 9
- 2025Understanding Outer Optimizers in Local SGD: Learning Rates, Momentum, and Accelerationcited by 7
- 2025NoLoCo: No-all-reduce Low Communication Training Method for Large Modelscited by 4
- 2026Pretraining A Large Language Model using Distributed GPUs: A Memory-Efficient Decentralized Paradigmcited by 0
- 2026FoMoE: Breaking the Full-Replica Barrier with a Federation of MoEscited by 0
- 2026Emergent Specialization in Populations of Self-Supervised Collaborative Vision Experts Without a Shared Gate or Cross-Agent Gradientscited by 0
- 2026Emergent Specialization in Populations of Self-Supervised Collaborative Vision Experts Without a Shared Gate or Cross-Agent Gradients29 Sep 2026
- 2026FoMoE: Breaking the Full-Replica Barrier with a Federation of MoEs17 Jun 2026
- 2026Pretraining A Large Language Model using Distributed GPUs: A Memory-Efficient Decentralized Paradigm12 Feb 2026
- 2026Latent Space Communication via K-V Cache Alignment4 Jan 2026
- 2025Understanding Outer Optimizers in Local SGD: Learning Rates, Momentum, and Acceleration12 Sep 2025
- 2025NoLoCo: No-all-reduce Low Communication Training Method for Large Models12 Jun 2025
- 2025Communication-Efficient Language Model Training Scales Reliably and Robustly: Scaling Laws for DiLoCo12 Mar 2025
- 2025Streaming DiLoCo with overlapping communication: Towards a Distributed Free Lunch30 Jan 2025
- 2024The Future of Large Language Model Pre-training is Federated17 May 2024