arXiv cs.AI· Athanasios Glentis, Dawei Li, Mingyi Hong·· 13 小时前AI 评分29
MuonGS:用松弛权重范数控制预训练 LLM
MuonGS: Pretraining LLMs with Relaxed Weight-Norm Control
AI 导读
研究者提出 MuonGS,通过 Gram-Schmidt 投影移除 Muon 每次更新的径向分量,在不固定权重范数的情况下让权重范数最多按 √t 增长,从而保证累积有效学习率 C_T=Ω(√T)。
正文 · 原文
Abstract:Weight decay and explicit weight-norm constraints improve optimizer performance in language model pretraining, yet a unified understanding of why such control helps and how much is needed remains incomplete. We analyze norm control in Muon over the entire training trajectory using the \emph{accumulated effective learning rate}, $C_T=\sum_{t<T}\eta_t/\|W_t\|_F$, where $\eta_t$ is the nominal learning rate and $\eta_t/\|W_t\|_F$ is the effective learning rate relative to the weight norm. For bounded update directions, accumulation over any training interval bounds relative weight displacement. We show that vanilla Muon can accumulate only logarithmically, potentially limiting exploration and helping explain its slower empirical progress, whereas MuonW and MuonH guarantee at least linear accumulation under the stated conditions. Going beyond bounded-norm control, we show that sufficiently slow norm growth guarantees faster accumulation than the logarithmic worst case, opening up less restrictive optimizer designs.
Based on this insight, we propose MuonGS, which uses Gram--Schmidt (GS) projection to remove the radial component of each Muon update without fixing the weight norm. With bounded update directions and a constant nominal learning rate, we prove that the weight norm grows at most proportionally to $\sqrt{t}$ after $t$ steps. Consequently, MuonGS guarantees $C_T=\Omega(\sqrt{T})$, with accumulation sustained even in later training. Further, for smooth scale-invariant objectives we establish its $O(T^{-1/2})$ stationarity guarantee. In pretraining experiments with 160M- and 400M-parameter dense models as well as a 135M active- and 1B total- parameter MoE model, MuonGS achieves lower validation perplexity than MuonH at long training horizons. In particular, for the dense model it achieves an estimated token-equivalent speedup up to about $15\%$ at matched validation loss to MuonH.
| Comments: | 21 pages, 9 figures |
| Subjects: | Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Optimization and Control (math.OC) |
| Cite as: | arXiv:2610.37647 [cs.LG] |
| (or arXiv:2610.37647v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2610.37647 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Dawei Li [view email]
[v1]
Tue, 27 Oct 2026 17:56:40 UTC (2,308 KB)
来源:arXiv cs.AI · arxiv.org