Construction of optimal spectral methods in phase retrieval

12/08/2020
by   Antoine Maillard, et al.
0

We consider the phase retrieval problem, in which the observer wishes to recover a n-dimensional real or complex signal 𝐗^⋆ from the (possibly noisy) observation of |Φ𝐗^⋆|, in which Φ is a matrix of size m × n. We consider a high-dimensional setting where n,m →∞ with m/n = 𝒪(1), and a large class of (possibly correlated) random matrices Φ and observation channels. Spectral methods are a powerful tool to obtain approximate observations of the signal 𝐗^⋆ which can be then used as initialization for a subsequent algorithm, at a low computational cost. In this paper, we extend and unify previous results and approaches on spectral methods for the phase retrieval problem. More precisely, we combine the linearization of message-passing algorithms and the analysis of the Bethe Hessian, a classical tool of statistical physics. Using this toolbox, we show how to derive optimal spectral methods for arbitrary channel noise and right-unitarily invariant matrix Φ, in an automated manner (i.e. with no optimization over any hyperparameter or preprocessing function).

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset