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

07/20/2021
by   Thomas Y. Hou, et al.
11

We show that the Riemannian gradient descent algorithm on the low-rank matrix manifold almost surely escapes some spurious critical points on the boundary of the manifold. Given that the low-rank matrix manifold is an incomplete set, this result is the first to overcome this difficulty and partially justify the global use of the Riemannian gradient descent on the manifold. The spurious critical points are some rank-deficient matrices that capture only part of the SVD components of the ground truth. They exhibit very singular behavior and evade the classical analysis of strict saddle points. 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, which leads to the desired result. Numerical experiments are provided to support our theoretical findings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/31/2020

Fast Global Convergence for Low-rank Matrix Recovery via Riemannian Gradient Descent with Random Initialization

In this paper, we propose a new global analysis framework for a class of...
research
06/01/2023

Gauss-Southwell type descent methods for low-rank matrix optimization

We consider gradient-related methods for low-rank matrix optimization wi...
research
11/28/2019

Analysis of Asymptotic Escape of Strict Saddle Sets in Manifold Optimization

In this paper, we provide some analysis on the asymptotic escape of stri...
research
08/27/2020

Implicit Regularization in Matrix Sensing: A Geometric View Leads to Stronger Results

We may think of low-rank matrix sensing as a learning problem with infin...
research
04/26/2017

Riemannian Optimization for Skip-Gram Negative Sampling

Skip-Gram Negative Sampling (SGNS) word embedding model, well known by i...
research
03/06/2023

Critical Points and Convergence Analysis of Generative Deep Linear Networks Trained with Bures-Wasserstein Loss

We consider a deep matrix factorization model of covariance matrices tra...
research
02/27/2020

The Landscape of Matrix Factorization Revisited

We revisit the landscape of the simple matrix factorization problem. For...

Please sign up or login with your details

Forgot password? Click here to reset