The Estimation Performance of Nonlinear Least Squares for Phase Retrieval

From MaRDI portal



Abstract: Suppose that mathbfy=lvertAmathbfx0vert+eta where mathbfx0inmathbbRd is the target signal and etainmathbbRm is a noise vector. The aim of phase retrieval is to estimate mathbfx0 from mathbfy. A popular model for estimating mathbfx0 is the nonlinear least square widehatmathbfx:=margminmathbfx|lvertAmathbfxvert−mathbfy|2. One already develops many efficient algorithms for solving the model, such as the seminal error reduction algorithm. In this paper, we present the estimation performance of the model with proving that |widehatmathbfx−mathbfx0|lesssim|eta|2/sqrtm under the assumption of A being a Gaussian random matrix. We also prove the reconstruction error |eta|2/sqrtm is sharp. For the case where mathbfx0 is sparse, we study the estimation performance of both the nonlinear Lasso of phase retrieval and its unconstrained version. Our results are non-asymptotic, and we do not assume any distribution on the noise eta. To the best of our knowledge, our results represent the first theoretical guarantee for the nonlinear least square and for the nonlinear Lasso of phase retrieval.












This page was built for publication: The Estimation Performance of Nonlinear Least Squares for Phase Retrieval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138944)