State-Dependent Lyapunov Method for Rank-1 Matrix Factorization
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914517541191680 |
|---|---|
| author | Moon, Jaehong |
| author_facet | Moon, Jaehong |
| contents | We study gradient descent for rank-1 matrix factorization through a certificate-based viewpoint. The central object is a parameterized quadratic certificate $I(δ;\,\cdot)$ whose level sets shrink along the dynamics, thereby inducing a monotone state parameter $δ_t$. 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 evidence beyond the proved cases. For the 2-dimensional rank-1 approximation problem $X=\mathrm{diag}(1,σ)$ with $σ\in(0,1)$, the experiments are consistent with the existence of a $C^1$ admissible certificate branch. For the quartic-augmented scalar loss $\frac12(ab-1)^2+μ(ab-1)^4$, the same scalar certificate remains predictive for several values of $μ$ after choosing an empirical threshold. These experiments suggest that the state-dependent Lyapunov method may extend beyond the settings proved in this paper. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_26993 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | State-Dependent Lyapunov Method for Rank-1 Matrix Factorization Moon, Jaehong Numerical Analysis Machine Learning Optimization and Control We study gradient descent for rank-1 matrix factorization through a certificate-based viewpoint. The central object is a parameterized quadratic certificate $I(δ;\,\cdot)$ whose level sets shrink along the dynamics, thereby inducing a monotone state parameter $δ_t$. 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 evidence beyond the proved cases. For the 2-dimensional rank-1 approximation problem $X=\mathrm{diag}(1,σ)$ with $σ\in(0,1)$, the experiments are consistent with the existence of a $C^1$ admissible certificate branch. For the quartic-augmented scalar loss $\frac12(ab-1)^2+μ(ab-1)^4$, the same scalar certificate remains predictive for several values of $μ$ after choosing an empirical threshold. These experiments suggest that the state-dependent Lyapunov method may extend beyond the settings proved in this paper. |
| title | State-Dependent Lyapunov Method for Rank-1 Matrix Factorization |
| topic | Numerical Analysis Machine Learning Optimization and Control |
| url | https://arxiv.org/abs/2604.26993 |