Phase retrieval and matrix sensing via benign and overparametrized nonconvex optimization
Andrew D. McRae

TL;DR
This paper analyzes nonconvex optimization methods for phase retrieval and matrix sensing, showing overparametrization can lead to optimal recovery guarantees with fewer samples.
Contribution
It introduces a new framework leveraging problem structure to understand critical points and demonstrates benefits of mild overparametrization for recovery guarantees.
Findings
Overparametrization improves recovery in phase retrieval and matrix sensing.
The framework recovers state-of-the-art guarantees without overparametrization.
Optimal sample complexity achieved with logarithmic overparametrization.
Abstract
We study a nonconvex optimization algorithmic approach to phase retrieval and the more general problem of semidefinite low-rank matrix sensing. Specifically, we analyze the nonconvex landscape of a quartic Burer-Monteiro factored least-squares optimization problem. We develop a new analysis framework, taking advantage of the semidefinite problem structure, to understand the properties of second-order critical points -- specifically, whether they (approximately) recover the ground truth matrix. We show that it can be helpful to (mildly) overparametrize the problem, that is, to optimize over matrices of higher rank than the ground truth. We then apply this framework to several well-studied problem instances: in addition to recovering existing state-of-the-art phase retrieval landscape guarantees (without overparametrization), we show that overparametrizing by a factor at most logarithmic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
