Phase Transitions in Low-Rank Matrix Estimation
summary
Focuses on low-rank matrix estimation problems, describing phase transitions and algorithmic-to-information gaps that occur when recovering matrices from noisy or incomplete observations. Covers Bayesian approaches, connections with statistical physics (spin-glass-type analyses), and how these tools predict thresholds and performance of inference algorithms for specific low-rank matrix models.
AI-written summary · about
chapters (18)
- 0:00Intro
- 1:37LOW-RANK MATRIX ESTIMATION
- 2:33SOME EXAMPLES...
- 6:20PROBABILISTIC SETTING
- 8:28OUTLINE
- 9:04AMP FOR GAUSSIAN ADDITIVE CHANNEL AWGN
- 10:56STATE EVOLUTION Single letter characterization of the AMP
- 12:00REPLICA MUTUAL INFORMATION
- 18:15FORMULAS FOR UVT AMP
- 18:53CHANNEL UNIVERSALITY
- 22:13MINIMUM MEAN-SQUARED ERROR
- 24:06TWO PHASE TRANSITIONS FOR R 4
- 27:56NON-SYMMETRIC COMMUNITY DETECTION
- 29:56CLUSTERING MIXTURES OF GAUSSIANS IN HIGH DIMENSIONS
- 31:37WHAT ABOUT RANK 1 SPARSE PCA?
- 33:49EASY, HARD AND IMPOSSIBLE INFERENCE
- 35:35SKETCH OF THE PROOF
- 41:36CONCLUSIONS
related talks
38mAll-or-Nothing Statistical and Computational Phase Transitions in Sparse Spiked Matrix Estimation
39mPhase Retrieval in High Dimensions: Statistical and Computational Phase Transitions
35mPhase Retrieval In High Dimensions: Statistical And Computational Phase Transitions
35mThresholds of Descending Algorithms in Inference Problems
23mLow-Rank Matrix Recovery Through Rank-One Projections
01h 04mStatistical Physics and Computation in High Dimension
36mTo Be (Hard) or Not Be:...
37mLow-rank Matrix Completion: Adaptive Sampling Can Help When, How?
