Solving Phase Retrieval via Graph Projection Splitting
Ji Li, Hongkai Zhao

TL;DR
This paper introduces graph projection splitting (GPS) and robust GPS (RGPS) methods for phase retrieval, demonstrating improved stability, efficiency, and robustness over existing algorithms, especially in noisy and non-Gaussian measurement scenarios.
Contribution
The paper develops GPS and RGPS algorithms for phase retrieval, providing theoretical analysis, convergence guarantees, and empirical evidence of their superior performance.
Findings
RGPS outperforms GPS with fewer iterations in noiseless cases.
GPS achieves the sharpest phase transition among compared methods.
RGPS demonstrates superior stability and noise robustness.
Abstract
Phase retrieval with prior information can be cast as a nonsmooth and nonconvex optimization problem. We solve the problem by graph projection splitting (GPS), where the two proximity subproblems and the graph projection step can be solved efficiently. With slight modification, we also propose a robust graph projection splitting (RGPS) method to stabilize the iteration for noisy measurements. Contrary to intuition, RGPS outperforms GPS with fewer iterations to locate a satisfying solution even for noiseless case. Based on the connection between GPS and Douglas-Rachford iteration, under mild conditions on the sampling vectors, we analyze the fixed point sets and provide the local convergence of GPS and RGPS applied to noiseless phase retrieval without prior information. For noisy case, we provide the error bound of the reconstruction. Compared to other existing methods, thanks for the…
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.
