Skip to content

How Inner Optimizers Shape Replica Scaling

Oct 2026 · 0 citations · 31 references
Computer Science

TL;DR

It is theoretically and empirically demonstrated that whitening-based pre-conditioning is a powerful inner-optimizer desideratum, and 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.

Abstract

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.

View source

Similar papers

#machine learning Preprint Oct 2026

The Best Optimizer Depends on Batch Size

A plethora of new adaptive optimizers are designed to efficiently estimate and use minibatch gradient statistics to shape parameter updates, but they are typically benchmarked at a single batch size. Hyperparameter scaling rules promise to preserve performance as batch size and gradient noise change, suggesting that th...

Xing-Yu Dang, Kai-Yue Wen, Sadhika Malladi · 1 citation · ⚡1
Open access Oct 2026

SimplexLoRA: Dynamic Rank Updating via Alternating Minimization with Simplex Projection

The success of large language models in real-world applications relies on parameter-efficient fine-tuning methods such as Low-Rank Adaptation (LoRA), which inserts compact, trainable adapters into selected layers. In this paper, we propose SimplexLoRA, a LoRA variant that adaptively adjusts adapter ranks during fine-tu...

Igor Shalygin, G. Davydenko, Andrey Veprikov et al. · 0 citations

GRPO Training Dynamics for Small Language Models

Group Relative Policy Optimization (GRPO) has emerged as a memory-efficient reinforcement fine-tuning (RFT) technique for reasoning-intensive tasks. How- ever, GRPO training dynamics on small language models (SLMs) remain poorly understood, limiting its reliable adoption and reproducibility in open and resource- constr...

Rajat Ghosh, Vaishnavi Bhargava, Henry Wong et al. · 0 citations
Preprint Oct 2026

On Data Scaling in Tabular ML: More Data, Better Generalization?

Recent work in tabular machine learning has emphasized the importance of diverse and realistic evaluation settings. The niche of large-scale (1M+) data, however, remains under-explored. To study training-data scaling, we assemble eight real-world tabular datasets with up to around ten million training examples, retaini...

Ivan Rubachev, Н. А. Лазарев, Artem Babenko · 0 citations
#machine learning Preprint Oct 2026

LatentLoop: Scaling Looped MoE Models with Asymmetric Compute Allocation

Looped Mixture-of-Experts (MoE) models combine parameter reuse with sparse computation to improve performance under matched budgets. Prior work demonstrates that different loop visits can play different roles even when they share parameters. To probe the contributions of different loop visits, we learn separate residua...

Ze-Feng He, Yun-Kai Chai, Xiao-Yang Chen et al. · 0 citations

Scaling Influence Functions in LLMs through Eigenbasis-Corrected One-Bit Gradient Projection

This work describes the optimal fixed-dimensional linear representation and proposes eigenbasis-corrected one-bit gradient projection (EOGP) to approximate it at scale and predicts retraining outcomes more accurately than the evaluated compression baselines while using one-sixteenth of their per-example storage.

Jaeseung Heo, J. Rosser, Dongwoo Kim · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.