paper-with-me

홈 › Papers

How Much Orthogonalization Does Muon Need?

2026-05-29 · Hua Huang arxiv

Muon optimizers improve neural-network training by replacing ill-conditioned momentum updates with approximately semi-orthogonal updates. This motivates a practical question: how much orthogonalization does Muon actually require? We study this question using a relaxed cubic Newton--Schulz schedule derived directly for Muon's low precision singular value band. The resulting five-step cubic construction uses ten dominant matrix multiplications, compared with fifteen for five quintic Newton--Schulz iterations. The cubic schedule is not intended as a more accurate polar solver; instead, it is a principled low-cost variant that lets us probe the relation between polar accuracy, spectral shaping, and training quality. Across synthetic diagnostics, NanoGPT ablations, and training experiments on hybrid MoE/Mamba models, we find that training quality is not governed monotonically by polar-decomposition accuracy: truncated Polar Express, Muon-Jordan, cubic Newton--Schulz, and an explicit FP32 SVD polar factor can reach nearly indistinguishable final loss on GPT-2 Small, and cubic5 matches the Muon-Jordan quintic update within about $10^{-3}$ validation loss on hybrid MoE/Mamba models with one billion to four billion parameters. These results support cubic5 as a practical low-cost Muon orthogonalization variant, with empirical evidence of training-quality parity in the settings tested.

📄 PDF Abstract BibTeX arXiv:2606.00371

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Iterative Orthogonalization Scaling Laws

2025-05-06 · Devan Selvaraj

The muon optimizer has picked up much attention as of late as a possible replacement to the seemingly omnipresent Adam optimizer. Recently, care has been taken to document the scaling laws of hyper-parameters under muon …

Convergence of Muon with Newton-Schulz

2026-01-27 · Gyu Yeol Kim, Min-hwan Oh arxiv

We analyze Muon as originally proposed and used in practice -- using the momentum orthogonalization with a few Newton-Schulz steps. The prior theoretical results replace this key step in Muon with an exact SVD-based pola…

MuonBP: Faster Muon via Block-Periodic Orthogonalization

2025-10-19 · Ahmed Khaled, Kaan Ozkara, Tao Yu, Mingyi Hong 외 arxiv

Gradient orthogonalization is a simple strategy that shows great utility in speeding up gradient descent. The Muon optimizer (Jordan, Jin, et al., 2024) combines gradient orthogonalization with first-order momentum and a…

Muon$^2$: Boosting Muon via Adaptive Second-Moment Preconditioning

2026-04-11 · Ziyue Liu, Ruijie Zhang, Zhengyang Wang, Yequan Zhao 외 arxiv

Muon has emerged as a promising optimizer for large-scale foundation model pre-training by exploiting the matrix structure of neural network updates through iterative orthogonalization. However, the orthogonalization qua…

Muon is Scalable for LLM Training

2025-02-24 · Jingyuan Liu, Jianlin Su, Xingcheng Yao, Zhejun Jiang 외

Recently, the Muon optimizer based on matrix orthogonalization has demonstrated strong results in training small-scale language models, but the scalability to larger models has not been proven. We identify two crucial te…

Computational Efficiency