mlsanityData to 7 Oct 2026

Asymptotic Escape of Spurious Critical Points on the Low-rank Matrix Manifold

arXiv 2107.09207 ↗First posted 20 Jul 2021math.OC cs.IT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We show that on the manifold of fixed-rank and symmetric positive semi-definite matrices, the Riemannian gradient descent algorithm almost surely escapes some spurious critical points on the boundary of the manifold. Our result is the first to partially overcome the incompleteness of the low-rank matrix manifold without changing the vanilla Riemannian gradient descent algorithm. The spurious critical points are some rank-deficient matrices that capture only part of the eigen components of the ground truth. Unlike classical strict saddle points, they exhibit very singular behavior. We show that using the dynamical low-rank approximation and a rescaled gradient flow, some of the spurious critical points can be converted to classical strict saddle points in the parameterized domain, which leads to the desired result. Numerical experiments are provided to support our theoretical findings.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 32 references that are in the map. First posted on arXiv 20 Jul 2021.

Builds on

12 of 32 references.

References · 12

  1. 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
  2. 2018Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overviewcited by 159
  3. 2019First-order methods almost always avoid saddle points: the case of vanishing step-sizescited by 35
  4. 2016Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regionscited by 33
  5. 2019Escaping from saddle points on Riemannian manifoldscited by 33
  6. 2016Gradient Descent Converges to Minimizerscited by 25
  7. 2019Efficiently escaping saddle points on manifoldscited by 24
  8. 2014Convergence results for projected line-search methods on varieties of low-rank matrices via Lojasiewicz inequalitycited by 10
  9. 2020Fast Global Convergence for Low-rank Matrix Recovery via Riemannian Gradient Descent with Random Initializationcited by 8
  10. 2021Finding stationary points on bounded-rank matrices: A geometric hurdle and a smooth remedycited by 6
  11. 2019Analysis of Asymptotic Escape of Strict Saddle Sets in Manifold Optimizationcited by 3
  12. 2019Low-Rank Matrix Optimization Over Affine Setcited by 1

Built on by

Not cited yet.