All-or-Nothing Statistical and Computational Phase Transitions in Sparse Spiked Matrix Estimation
summary
Shows that rank‑1 sparse spiked matrix estimation exhibits sharp all‑or‑nothing phase transitions as sparsity rho→0 and SNR λ→∞: the information‑theoretic threshold occurs at λ scaling like (−log rho)/rho (proved when rho≫N^(−β)), while the computational threshold for recovery by approximate message passing sits at much larger λ (roughly ∝1/rho^2 when rho≫(log N)^(−α)), producing a diverging gap; proves the stat limit via adaptive interpolation and IMMSE and the algorithmic limit by finite‑sample state‑evolution concentration, with simulations matching the predicted MMSE jumps from 0 to 1.
AI-written summary · about
chapters (14)
- 0:00Intro
- 0:29Motivation
- 3:17Sparse spiked Wigner matrix model
- 5:03Related work
- 11:01Statistical Limits and Phase Transitions
- 12:37Computational Limits and Phase Transitions
- 13:48Observed phase transitions
- 17:23Regimes with phase transitions
- 18:19All-or-nothing for the mutual information
- 20:06All-or-nothing for the MMSE
- 21:08All-or-nothing for the MSE of AMP
- 22:07Computational-to-statistical gap
- 25:52Methods for information theoretic results
- 27:18Methods for computational results
related talks
45mPhase Transitions in Low-Rank Matrix Estimation
31mStatistical Estimation on Graphs
35mThresholds of Descending Algorithms in Inference Problems
39mPhase Retrieval in High Dimensions: Statistical and Computational Phase Transitions
01h 11mStatistical Physics and Computation in High Dimension
23mLow-Rank Matrix Recovery Through Rank-One Projections
01h 04mStatistical Physics and Computation in High Dimension
46mSolvable Model of Unsupervised Feature Learning
