Noisy phase retrieval from subgaussian measurements

This paper aims to address the phase retrieval problem from subgaussian measurements with arbitrary noise, with a focus on developing efficient algorithms with provable convergence guarantees for solving non-convex problems. To ensure uniqueness of solutions in the subgaussian setting, we explore two commonly used assumptions: either the subgaussian measurements satisfy a fourth-moment condition or the target signals exhibit non-peakiness. For each scenario, we introduce a novel spectral initialization method that yields reliable initial estimates. Building on this, we employ leave-one-out arguments to show that the classical Wirtinger flow algorithm achieves a linear rate of convergence for both real-valued and complex-valued cases, provided the sampling complexity m ≥ O(nlog³m), where n is the dimension of the underlying signals. In contrast to existing work, our algorithms are regularization-free, requiring no truncation, trimming, or additional penalty terms, and they permit the algorithm step sizes as large as O(1), compared to the O(1/n) in previous literature. Furthermore, our results accommodate arbitrary noise vectors that meet certain statistical conditions, covering a wide range of noise scenarios, with subexponential noise as a notable special case. The effectiveness of our algorithms is validated through various numerical experiments. We emphasize that our findings provide the first theoretical guarantees for recovering non-peaky signals using non-convex methods from Bernoulli measurements, which is of independent interest.