mlsanityData to 7 Oct 2026

Why Muon Outperforms Adam: A Curvature Perspective

arXiv 2606.04662 ↗First posted 3 Jun 2026cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Muon improves training efficiency over Adam in large language-model training by about two times, but the local geometric source of this advantage remains unclear. Our work takes a first step toward demystifying Muon's superiority over Adam from a curvature perspective. First, we apply a second-order Taylor approximation to the training landscape and show that Muon achieves a larger one-step loss decrease than Adam at matched validation loss. The two optimizers have comparable first-order gains, but Muon consistently incurs a smaller second-order curvature penalty. Second, we decompose this curvature penalty into the squared update norm and Normalized Directional Sharpness (NDS). We find that Muon and Adam have comparable update norms, so Muon's smaller curvature penalty is driven by lower NDS, not update scale. Third, we study how training data and model structure shape Muon's NDS advantage. Using Zipf-Probabilistic Context-Free Grammar (PCFG) data with controlled imbalance, we show that data imbalance amplifies Muon's NDS advantage over Adam. A within-/cross-layer decomposition further shows that, in the middle and late stages of training, Muon's lower NDS is mainly sustained by smaller within-layer curvature. Beyond empirical evidence, we analyze stylized quadratic problems with heterogeneous curvature and gradient alignment toward high-curvature modes. We prove that Muon attains a smaller average NDS than GD by balancing update energy across curvature groups; when curvature heterogeneity is sufficiently strong, this also yields lower local quadratic loss after the same number of steps.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 67 of its 81 references that are in the map. First posted on arXiv 3 Jun 2026.

Builds on

67 of 81 references.

References · 67

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  3. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  4. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  5. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  6. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
  7. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 896
  8. 2019On the Convergence of Adam and Beyondcited by 834
  9. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
  10. 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
  11. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  12. 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 413
38 more
  1. 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 413
  2. 2025Muon is Scalable for LLM Trainingcited by 381
  3. 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
  4. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
  5. 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 282
  6. 2018Gradient Descent Happens in a Tiny Subspacecited by 208
  7. 2024SOAP: Improving and Stabilizing Shampoo using Adamcited by 179
  8. 2025Training Deep Learning Models with Norm-Constrained LMOscited by 177
  9. 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 173
  10. 2024Old Optimizer, New Norm: An Anthologycited by 173
  11. 2020A Simple Convergence Proof of Adam and Adagradcited by 169
  12. 2018Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasiscited by 143
  13. 2021Efficient Sharpness-aware Minimization for Improved Training of Neural Networkscited by 137
  14. 2024Adam-mini: Use Fewer Learning Rates To Gain Morecited by 134
  15. 2018A Sufficient Condition for Convergences of Adam and RMSPropcited by 124
  16. 2024Why Transformers Need Adam: A Hessian Perspectivecited by 123
  17. 2022Adam Can Converge Without Any Modification On Update Rulescited by 112
  18. 2023Convergence of Adam Under Relaxed Assumptionscited by 97
  19. 2022Sharpness-Aware Training for Freecited by 95
  20. 2018On the Convergence of Adaptive Gradient Methods for Nonconvex Optimizationcited by 91
  21. 2023A Modern Look at the Relationship between Sharpness and Generalizationcited by 91
  22. 2025Fantastic Pretraining Optimizers and Where to Find Themcited by 87
  23. 2025Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimizationcited by 81
  24. 2024Heavy-Tailed Class Imbalance and Why Adam Outperforms Gradient Descent on Language Modelscited by 78
  25. 2025A Note on the Convergence of Muoncited by 78
  26. 2025Muon Optimizes Under Spectral Norm Constraintscited by 77
  27. 2025Practical Efficiency of Muon for Pretrainingcited by 74
  28. 2025NorMuon: Making Muon more efficient and scalablecited by 74
  29. 2024Modular Duality in Deep Learningcited by 71
  30. 2025Dion: Distributed Orthonormalized Updatescited by 64
  31. 2025AdaMuon: Adaptive Muon Optimizercited by 59
  32. 2025ASGO: Adaptive Structured Gradient Optimizationcited by 55
  33. 2021A Novel Convergence Analysis for Algorithms of the Adam Familycited by 50
  34. 2023Toward Understanding Why Adam Converges Faster Than SGD for Transformerscited by 50
  35. 2025PolarGrad: A Class of Matrix-Gradient Optimizers from a Unifying Preconditioning Perspectivecited by 48
  36. 2019Emergent properties of the local geometry of neural loss landscapescited by 46
  37. 2023Sharpness Minimization Algorithms Do Not Only Minimize Sharpness To Achieve Better Generalizationcited by 39
  38. 2025Muon Outperforms Adam in Tail-End Associative Memory Learningcited by 38

50 most cited of 67 All 67 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.