Lion Secretly Solves Constrained Optimization: As Lyapunov Predicts

TL;DR

This paper reveals that the Lion optimizer, discovered through program search, is theoretically grounded in constrained optimization, providing a new Lyapunov-based analysis that explains its empirical success and broadens its applicability.

Contribution

It introduces a Lyapunov function-based analysis demonstrating Lion as a principled optimizer for constrained problems, extending to a family of Lion-$\

Findings

Lion is a theoretically novel optimizer for constrained minimization.

The analysis introduces a new Lyapunov function applicable to Lion and its variants.

Results clarify Lion's dynamics and potential for further improvements.

Abstract

Lion (Evolved Sign Momentum), a new optimizer discovered through program search, has shown promising results in training large AI models. It performs comparably or favorably to AdamW but with greater memory efficiency. As we can expect from the results of a random search program, Lion incorporates elements from several existing algorithms, including signed momentum, decoupled weight decay, Polak, and Nesterov momentum, but does not fit into any existing category of theoretically grounded optimizers. Thus, even though Lion appears to perform well as a general-purpose optimizer for a wide range of tasks, its theoretical basis remains uncertain. This lack of theoretical clarity limits opportunities to further enhance and expand Lion's efficacy. This work aims to demystify Lion. Based on both continuous-time and discrete-time analysis, we demonstrate that Lion is a theoretically novel and principled approach for minimizing a general loss function $f(x)$ while enforcing a bound constraint $\|x\|_\infty \leq 1/\lambda$. Lion achieves this through the incorporation of decoupled weight decay, where $\lambda$ represents the weight decay coefficient. Our analysis is made possible by the development of a new Lyapunov function for the Lion updates. It applies to a broader family of Lion-$\kappa$ algorithms, where the $\text{sign}(\cdot)$ operator in Lion is replaced by the subgradient of a convex function $\kappa$, leading to the solution of a general composite optimization problem of $\min_x f(x) + \kappa^*(x)$. Our findings provide valuable insights into the dynamics of Lion and pave the way for further improvements and extensions of Lion-related algorithms.