The Global Geometry of Centralized and Distributed Low-rank Matrix Recovery without Regularization

DOI10.1109/LSP.2020.3008876arXiv2003.10981MaRDI QIDQ6337346FDOQ6337346

Authors: Shuang Li, Qiuwei Li, Zhihui Zhu, Gongguo Tang, Michael B. Wakin 

Publication date: 24 March 2020

Abstract: Low-rank matrix recovery is a fundamental problem in signal processing and machine learning. A recent very popular approach to recovering a low-rank matrix X is to factorize it as a product of two smaller matrices, i.e., X = UV^T, and then optimize over U, V instead of X. Despite the resulting non-convexity, recent results have shown that many factorized objective functions actually have benign global geometry---with no spurious local minima and satisfying the so-called strict saddle property---ensuring convergence to a global minimum for many local-search algorithms. Such results hold whenever the original objective function is restricted strongly convex and smooth. However, most of these results actually consider a modified cost function that includes a balancing regularizer. While useful for deriving theory, this balancing regularizer does not appear to be necessary in practice. In this work, we close this theory-practice gap by proving that the unaltered factorized non-convex problem, without the balancing regularizer, also has similar benign global geometry. Moreover, we also extend our theoretical results to the field of distributed optimization.

This page was built for publication: The Global Geometry of Centralized and Distributed Low-rank Matrix Recovery without Regularization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6337346)