.png){kind=icon}
Return
Robust sparse phase retrieval: statistical guarantee, optimality theory and convergent algorithm
.png){kind=icon}
PRE
AI
DOI：10.1088/1361-6420/ae5e02.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Phase retrieval (PR) is a popular research topic in signal processing and machine learning. However, its performance degrades significantly when the measurements are corrupted by noise or outliers. To address this limitation, we propose a novel robust sparse PR method that covers both real- and complex-valued cases. The core is to leverage the Huber function to measure the loss and adopt the & ell;(1/2)-norm regularization to realize feature selection, thereby improving the robustness of PR. In theory, we establish statistical guarantees for such robustness and derive necessary optimality conditions for global minimizers. Particularly, for the complex-valued case, we provide a fixed point inclusion property inspired by Wirtinger derivatives. Furthermore, we develop an efficient optimization algorithm by integrating the gradient descent method into a majorization-minimization framework. It is rigorously proved that the whole generated sequence is convergent and also has a linear convergence rate under mild conditions, which has not been investigated before. Numerical examples under different types of noise validate the robustness and effectiveness of our proposed method.
Keywords:
Phase retrieval
robust
Huber loss
& ell
(1/2)-norm
majorization-minimization
Journal
I
IF:
2.1
Papers:
97
Citations:
8.4K
Organization
Cited Papers
ShareSaveEstimation of high dimensional mean regression in the absence of symmetry and light tail assumptions
OAAI
OAAIShareSaveAsymptotic properties of bridge estimators in sparse high-dimensional regression models.png)
ANNALS OF STATISTICS
OAAI
ANNALS OF STATISTICSIF3.7
OAAIShareSaveShareSaveShareSaveShareSave
View more