A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval
<|reference_start|>A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval: In this work, we study the robust phase retrieval problem where the task is to recover an unknown signal $\theta^* \in \mathbb{R}^d$ in the presence of potentially arbitrarily corrupted magnitude-only linear measurements. We propose an alternating minimization approach that incorporates an oracle solver for a non-convex optimization problem as a subroutine. Our algorithm guarantees convergence to $\theta^*$ and provides an explicit polynomial dependence of the convergence rate on the fraction of corrupted measurements. We then provide an efficient construction of the aforementioned oracle under a sparse arbitrary outliers model and offer valuable insights into the geometric properties of the loss landscape in phase retrieval with corrupted measurements. Our proposed oracle avoids the need for computationally intensive spectral initialization, using a simple gradient descent algorithm with a constant step size and random initialization instead. Additionally, our overall algorithm achieves nearly linear sample complexity, $\mathcal{O}(d \, \mathrm{polylog}(d))$.<|reference_end|>
@article{barik2024a,
    title={A Sample Efficient Alternating Minimization-based Algorithm For Robust
  Phase Retrieval},
    author={Adarsh Barik, Anand Krishna, Vincent Y. F. Tan},
    journal={arXiv preprint arXiv:2409.04733},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.04733},
    primaryClass={cs.LG}
}