The pursuit of faster optimization algorithms remains an active and important research direction in deep learning. Recently, the Muon optimizer JJB+24 has demonstrated promising empirical performance, but its theoretical foundation remains less understood. In this paper, we bridge this gap and provide a theoretical analysis of Muon by placing it within the Lion-K family of optimizers CLLL24. Specifically, we show that Muon corresponds to Lion-K when equipped with the nuclear norm, and we leverage the theoretical results of Lion-K to establish that Muon (with decoupled weight decay) implicitly solves an optimization problem that enforces a constraint on the spectral norm of weight matrices. This perspective not only demystifies the implicit regularization effects of Muon but also leads to natural generalizations through varying the choice of convex map K, allowing for the exploration of a broader class of implicitly regularized and constrained optimization algorithms.
Chen et al. (Wed,) studied this question.