DGA-Muon: Decoupled Geometry-Aligned Adaptive Scaling for Muon
Not on the map. Why?
Abstract (arXiv)
While NorMuon has achieved strong empirical performance in pretraining, its underlying adaptive mechanism remains largely heuristic and poorly understood. In this work, we provide the first systematic theoretical analysis of NorMuon's adaptivity, revealing that it primarily arises from orthogonalization-induced geometry rather than genuine optimization dynamics, serving to offset the resulting geometric non-uniformity. Under exact orthogonalization, the adaptive scaling factors degenerate into a single global scalar for square and wide matrices, while for tall matrices their variation results from unevenly distributed row energy after orthogonalization. Under approximate orthogonalization, the orthogonality residuals introduce additional variation into the scaling, giving rise to a counterintuitive Orthogonalization--Adaptivity Paradox: more accurate orthogonalization weakens adaptivity. We further show that NorMuon's rigid row-wise scaling is geometrically misaligned with the one-sided orthogonal structure of tall matrices by distorting column orthogonality. Motivated by these limitations, we propose two core design principles that a desirable adaptive mechanism for Muon should satisfy. First, adaptive scaling should be decoupled from orthogonalization, with the scaling factors computed directly from raw gradients. Second, adaptive scaling should be aligned with the shape-dependent orthogonal structure of the polar factor, using row-wise scaling for wide matrices and column-wise scaling for tall matrices. We prove that this geometry-aligned scaling preserves the orthogonal structure of the update. By incorporating several other techniques, we obtain Decoupled Geometry-Aligned Muon (DGA-Muon). We establish convergence guarantees for DGA-Muon and empirically validate both our theoretical characterization of NorMuon's scaling degeneration and the superiority of DGA-Muon.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 39 references that are in the map. First posted on arXiv 5 Oct 2026.
Builds on
17 of 39 references.
References · 17
- 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
- 2026GLM-5: from Vibe Coding to Agentic Engineeringcited by 587
- 2025Kimi K2: Open Agentic Intelligencecited by 567
- 2025GLM-4.5: Agentic, Reasoning, and Coding (ARC) Foundation Modelscited by 467
- 2025Muon is Scalable for LLM Trainingcited by 428
- 2026Kimi K3: Open Frontier Intelligencecited by 138
- 2025A Note on the Convergence of Muoncited by 83
- 2025Practical Efficiency of Muon for Pretrainingcited by 80
- 2025Isotropic Curvature Model for Understanding Deep Learning Optimization: Is Gradient Orthogonalization Optimal?cited by 37
- 2026Mousse: Rectifying the Geometry of Muon with Curvature-Aware Preconditioningcited by 17
- 2026Muon2: Boosting Muon via Adaptive Second-Moment Preconditioningcited by 17
- 2025ROOT: Robust Orthogonalized Optimizer for Neural Network Trainingcited by 15
5 more
- 2026FISMO: Fisher-Structured Momentum-Orthogonalized Optimizercited by 11
- 2026Why Muon Outperforms Adam: A Curvature Perspectivecited by 6
- 2026Spectral Flattening Is All Muon Needs: How Orthogonalization Controls Learning Rate and Convergencecited by 5
- 2026Decoupling Variance and Scale-Invariant Updates in Adaptive Gradient Descent for Unified Vector and Matrix Optimizationcited by 4
- 2026Matrix AdaGrad: Row-wise and Column-wise Adaptive Subgradient Methodscited by 1
Built on by
Not cited yet.