mlsanityData to 14 Oct 2026

Subspace Networks: Scaling Decentralized Training with Communication-Efficient Model Parallelism

arXiv 2506.01260 ↗First posted 2 Jun 2025cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

Scaling models has led to significant advancements in deep learning, but training these models in decentralized settings remains challenging due to communication bottlenecks. While existing compression techniques are effective in data-parallel, they do not extend to model parallelism. Unlike data-parallel training, where weight gradients are exchanged, model-parallel requires compressing activations and activation gradients as they propagate through layers, accumulating compression errors. We propose a novel compression algorithm that compresses both forward and backward passes, enabling up to 99% compression with no convergence degradation with negligible memory/compute overhead. By leveraging a recursive structure in transformer networks, we predefine a low-dimensional subspace to confine the activations and gradients, allowing full reconstruction in subsequent layers. Our method achieves up to 100x improvement in communication efficiency and enables training billion-parameter-scale models over low-end GPUs connected via consumer-grade internet speeds as low as 80Mbps, matching the convergence of centralized datacenter systems with 100Gbps connections with model parallel.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 49 of its 64 references that are in the map. First posted on arXiv 2 Jun 2025.

Builds on

49 of 64 references.

References · 49

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2016Pointer Sentinel Mixture Modelscited by 3,096
  5. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  6. 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,986
  7. 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,043
  8. 2019Big Transfer (BiT): General Visual Representation Learningcited by 769
  9. 2023PyTorch FSDP: Experiences on Scaling Fully Sharded Data Parallelcited by 660
  10. 2021Efficient Large-Scale Language Model Training on GPU Clusters Using Megatron-LMcited by 632
  11. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
  12. 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 502
37 more
  1. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 478
  2. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
  3. 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 419
  4. 20218-bit Optimizers via Block-wise Quantizationcited by 403
  5. 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 367
  6. 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 310
  7. 2019PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimizationcited by 238
  8. 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 221
  9. 2018Gradient Descent Happens in a Tiny Subspacecited by 217
  10. 2017Gradient Sparsification for Communication-Efficient Distributed Optimizationcited by 201
  11. 2020A Simple Convergence Proof of Adam and Adagradcited by 171
  12. 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 139
  13. 2018ATOMO: Communication-efficient Learning via Atomic Sparsificationcited by 136
  14. 2023DiLoCo: Distributed Low-Communication Training of Language Modelscited by 121
  15. 2024Forest-of-Thought: Scaling Test-Time Compute for Enhancing LLM Reasoningcited by 110
  16. 2023A Spectral Condition for Feature Learningcited by 109
  17. 2023Convergence of Adam Under Relaxed Assumptionscited by 99
  18. 2022Decentralized Training of Foundation Models in Heterogeneous Environmentscited by 87
  19. 2024TorchTitan: One-stop PyTorch native solution for production ready LLM pre-trainingcited by 85
  20. 2018Error Compensated Quantized SGD and its Applications to Large-scale Distributed Optimizationcited by 76
  21. 20211-bit Adam: Communication Efficient Large-Scale Training with Adam's Convergence Speedcited by 75
  22. 2021Pufferfish: Communication-efficient Models At No Extra Costcited by 61
  23. 2023SWARM Parallelism: Training Large Models Can Be Surprisingly Communication-Efficientcited by 59
  24. 2021Distributed Deep Learning in Open Collaborationscited by 58
  25. 2023PanGu-Sigma: Towards Trillion Parameter Language Model with Sparse Heterogeneous Computingcited by 56
  26. 2023Transformers learn through gradual rank increasecited by 52
  27. 2020Towards Crowdsourced Training of Large Neural Networks using Decentralized Mixture-of-Expertscited by 43
  28. 2016Efficient Distributed Learning with Sparsitycited by 38
  29. 2021Moshpit SGD: Communication-Efficient Decentralized Training on Heterogeneous Unreliable Devicescited by 36
  30. 2021ZerO Initialization: Initializing Neural Networks with only Zeros and Onescited by 28
  31. 2020Adam^+: A Stochastic Method with Adaptive Variance Reductioncited by 18
  32. 2024Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variancecited by 14
  33. 2023Does compressing activations help model parallel training?cited by 12
  34. 2018Kalman Gradient Descent: Adaptive Variance Reduction in Stochastic Optimizationcited by 8
  35. 2024Learning on Transformers is Provable Low-Rank and Sparse: A One-layer Analysiscited by 8
  36. 2024Activations and Gradients Compression for Model-Parallel Trainingcited by 7
  37. 2020Stochastic Gradient Variance Reduction by Solving a Filtering Problemcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 11.

12 papers.