On the Global Minimizers of Real Robust Phase Retrieval with Sparse Noise

05/24/2019
by   Aleksandr Aravkin, et al.
0

We study a class of real robust phase retrieval problems under a Gaussian assumption on the coding matrix when the received signal is sparsely corrupted by noise. The goal is to establish conditions on the sparsity under which the input vector can be exactly recovered. The recovery problem is formulated as the minimization of the ℓ_1 norm of the residual. The main contribution is a robust phase retrieval counterpart to the seminal paper by Candes and Tao on compressed sensing (ℓ_1 regression) [Decoding by linear programming. IEEE Transactions on Information Theory, 51(12):4203-4215, 2005]. Our analysis depends on a key new property on the coding matrix which we call the Absolute Range Property (ARP). This property is an analogue to the Null Space Property (NSP) in compressed sensing. When the residuals are computed using squared magnitudes, we show that ARP follows from a standard Restricted Isometry Property (RIP). However, when the residuals are computed using absolute magnitudes, a new and very different kind of RIP or growth property is required. We conclude by showing that the robust phase retrieval objectives are sharp with respect to their minimizers with high probability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/10/2021

Stable Recovery of Weighted Sparse Signals from Phaseless Measurements via Weighted l1 Minimization

The goal of phaseless compressed sensing is to recover an unknown sparse...
research
06/19/2016

Tight Performance Bounds for Compressed Sensing With Group Sparsity

Compressed sensing refers to the recovery of a high-dimensional but spar...
research
03/29/2020

Efficient Noise-Blind ℓ_1-Regression of Nonnegative Compressible Signals

In compressed sensing the goal is to recover a signal from as few as pos...
research
12/04/2019

Exact asymptotics for phase retrieval and compressed sensing with random generative priors

We consider the problem of compressed sensing and of (real-valued) phase...
research
08/09/2018

Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions

In this paper, we study the problem of compressed sensing using binary m...
research
04/09/2020

Sparse recovery of noisy data and Grothendieck inequality

We present a detailed analysis of the unconstrained ℓ_1-method LASSO for...
research
04/09/2020

Sparse recovery of noisy data using the Lasso method

We present a detailed analysis of the unconstrained ℓ_1-method Lasso met...

Please sign up or login with your details

Forgot password? Click here to reset