Emergent Mind

Robust Outlier Bound Condition to Phase Retrieval with Adversarial Sparse Outliers

(2311.13219)
Published Nov 22, 2023 in cs.IT , math.FA , math.IT , and math.PR

Abstract

We consider the problem of recovering an unknown signal $\pmb{x}0\in \mathbb{R}{n}$ from phaseless measurements. In this paper, we study the convex phase retrieval problem via PhaseLift from linear Gaussian measurements perturbed by $\ell{1}$-bounded noise and sparse outliers that can change an adversarially chosen $s$-fraction of the measurement vector. We show that the Robust-PhaseLift model can successfully reconstruct the ground-truth up to global phase for any $s< s{*}\approx 0.1185$ with $\mathcal{O}(n)$ measurements, even in the case where the sparse outliers may depend on the measurement and the observation. The recovery guarantees are based on the robust outlier bound condition and the analysis of the product of two Gaussian variables. Moreover, we construct adaptive counterexamples to show that the Robust-PhaseLift model fails when $s> s{*}$ with high probability.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.