Are Generative Models The New Sparsity?
summary
Generative priors sampled from random-weight neural nets reduce the algorithmic–statistical gap seen with sparsity in toy high-dimensional inference: rigorous MMSE formulas via mutual information show that AMP matches Bayes optimal in the spiked matrix model, and AMP-derived LAMP spectral estimator outperforms PCA on real-image covariances. For phase retrieval and compressed sensing AMP still finds hard phases, but those hard phases shrink with depth and compression and disappear asymptotically in the models studied.
AI-written summary · about
chapters (16)
- 0:00Start
- 1:51Inverse problems
- 3:08Examples
- 3:33Sparsity
- 4:30Learning a basis
- 6:22Matrix factorisation
- 7:32Sparse case
- 8:55Generative networks
- 9:38Statistical guarantee
- 10:48Role of depth
- 11:25Compositional Principle
- 12:23AMP for one-layer prior
- 15:04Spectral method
- 17:16LAMP on Fashion MNIST
- 17:51Other problems
- 18:29Generalised linear estimation
related talks
46mSolvable Model of Unsupervised Feature Learning
19mGeneralSparse: Bridging the Gap in SpMM for Pruned Large Language Model Inference..
52mDeep Generative Models And Unsupervised Methods For Inverse Problems
58mUniversality of Approximate Message Passing on Semi-random Matrices
40mSparse models are fast models: Improving DNN inference performance by over 10X
01h 04mStatistical Physics and Computation in High Dimension
31mStatistical Estimation on Graphs
01h 06mTutorial: Methods from Statistical Physics II
