Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach

09/12/2016
by   Dohyung Park, et al.
0

We consider the non-square matrix sensing problem, under restricted isometry property (RIP) assumptions. We focus on the non-convex formulation, where any rank-r matrix X ∈R^m × n is represented as UV^, where U ∈R^m × r and V ∈R^n × r. In this paper, we complement recent findings on the non-convex geometry of the analogous PSD setting [5], and show that matrix factorization does not introduce any spurious local minima, under RIP.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2017

Depth Creates No Bad Local Minima

In deep learning, depth, as well as nonlinearity, create non-convex loss...
research
05/23/2016

Global Optimality of Local Search for Low Rank Matrix Recovery

We show that there are no spurious local minima in the non-convex factor...
research
02/15/2023

Over-parametrization via Lifting for Low-rank Matrix Sensing: Conversion of Spurious Solutions to Strict Saddle Points

This paper studies the role of over-parametrization in solving non-conve...
research
06/08/2018

The Case for Full-Matrix Adaptive Regularization

Adaptive regularization methods come in diagonal and full-matrix variant...
research
12/01/2021

Spurious Valleys, Spurious Minima and NP-hardness of Sparse Matrix Factorization With Fixed Support

The problem of approximating a dense matrix by a product of sparse facto...
research
02/01/2021

Riemannian Perspective on Matrix Factorization

We study the non-convex matrix factorization approach to matrix completi...
research
07/20/2021

Learn2Hop: Learned Optimization on Rough Landscapes

Optimization of non-convex loss surfaces containing many local minima re...

Please sign up or login with your details

Forgot password? Click here to reset