Analysis of Algorithms on Dense Matrices using Approximate Message Passing

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


Duration: 48:52
3,168 views
30

Andrea Montanari, Stanford University
Random Instances and Phase Transitions
https://simons.berkeley.edu/talks/andrea-montanari-2016-05-02



Other Videos By Simons Institute for the Theory of Computing


2016-06-27Real-Time Convex Optimization
2016-06-27Warning When You Need It: Earthquakes and Smartphones
2016-06-27Physics at the LHC: Data Analysis and Global Network Challenges with Exascale Data
2016-05-10Learning by Local Entropy Maximization
2016-05-09The Large Deviations of the Whitening Process in Random Constraint Satisfaction Problems
2016-05-09Teaching an old code a new trick
2016-05-06Sum of Squares SDP Relaxations on Random Tensors
2016-05-06Counting Solutions to Random Constraint Satisfaction Problems
2016-05-06Phase Transitions in Random CSPs
2016-05-06A Framework for Imperfectly Observed Networks
2016-05-06Analysis of Algorithms on Dense Matrices using Approximate Message Passing
2016-05-06Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model
2016-05-06Information-Theoretic Bounds and Phase Transitions in Community Detection and High-Dimensional Clust
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


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