Sample-Efficient Sparse Phase Retrieval via Stochastic Alternating Minimization

DOI10.1109/TSP.2022.3214091MaRDI QIDQ6385730zbMATH OpenFDO

Authors Jian-Feng Cai, Yu Ling Jiao, Xiliang Lu, Juntao You

Publication date 15 December 2021

Full work available at URL https://doi.org/10.1109/TSP.2022.3214091

Abstract: In this work we propose a nonconvex two-stage underline{s}tochastic underline{a}lternating underline{m}inimizing (SAM) method for sparse phase retrieval. The proposed algorithm is guaranteed to have an exact recovery from $O(slogn)$ samples if provided the initial guess is in a local neighbour of the ground truth. Thus, the proposed algorithm is two-stage, first we estimate a desired initial guess (e.g. via a spectral method), and then we introduce a randomized alternating minimization strategy for local refinement. Also, the hard-thresholding pursuit algorithm is employed to solve the sparse constraint least square subproblems. We give the theoretical justifications that SAM find the underlying signal exactly in a finite number of iterations (no more than $O(logm)$ steps) with high probability. Further, numerical experiments illustrates that SAM requires less measurements than state-of-the-art algorithms for sparse phase retrieval problem.

This page was built for publication: Sample-Efficient Sparse Phase Retrieval via Stochastic Alternating Minimization

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