Phase Retrieval of Low-Rank Matrices by Anchored Regression
Kiryung Lee, Sohail Bahmani, Yonina Eldar, and Justin Romberg

TL;DR
This paper introduces a convex optimization approach using anchored regression to recover low-rank matrices from phaseless measurements, with theoretical guarantees for specific structured scenarios.
Contribution
It proposes a novel convex relaxation method for low-rank phase retrieval, analyzing its effectiveness in structured cases and providing ways to construct necessary anchor matrices.
Findings
Accurate recovery with near-optimal measurements in rank-1 case.
Effective convex program for general rank matrices.
Method to construct anchor matrices from measurements.
Abstract
We study the low-rank phase retrieval problem, where we try to recover a low-rank matrix from a series of phaseless linear measurements. This is a fourth-order inverse problem, as we are trying to recover factors of matrix that have been put through a quadratic nonlinearity after being multiplied together. We propose a solution to this problem using the recently introduced technique of anchored regression. This approach uses two different types of convex relaxations: we replace the quadratic equality constraints for the phaseless measurements by a search over a polytope, and enforce the rank constraint through nuclear norm regularization. The result is a convex program that works in the space of matrices. We analyze two specific scenarios. In the first, the target matrix is rank-, and the observations are structured to correspond to a phaseless…
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.
