AIAny
Icon for item

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

Estimates optimal learning rates for large-scale Mixture-of-Experts pretraining using a two-step, compute-efficient transfer: μP-based width transfer from small proxy models, then log-log linear extrapolation across token budgets to trillion-token horizons.

Introduction

Most hyperparameter searches for massive MoE pretraining are computationally prohibitive because optimal settings (especially learning rate) shift with both model width and token budget. The core insight of this paper is that width and token dimensions can be decoupled: μP-style parameterization yields learning-rate transferability across width, and a simple log-log linear law lets you extrapolate the optimal rate across token budgets from small proxy runs.

Key Findings
  • μP adaptation for MoE (with Multi-head Latent Attention and the Muon optimizer) makes optimal learning rates robustly transferable across width-scaled proxy models, eliminating the need for large-scale width sweeps.
  • Optimal learning rates across token budgets follow a predictable trend in log-log space; linear regression on proxy-derived optima achieves R² ≈ 0.95, enabling reliable extrapolation to very long training horizons.
  • Applying the two-step method, the authors predict an optimal learning rate of 3.85×10⁻⁴ for a 155B-total (17B active) MoE model trained to 10 trillion tokens and validate stable training and competitive downstream results.
  • The proxy search compute cost is small relative to full pretraining (proxy runs used ≈98× less total compute than the full pretraining run used for validation), making the approach practical for resource-constrained labs.
Who it's for and tradeoffs

Great fit if you need a principled, low-cost way to set the learning rate for large MoE pretraining: researchers and engineers planning wide MoE models or very long token budgets who can run small proxy experiments. Look elsewhere or plan extra experiments if you need guaranteed global optimality (the method targets learning-rate transfer and extrapolation rather than full multi-dimensional HP sweeps), if your architecture or optimizer differs substantially from the paper's setup, or if routing/load-balancing hyperparameters require joint tuning. The extrapolation assumes stable training dynamics after initial budget/scale-induced transients, so early-phase instability or radically different data curricula may reduce prediction fidelity.

Information

  • Websitearxiv.org
  • OrganizationsKakao Corp., Upstage AI
  • AuthorsNayeon Kim, Hojin Lee, Yunju Bak, Jaesun Park, Boseop Kim
  • Published date2026/08/20

More Items

Analyzes how on-policy distillation (OPD) transfers teacher LLM capabilities to student models across in-domain shifts, cross-domain transfer, and multi-teacher settings. Key findings: OPD conveys reasoning patterns rather than specific answers, same-origin teacher-student pairs generalize broadly, and multi-teacher combinations induce mixture-dependent tradeoffs.

Fine-tunes long-horizon LLM agents with evolution strategies so full-model updates run at inference-level GPU memory. Emphasizes trajectory-level credit via black-box rewards, online prompt–parameter co-evolution, and a cosine decay for perturbation scale to balance exploration and adaptation; suited for limited-GPU settings.

Enables interactive serving of large Mixture-of-Experts (MoE) models on personal machines by adapting offload and execution to measured device bandwidth and agentic workload patterns. Key features include bandwidth-adaptive execution, semantic-aware caching of recurrent state, and an elastic GPU expert cache; supports 20+ MoE models and runs models from ~35B to 753B on consumer/workstation GPUs.