Towards a Principled Muon under μmathsfP: Ensuring Spectral Conditions throughout Training
Not on the map. Why?
Abstract (arXiv)
The μ-parameterization (μP) provides a principled foundation for large language model (LLM) training by prescribing width-independent learning dynamics, which in turn enables predictable scaling behavior and robust hyperparameter transfer across model sizes. A central requirement of μP is the satisfaction of certain spectral conditions on weight matrices, which ensure consistent feature learning and optimization behavior as model width grows. While these conditions are well understood in theory, guaranteeing their validity in practical training for matrix-based optimizers such as Muon is still under studied. Existing works that study Muon under μP exhibit important limitations: they either do not ensure that the spectral conditions hold throughout the entire training horizon, or require repeated spectral normalization (or Newton-Schulz iterations) applied to both weights and updates, leading to significant computational overhead and reduced practicality. In this work, we show how to reliably guarantee the spectral conditions required by μP for Muon during the entire training process. Our key insight is that for moderately large models, maintaining spectral control at the level of optimizer updates alone is sufficient to preserve μP-compatible scaling, eliminating the need for explicit spectral normalization of the weights. Based on this principle, we develop a variant of Muon, namely Muon++, that satisfies spectral condition throughout the training process. Our results bridge the gap between the theoretical promises of μP and the practical deployment of matrix-based optimizers in long-horizon training. We also take the first step towards an adaptive spectral condition by incorporating data-dependent effects, making it better suited for long-horizon LLM training.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 49 of its 74 references that are in the map. First posted on arXiv 4 Jan 2026.
Builds on
49 of 74 references.
References · 49
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2023A Survey of Large Language Modelscited by 2,576
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 723
- 2024DeepSeek LLM: Scaling Open-Source Language Models with Longtermismcited by 642
- 2025Kimi K2: Open Agentic Intelligencecited by 567
37 more
- 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
- 2025Muon is Scalable for LLM Trainingcited by 428
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
- 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 426
- 2022Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfercited by 288
- 2015Scalable Bayesian Optimization Using Deep Neural Networkscited by 284
- 2015Non-stochastic Best Arm Identification and Hyperparameter Optimizationcited by 221
- 2024Old Optimizer, New Norm: An Anthologycited by 193
- 2025Training Deep Learning Models with Norm-Constrained LMOscited by 192
- 2024Scaling Laws for Fine-Grained Mixture of Expertscited by 173
- 2023A Spectral Condition for Feature Learningcited by 109
- 2018Trainability and Accuracy of Neural Networks: An Interacting Particle System Approachcited by 106
- 2025Fantastic Pretraining Optimizers and Where to Find Themcited by 100
- 2023Tensor Programs VI: Feature Learning in Infinite-Depth Neural Networkscited by 97
- 2024Scaling Exponents Across Parameterizations and Optimizerscited by 76
- 2025Gluon: Making Muon & Scion Great Again! (Bridging Theory and Practice of LMO-based Optimizers for LLMs)cited by 72
- 2025Benchmarking Optimizers for Large Language Model Pretrainingcited by 68
- 2024MARS: Unleashing the Power of Variance Reduction for Training Large Modelscited by 64
- 2025PolarGrad: A Class of Matrix-Gradient Optimizers from a Unifying Preconditioning Perspectivecited by 52
- 2023Tensor Programs IVb: Adaptive Optimization in the Infinite-Width Limitcited by 38
- 2025Straight to Zero: Why Linearly Decaying the Learning Rate to Zero Works Best for LLMscited by 35
- 2015Convergence rates of sub-sampled Newton methodscited by 33
- 2024u-μP: The Unit-Scaled Maximal Update Parametrizationcited by 29
- 2022Infinite-width limit of deep linear neural networkscited by 20
- 2025Weight Decay may matter more than muP for Learning Rate Transfer in Practicecited by 20
- 2021Hyperparameter Transfer Learning with Adaptive Complexitycited by 17
- 2024Sparse maximal update parameterization: A holistic approach to sparse training dynamicscited by 16
- 2023On the Parameterization of Second-Order Optimization Effective Towards the Infinite Widthcited by 15
- 2023The Feature Speed Formula: a flexible approach to scale hyper-parameters of deep neural networkscited by 11
- 2024μP2: Effective Sharpness Aware Minimization Requires Layerwise Perturbation Scalingcited by 10
- 2025MARS-M: When Variance Reduction Meets Matricescited by 10
- 2025Optimal Scaling Needs Optimal Normcited by 8
- 2025Robust Layerwise Scaling Rules by Proper Weight Decay Tuningcited by 8
- 2021Training Integrable Parameterizations of Deep Neural Networks in the Infinite-Width Limitcited by 7
- 2025On the Surprising Effectiveness of Large Learning Rates under Standard Width Scalingcited by 6
- 2025Global Convergence and Rich Feature Learning in L-Layer Infinite-Width Neural Networks under μP Parametrizationcited by 4
- 2015Faster SGD Using Sketched Conditioningcited by 3
Built on by
Not cited yet.