~/talk

Solvable Model of Unsupervised Feature Learning

links:none on file
slides:none on file

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

  1. 0:00Intro
  2. 1:15FEATURE LEARNING
  3. 2:10MULTILAYER PERCEPTRON (SUPERVISED)
  4. 4:34AUTO-ENCODER (UNSUPERVISED) (Rumelhart, Hinton, Williams 86)
  5. 9:26SIMPLEST CASE TO STUDY
  6. 13:17SOME KNOWN RESULTS
  7. 15:04"PLANTED" MATRIX FACTORIZATION
  8. 15:27BAYES-OPTIMAL STUDENT
  9. 16:30SOLVABLE WITH REPLICAS
  10. 18:34THE REPLICA METHOD
  11. 21:46STATIONARITY CONDITIONS
  12. 22:41AND ALGORITHMS?
  13. 22:58GRAPHICAL MODEL
  14. 23:51BELIEF PROPAGATION
  15. 24:38Approximate message passing
  16. 27:28AMP FOR MATRIX FACTORIZATION
  17. 29:14GENERALITY OF AMP
  18. 29:39STATE EVOLUTION
  19. 30:14BOTTOM LINE
  20. 31:11EXAMPLE: DICTIONARY LEARNING
  21. 32:11The phase diagram of dictionary learning
  22. 33:35Lower bound for the noiseless case and continuous variables
  23. 34:17Sample complexity of dictionary learning
  24. 39:33CONCLUSIONS
  25. 40:36TO DO LIST
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.