Papers › Provable Low Rank Phase Retrieval
Provable Low Rank Phase Retrieval
Seyedehsara Nayer, Praneeth Narayanamurthy, Namrata Vaswani
We study the Low Rank Phase Retrieval (LRPR) problem defined as follows: recover an n ×q matrix X^* of rank r from a different and independent set of m phaseless (magnitude-only) linear projections of each of its columns. To be precise, we need to recover X^* from yₖ := |Aₖ′ x^*ₖ|, k=1,2,…, q when the measurement matrices Aₖ are mutually independent. Here yₖ is an m length vector, Aₖ is an n ×m matrix, and ′ denotes matrix transpose. The question is when can we solve LRPR with m ≪n? A reliable solution can enable fast and low-cost phaseless dynamic imaging, e.g., Fourier ptychographic imaging of live biological specimens. In this work, we develop the first provably correct approach for solving this LRPR problem. Our proposed algorithm, Alternating Minimization for Low-Rank Phase Retrieval (AltMinLowRaP), is an AltMin based solution and hence is also provably fast (converges geometrically). Our guarantee shows that AltMinLowRaP solves LRPR to ϵ accuracy, with high probability, as long as m q ≥C n r⁴ log(1/ϵ), the matrices Aₖ contain i.i.d. standard Gaussian entries, and the right singular vectors of X^* satisfy the incoherence assumption from matrix completion literature. Here C is a numerical constant that only depends on the condition number of X^* and on its incoherence parameter. Its time complexity is only C mq nr log²(1/ϵ). Since even the linear (with phase) version of the above problem is not fully solved, the above result is also the first complete solution and guarantee for the linear case. Finally, we also develop a simple extension of our results for the dynamic LRPR setting.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections