Solvable Model of Unsupervised Feature Learning
summary
Defines a planted sparse dictionary matrix factorization (Gaussian noise, iid dictionary, sparse X) and computes the information‑theoretic MMSE via the replica-derived MMSE formula; derives an AMP algorithm with matching state-evolution and shows its predictions; finds a sharp sample‑complexity phase transition separating an easy region from an information‑theoretic-but‑algorithmically‑hard region; implements AMP variants and shows they converge only up to a strictly larger sample threshold than the optimal, leaving a sizable algorithmic gap to close.
AI-written summary · about
chapters (25)
- 0:00Intro
- 1:15FEATURE LEARNING
- 2:10MULTILAYER PERCEPTRON (SUPERVISED)
- 4:34AUTO-ENCODER (UNSUPERVISED) (Rumelhart, Hinton, Williams 86)
- 9:26SIMPLEST CASE TO STUDY
- 13:17SOME KNOWN RESULTS
- 15:04"PLANTED" MATRIX FACTORIZATION
- 15:27BAYES-OPTIMAL STUDENT
- 16:30SOLVABLE WITH REPLICAS
- 18:34THE REPLICA METHOD
- 21:46STATIONARITY CONDITIONS
- 22:41AND ALGORITHMS?
- 22:58GRAPHICAL MODEL
- 23:51BELIEF PROPAGATION
- 24:38Approximate message passing
- 27:28AMP FOR MATRIX FACTORIZATION
- 29:14GENERALITY OF AMP
- 29:39STATE EVOLUTION
- 30:14BOTTOM LINE
- 31:11EXAMPLE: DICTIONARY LEARNING
- 32:11The phase diagram of dictionary learning
- 33:35Lower bound for the noiseless case and continuous variables
- 34:17Sample complexity of dictionary learning
- 39:33CONCLUSIONS
- 40:36TO DO LIST
related talks
29mAre Generative Models The New Sparsity?
35mPhase Retrieval In High Dimensions: Statistical And Computational Phase Transitions
01h 08mTutorial: Methods from Statistical Physics III
58mUniversality of Approximate Message Passing on Semi-random Matrices
38mAll-or-Nothing Statistical and Computational Phase Transitions in Sparse Spiked Matrix Estimation
01h 06mTutorial: Methods from Statistical Physics II
01h 04mStatistical Physics and Computation in High Dimension
19mGeneralSparse: Bridging the Gap in SpMM for Pruned Large Language Model Inference..
