
DS
Devan Selvaraj
· 1 min read
ResearcharXiv cs.LG
Iterative Orthogonalization Scaling Laws
arXiv:2505.04005v3 Announce Type: replace
Abstract: 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 such as weight decay and learning rate. However, at much larger scales the iterative orthogonalization procedure present in muon may suffer a possible issue as the singular values of random matrices shrink with scale. This paper shows this scaling behavior theoretically and empirically on random matrices but does not suggest what to do about it.
Original source
This story was published by arXiv cs.LG and written by Devan Selvaraj. SyncAI.news shows a preview; the complete article is on the publisher's site.
Read the full story on arxiv.org


