Phase Retrieval In High Dimensions: Statistical And Computational Phase Transitions
summary
Conjectures give an explicit replica symmetric potential whose maximizer yields the asymptotic MMSE; the formula is proven for Gaussian sensing matrices (real or complex) and for Gaussian priors with sensing = Gaussian × fixed matrix. Approximate message passing (GVAMP) is characterized by the same potential but often gets stuck in a hard phase (empirical gap between AMP and information-theoretic limits, e.g. AMP needs ~2.3 samples while unitary sensing shows an IT all‑or‑nothing threshold at α=2); strong recovery threshold equals β·R (β=1 real, 2 complex). A constructive optimal spectral method with preprocessor T(y)=1−1/y (noiseless case) is derived and empirically initializes cheap gradient descent to recover images for α≈3–4.
AI-written summary · about
chapters (7)
- 0:00Phase retrieval introduction
- 7:12Replica formula and info limits
- 12:12Algorithmic limits with AMP
- 17:33Numerical analysis of thresholds
- 21:05Optimal spectral methods
- 29:57Summary and open problems
- 30:40Q&A on spectral methods
related talks
39mPhase Retrieval in High Dimensions: Statistical and Computational Phase Transitions
01h 04mStatistical Physics and Computation in High Dimension
58mUniversality of Approximate Message Passing on Semi-random Matrices
49mApproximate Message Passing Algorithms For Orthogonally Invariant Models
46mSolvable Model of Unsupervised Feature Learning
45mPhase Transitions in Low-Rank Matrix Estimation
01h 14mRecent Progress in High-Dimensional Learning
01h 11mStatistical Physics and Computation in High Dimension
