mlsanityData to 14 Oct 2026

Musec: MomentUm SpEctral Clipping for Stable Muon-type Training

arXiv 2609.11655 ↗First posted 10 Sep 2026cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Muon has emerged as a highly effective optimizer for large language model training, often achieving superior convergence and performance compared with the widely adopted Adam and AdamW optimizers. Nevertheless, Muon is prone to training instability due to its spectral flattening, manifested by loss spikes and unbounded growth of model weights. Existing approaches primarily rely on weight or attention-logit clipping, which require architecture-specific modifications and do not directly address instability across all model components. We propose MomentUm SpEctral Clipping (Musec), which replaces Muon's spectral flattening with spectral clipping: rather than setting all singular values of the momentum matrix to approximately one, Musec clips singular values that exceed a threshold while preserving the underlying spectral structure of the momentum. Our strategy provides an optimizer-level, architecture-agnostic mechanism for stabilizing Muon training. Theoretically, we establish convergence guarantees for Musec in nonconvex nonsmooth stochastic optimization. Practically, we develop Soft Musec, an efficient implementation that uses a smooth spectral saturation function approximated by coupled Newton-Schulz iterations. Empirically, Soft Musec consistently improves training stability over existing Muon variants across a wide range of learning rates and model sizes, remaining stable in settings where existing Muon variants diverge while matching their performance under well-tuned configurations.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 35 of its 48 references that are in the map. First posted on arXiv 10 Sep 2026.

Builds on

35 of 48 references.

References · 35

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  3. 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
  4. 2019Root Mean Square Layer Normalizationcited by 1,480
  5. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
  6. 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
  7. 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
  8. 2023Scaling Vision Transformers to 22 Billion Parameterscited by 694
  9. 2026GLM-5: from Vibe Coding to Agentic Engineeringcited by 587
  10. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
  11. 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 519
  12. 2025Muon is Scalable for LLM Trainingcited by 428
23 more
  1. 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
  2. 2024Old Optimizer, New Norm: An Anthologycited by 193
  3. 2025Training Deep Learning Models with Norm-Constrained LMOscited by 192
  4. 2023Small-scale proxies for large-scale Transformer training instabilitiescited by 183
  5. 2021Primer: Searching for Efficient Transformers for Language Modelingcited by 164
  6. 2018Stochastic model-based minimization of weakly convex functionscited by 159
  7. 2022RankMe: Assessing the downstream performance of pretrained self-supervised representations by their rankcited by 153
  8. 2025NorMuon: Making Muon more efficient and scalablecited by 84
  9. 2025Gluon: Making Muon & Scion Great Again! (Bridging Theory and Practice of LMO-based Optimizers for LLMs)cited by 72
  10. 2024The AdEMAMix Optimizer: Better, Faster, Oldercited by 54
  11. 2017Stochastic Methods for Composite and Weakly Convex Optimization Problemscited by 48
  12. 2023Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversioncited by 45
  13. 2021Oracle Complexity in Nonsmooth Nonconvex Optimizationcited by 39
  14. 2021A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensionscited by 39
  15. 2021On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functionscited by 31
  16. 2017Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problemscited by 30
  17. 2023Deterministic Nonsmooth Nonconvex Optimizationcited by 26
  18. 2026Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimizationcited by 14
  19. 2026Enhancing LLM Training via Spectral Clippingcited by 10
  20. 2026Muon with Finite Newton-Schulz: The Smoothing Benefit in Nonsmooth Nonconvex Optimizationcited by 5
  21. 2026Gradient Clipping Beyond Vector Norms: A Spectral Approach for Matrix-Valued Parameterscited by 2
  22. 2026MuCon: Clipped Muon Updates for LLM Trainingcited by 2
  23. 2026Convergence of Spectral Descent for Non-smooth Optimizationcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.