Solvable Model of Unsupervised Feature Learning

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=BzbhXnLQ22s


Duration: 46:00
640 views
6

Lenka Zdeborova, CNRS and CEA Saclay
Random Instances and Phase Transitions
https://simons.berkeley.edu/talks/lenka-zdeborova-2016-05-06



Other Videos By Simons Institute for the Theory of Computing


2016-05-06Planted Clique, Sum-of-Squares and Pseudo-Calibration
2016-05-06Spatial Coupling as a Proof Technique
2016-05-06Bootstrap Percolation on Random Graphs
2016-05-06Shotgun Assembly of Graphs
2016-05-06Phase Transitions in Semidefinite Relaxations (A Fast & Robust Algorithm for Community Detection)
2016-05-06Contagious Sets in Random Graphs
2016-05-06Community Detection with the Non-Backtracking Operator
2016-05-06The lower tail: Poisson approximation revisited
2016-05-06Stochastic Integration via Error-Correcting Codes
2016-05-06On the Chromatic Number of Random Regular Graphs
2016-05-06Solvable Model of Unsupervised Feature Learning
2016-05-05Recovering Biological Networks, and the Ubiquitous Inverse of the Variance-Covariance Matrix
2016-04-29Should Social Science Be Problem Oriented?
2016-04-29What the Crowd Knows About the Crowd
2016-04-29The Fragility of Organizations: A Simulation and Empirical Examples
2016-04-29Counterfactual Inference Using Behavioral Models: An Application to Search Advertising
2016-04-29Understanding Social Behavior During Crisis Events using Digital Traces
2016-04-29Communication Networks and Large-Scale Coordination
2016-04-29Discovery of Treatments from Text Corpora
2016-04-29Privacy for the Protected (Only)
2016-04-29Creating the Third Era of Survey Research


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Counting Complexity and Phase Transitions
Lenka Zdeborova