mlsanityData to 14 Oct 2026

How Inner Optimizers Shape Replica Scaling

arXiv 2610.19064 ↗First posted 13 Oct 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Training large language models (LLMs) across geographically distributed and poorly interconnected compute pools or data centers has become a topic of significant interest. This has led to increased study of local optimization methods such as DiLoco for LLMs, especially those that use local (or inner) adaptive or preconditioned optimizers, which are critical for high-performance LLM training. However, a central challenge remains: it is well known that increasing the number of model replicas (replica scaling) while fixing the total training budget leads to monotonically decreasing performance. Existing work has empirically demonstrated that the choice of inner optimizer (Muon v.s. AdamW) can significantly improve this trend, but offers only limited explanation of the performance difference. In this work, we consider a range of inner-optimizers and identify two important factors that impact replica scaling: (1) the covariance structure of the pseudo-gradients and (2) the impact of batch size on the pseudogradient's noise scale. Based on these insights, we theoretically and empirically demonstrate that whitening-based pre-conditioning is a powerful inner-optimizer desideratum. Our empirical evaluation extends the results to reveal that whitening-based inner-optimizers achieve strong replica scaling (for 8-96 replicas), with performance relative to DP improving as parameters and data are scaled.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 31 references that are in the map. First posted on arXiv 13 Oct 2026.

Builds on

23 of 31 references.

References · 23

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2020Adaptive Federated Optimizationcited by 1,046
  3. 2018Local SGD Converges Fast and Communicates Littlecited by 605
  4. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
  5. 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
  6. 2024DataComp-LM: In search of the next generation of training sets for language modelscited by 398
  7. 2024SOAP: Improving and Stabilizing Shampoo using Adamcited by 192
  8. 2019On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimizationcited by 180
  9. 2023DiLoCo: Distributed Low-Communication Training of Language Modelscited by 121
  10. 2022On the SDEs and Scaling Rules for Adaptive Gradient Algorithmscited by 104
  11. 2025Fantastic Pretraining Optimizers and Where to Find Themcited by 100
  12. 2015Optimal whitening and decorrelationcited by 97
11 more
  1. 2025No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspacescited by 96
  2. 2025Small Batch Size Training for Language Models: When Vanilla SGD Works, and Why Gradient Accumulation Is Wastefulcited by 41
  3. 2022On the Unreasonable Effectiveness of Federated Averaging with Heterogeneous Datacited by 38
  4. 2025Streaming DiLoCo with overlapping communication: Towards a Distributed Free Lunchcited by 28
  5. 2025Communication-Efficient Language Model Training Scales Reliably and Robustly: Scaling Laws for DiLoCocited by 27
  6. 2024Asynchronous Local-SGD Training for Language Modelingcited by 26
  7. 2025MuLoCo: Muon is a practical inner optimizer for DiLoCocited by 18
  8. 2025A Stable Whitening Optimizer for Efficient Neural Network Trainingcited by 18
  9. 2025Understanding and Improving Shampoo and SOAP via Kullback-Leibler Minimizationcited by 16
  10. 2026SOAP, Muon, and Beyond: Pushing LLM Pretraining Scalescited by 6
  11. 2026Can Model Merging Improve Aggregation in DiLoCo?cited by 1

Built on by

Not cited yet.