Skip to content
Preprint

Let's Scale Step by Step: Compute-Efficient Hyperparameter Transfer for Large-Scale Mixture-of-Experts

Aug 2026 · 0 citations · 55 references
Computer Science

TL;DR

A compute-efficient, two-step hyperparameter transfer framework that estimates optimal learning rates for training large MoE models by transferring them across scaling model widths, and subsequently extrapolating to trillion-token horizons is proposed.

Abstract

Mixture-of-Experts (MoE) architectures significantly expand model capacity without a proportional increase in computational cost. However, optimizing their hyperparameters---particularly the learning rate---at extreme scales of both model size and token budget via sweeping remains computationally prohibitive. In this paper, we propose a compute-efficient, two-step hyperparameter transfer framework that estimates optimal learning rates for training large MoE models by transferring them across scaling model widths, and subsequently extrapolating to trillion-token horizons. First, we formulate a Maximal Update Parameterization ($\mu$P) adaptation for MoE architectures utilizing Multi-head Latent Attention (MLA) and the Muon optimizer, demonstrating that optimal learning rates transfer consistently across width-scaled models. Second, we extend this transferability along the token dimension by establishing a predictive scaling law. By applying linear regression to the optimal values derived from small proxy models on limited budgets, we successfully extrapolate the ideal learning rate to massive training horizons (e.g., 10 trillion tokens) with high fidelity ($R^2=0.95$). Consequently, this indicates that proxy training on small models is sufficient to determine the optimal learning rate for the extensive training of large-scale MoEs. We apply the proposed methodology to pretrain our foundation model (155B total, 17B active parameters) from scratch, and the stable training and evaluation results validate that optimal configurations for full-scale target models can be accurately predicted with minimal ablation costs.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Hyperparameter Scaling Laws Across MoE Sparsity

This work shows that conventional hyperparameter scaling laws are insufficient for ultra-sparse MoEs: the optimal learning rate and batch size vary with activation ratio, and these shifts cannot be explained by either total or activated parameter count alone.

Chang-Xin Tian, Kun-Long Chen, Jia Liu et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Deriving Scaling Laws for OpenEuroLLM Models: Learning Rate, Batch Size and Loss

This study establishes a first baseline and scaling procedure for the development of future OpenEuroLLM models, and characterize the dependence of loss on model capacity and dataset size, evaluating recently proposed scaling forms that explicitly model their interaction.

Niccolò Ajroldi, Diana-Alexandra Onutu, Haider Al-Tahan et al. · 1 citation
Preprint Aug 2026

LLaDA MoE v2: Scaling Mixture-of-Experts Diffusion Language Models

This work systematically characterize how optimization hyperparameters, compute allocation, and architecture scale for MoE dLLMs, identifying quantitative differences from scaling trends previously reported for AR models.

Fengqi Zhu, Shaoxuan Xu, Jingyang Ou et al. · 1 citation
Aug 2026

Efficient sparse low-rank adaptation for large language models.

Parameter-efficient fine-tuning (PEFT) methods adapt foundation models to specific domains by selectively updating only a small subset of critical parameters, significantly reducing computational costs. Among these methods, Sparse Low-Rank Adaptation (SoRA) has emerged as an effective approach for fine-tuning large lan...

Jun-Ren Qiao, Shi-Song Wu, Wen-Qing Su · 0 citations
#artificial intelligence Preprint Sep 2026

Distribution-Consistent Inference for Dynamic Sparse Mixture-of-Experts

Mixture-of-Experts (MoE) architectures have emerged as a powerful paradigm for scaling model capacity while preserving efficient inference in large foundation models. However, most MoE models use a fixed top-$k$ expert selection policy, assigning the same expert budget to every token even when fewer experts may be suff...

Dohyeon Kim, Bedionita Soro, Sung Ju Hwang · 0 citations
#machine learning Preprint Sep 2026

SGD in Multiclass Logistic Regression: Sequential Learning and Scaling Laws

Theoretical scaling laws from linear regression to multiclass classification to multiclass classification are extended, while connecting to empirical scaling laws observed in large-scale neural networks.

Konstantinos Christopher Tsiolis, Denny Wu, Christos Thrampoulidis et al. · 0 citations

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