mlsanityData to 14 Oct 2026

DynMuon: A Dynamic Spectral Shaping View of Muon

arXiv 2605.17109 ↗First posted 16 May 2026cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

In recent years, Muon has emerged as the dominant method for training large language models, and transformers more broadly. The essential difference, when compared to standard gradient descent methods, is to replace the usual update matrix M=USigma V^top with its polar factor UV^top. In this work, we consider a class of Muon-like updates, where we replace the update M with USigmap V^top for some parameter p. We call this a "spectral-shaping" operation, and develop a theory of how to pick p which depends on (a) local curvature of the loss function, (b) noise stemming from stochastic gradients and label noise, and (c) training stage. Our theory and experimentation reveal a previously overlooked behavior: positive p helps early by emphasizing high-curvature directions and accelerating signal contraction, while mildly negative p helps later by reallocating update strength toward low-curvature directions that still contain useful training signals. Building on the insight, we propose DynMuon, an efficient dynamic spectral shaping method that schedules p from positive to mildly negative over training. Extensive experiments across model sizes, architectures, and training settings show that DynMuon consistently achieves lower validation loss than Muon, while requiring 10.6-26.5% fewer steps to reach the same target loss. Our code is available at https://github.com/fzwark/DynMuon.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 23 of its 30 references that are in the map. First posted on arXiv 16 May 2026.

Builds on

23 of 30 references.

References · 23

  1. 2020Scaling Laws for Neural Language Modelscited by 6,586
  2. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  3. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  4. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
  5. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
  6. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
  7. 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 674
  8. 2014New insights and perspectives on the natural gradient methodcited by 443
  9. 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
  10. 2018A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decaycited by 226
  11. 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
  12. 2025Training Deep Learning Models with Norm-Constrained LMOscited by 192
11 more
  1. 2021Primer: Searching for Efficient Transformers for Language Modelingcited by 164
  2. 2025Fantastic Pretraining Optimizers and Where to Find Themcited by 100
  3. 2025Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimizationcited by 92
  4. 2025Muon Optimizes Under Spectral Norm Constraintscited by 86
  5. 2023A Distributed Data-Parallel PyTorch Implementation of the Distributed Shampoo Optimizer for Training Neural Networks At-Scalecited by 77
  6. 2025Benchmarking Optimizers for Large Language Model Pretrainingcited by 68
  7. 2025PolarGrad: A Class of Matrix-Gradient Optimizers from a Unifying Preconditioning Perspectivecited by 52
  8. 2019On the adequacy of untuned warmup for adaptive optimizationcited by 35
  9. 2026Preconditioning Benefits of Spectral Orthogonalization in Muoncited by 30
  10. 2024Gradient Methods with Online Scalingcited by 11
  11. 2026Suspicious Alignment of SGD: A Fine-Grained Step Size Condition Analysiscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.