Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective

09/29/2022
by   Yuetian Luo, et al.
0

We study a general matrix optimization problem with a fixed-rank positive semidefinite (PSD) constraint. We perform the Burer-Monteiro factorization and consider a particular Riemannian quotient geometry in a search space that has a total space equipped with the Euclidean metric. When the original objective f satisfies standard restricted strong convexity and smoothness properties, we characterize the global landscape of the factorized objective under the Riemannian quotient geometry. We show the entire search space can be divided into three regions: (R1) the region near the target parameter of interest, where the factorized objective is geodesically strongly convex and smooth; (R2) the region containing neighborhoods of all strict saddle points; (R3) the remaining regions, where the factorized objective has a large gradient. To our best knowledge, this is the first global landscape analysis of the Burer-Monteiro factorized objective under the Riemannian quotient geometry. Our results provide a fully geometric explanation for the superior performance of vanilla gradient descent under the Burer-Monteiro factorization. When f satisfies a weaker restricted strict convexity property, we show there exists a neighborhood near local minimizers such that the factorized objective is geodesically convex. To prove our results we provide a comprehensive landscape analysis of a matrix factorization problem with a least squares objective, which serves as a critical bridge. Our conclusions are also based on a result of independent interest stating that the geodesic ball centered at Y with a radius 1/3 of the least singular value of Y is a geodesically convex set under the Riemannian quotient geometry, which as a corollary, also implies a quantitative bound of the convexity radius in the Bures-Wasserstein space. The convexity radius obtained is sharp up to constants.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/29/2016

Symmetry, Saddle Points, and Global Geometry of Nonconvex Matrix Factorization

We propose a general theory for studying the geometry of nonconvex objec...
research
02/01/2021

Riemannian Perspective on Matrix Factorization

We study the non-convex matrix factorization approach to matrix completi...
research
02/11/2019

The Riemannian barycentre as a proxy for global optimisation

Let M be a simply-connected compact Riemannian symmetric space, and U a ...
research
10/23/2021

On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-rank Matrix Optimization

In this paper, we propose a general procedure for establishing the lands...
research
07/05/2022

Improved Global Guarantees for the Nonconvex Burer–Monteiro Factorization via Rank Overparameterization

We consider minimizing a twice-differentiable, L-smooth, and μ-strongly ...
research
08/03/2021

Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization

In this paper, we consider the geometric landscape connection of the wid...
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