State-Dependent Lyapunov Method for Rank-1 Matrix Factorization
Jaehong Moon

TL;DR
This paper introduces a state-dependent Lyapunov framework for analyzing gradient descent in rank-1 matrix factorization, providing certificates that guarantee convergence and elucidate dynamics.
Contribution
It develops a novel certificate-based Lyapunov method that explains the convergence behavior of gradient descent in rank-1 matrix factorization.
Findings
Certificates induce monotone dynamics leading to global convergence.
Numerical experiments support the existence of smooth certificate branches.
The method extends to scalar loss functions with quartic augmentation.
Abstract
We study gradient descent for rank-1 matrix factorization through a certificate-based viewpoint. The central object is a parameterized quadratic certificate whose level sets shrink along the dynamics, thereby inducing a monotone state parameter . In the certified regime, this mechanism yields convergence to a global minimizer; in the post-critical regime, it forces trajectories toward a terminal balanced manifold. To explain the origin of these certificates, we formulate a state-dependent Lyapunov framework based on structural axioms. Within this framework, the scalar certificate is uniquely determined, and the same local Lagrange analysis constrains the signal and noise blocks of rank-1 extensions. Thus, the certificates arise from the monotonicity structure of the dynamics, rather than from ad hoc algebraic constructions. We also provide numerical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
