paper-with-me

Papers

OptMuon: Closed-Loop Orthogonalized Momentum Methods for Stochastic Optimization with Zero-Noise Optimality

2026-06-07 · Ganzhao Yuan arxiv

Orthogonalized momentum updates, as used in Muon-style optimizers, have recently shown strong empirical stability in large-scale deep learning. However, most current orthogonalized methods are still paired with fixed, externally scheduled, or otherwise open-loop magnitude rules, so their scale is not directly calibrated from the realized optimization trajectory. Motivated by the closed-loop perspective behind Lipschitz-free and noise-adaptive methods, we propose OptMuon, a family of adaptive momentum orthogonalization methods for stochastic nonconvex optimization. OptMuon combines Muon-style polar-factor directions with a trajectory-dependent AdaGrad-Norm-type coefficient schedule, so that the update magnitude is determined by the observed gradient and momentum history rather than by a prescribed Lipschitz-dependent rule. The schedule does not use the smoothness constant, the variance level, or the bounded-gradient constant in parameter selection, and its running-maximum correction prevents isolated gradient spikes from causing excessive coefficient collapse. Under lower-boundedness, unbiased stochastic gradients with bounded variance, smoothness, and an almost-sure bounded stochastic-gradient condition, we prove two complementary expected-stationarity guarantees. OptMuon-A achieves the noise-adaptive rate \(\tilde{\mathcal O}(T^{-1/2}+σ^{1/2}T^{-1/4})\) under average smoothness, while OptMuon-I achieves \(\tilde{\mathcal O}(T^{-1/2}+σ^{1/3}T^{-1/3})\) under individual smoothness. In the zero-noise regime, both bounds automatically reduce to a nearly optimal deterministic first-order rate \(\tilde{\mathcal O}(T^{-1/2})\) without manual hyperparameter retuning. These results show that closed-loop scalar adaptation can be combined with Muon-style momentum orthogonalization while retaining noise adaptivity and zero-noise optimality up to logarithmic factors.

📄 PDF Abstract BibTeX arXiv:2606.08783

Code (0)

등록된 구현이 없습니다.

Tasks

Stochastic Optimization

Similar Papers 제목 키워드 기반

Adam Improves Muon: Adaptive Moment Estimation with Orthogonalized Momentum

2026-02-19 · Minxin Zhang, Yuxuan Liu, Hayden Schaeffer arxiv

Efficient stochastic optimization typically integrates an update direction that performs well in the deterministic regime with a mechanism adapting to stochastic perturbations. While Adam uses adaptive moment estimates t…

Stochastic Optimization

FISMO: Fisher-Structured Momentum-Orthogonalized Optimizer

2026-01-29 · Chenrui Xu, Wenjing Yan, Ying-Jun Angela Zhang arxiv

Training large-scale neural networks requires solving nonconvex optimization where the choice of optimizer fundamentally determines both convergence behavior and computational efficiency. While adaptive methods like Adam…

Computational EfficiencyImage Classification

Accelerated Continuous-Time Approximate Dynamic Programming via Data-Assisted Hybrid Control

2022-04-27 · Daniel E. Ochoa, Jorge I. Poveda

We introduce a new closed-loop architecture for the online solution of approximate optimal control problems in the context of continuous-time systems. Specifically, we introduce the first algorithm that incorporates dyna…

A Note on Stability for Orthogonalized Matrix Momentum with Client Sampling

2026-06-01 · Da Chang, Qiankun Shi, Lvgang Zhang, Yu Li 외 arxiv

We study finite-sample generalization for a client-sampled distributed optimization scheme with matrix-valued parameters and orthogonalized momentum updates. The central quantity is the gap between the population and emp…

Distributed Optimization

A Physical Response-and-Memory Model for Muon Optimization

2026-08-24 · Yinze Hu, Hongjun Xiang, Xingao Gong, Hongyu Yu arxiv

Training large language models is costly. How low a loss the same compute can ultimately reach depends on how each step's gradient is converted into a weight update; the rule that performs this conversion is the optimize…