Fundamental Limits of Weak Recovery with Applications to Phase Retrieval
Conference on Learning Theory(2018)
摘要
In phase retrieval, we want to recover an unknown signal x∈ℂ^d from n quadratic measurements of the form y_i = |⟨a_i,x⟩ |^2+w_i , where a_i∈ℂ^d are known sensing vectors and w_i is measurement noise. We ask the following weak recovery question: What is the minimum number of measurements n needed to produce an estimator x̂(y) that is positively correlated with the signal x ? We consider the case of Gaussian vectors a_i . We prove that—in the high-dimensional limit—a sharp phase transition takes place, and we locate the threshold in the regime of vanishingly small noise. For n≤ d-o(d) , no estimator can do significantly better than random and achieve a strictly positive correlation. For n≥ d+o(d) , a simple spectral estimator achieves a positive correlation. Surprisingly, numerical simulations with the same spectral estimator demonstrate promising performance with realistic sensing matrices. Spectral methods are used to initialize non-convex optimization algorithms in phase retrieval, and our approach can boost the performance in this setting as well. Our impossibility result is based on classical information-theoretic arguments. The spectral algorithm computes the leading eigenvector of a weighted empirical covariance matrix. We obtain a sharp characterization of the spectral properties of this random matrix using tools from free probability and generalizing a recent result by Lu and Li. Both the upper bound and lower bound generalize beyond phase retrieval to measurements y_i produced according to a generalized linear model. As a by-product of our analysis, we compare the threshold of the proposed spectral method with that of a message passing algorithm.
更多查看译文
关键词
Spectral initialization,Phase transition,Mutual information,Second-moment method,Phase retrieval
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络