2020
Revisiting the Landscape of Matrix Factorization
AISTATS 2020poster
Prior work has shown that low-rank matrix factorization has infinitely many critical points, each of which is either a global minimum or a (strict) saddle point. We revisit this problem and provide simple, intuitive proofs of a set of extended results for low-rank and general-rank problems. We coupl…