Optimal Iterative Algorithms for Problems With Random Data

Optimal Iterative Algorithms for Problems With Random Data

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


Duration: 52:41
1,925 views
35

Andrea Montanari (Stanford)
https://simons.berkeley.edu/talks/title-tba-15
Computational Complexity of Statistical Inference Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2021-09-01Crash Course on Optimal Transport
2021-09-01An Introduction to Hamiltonian Monte Carlo Method for Sampling
2021-09-01Sampling Using Diffusion Processes, from Langevin to Schrödinger
2021-09-01Sampling Crash Course (continued)
2021-08-31Sampling Crash Course
2021-08-31Geodesic Convexity and Optimization
2021-08-31Optimization on Manifolds
2021-08-31Optimization Crash Course (continued)
2021-08-30Optimization Crash Course
2021-08-28Optimal Iterative Algorithms for Problems With Random Data (continued)
2021-08-28Optimal Iterative Algorithms for Problems With Random Data
2021-08-28Average-Case Complexity Theory (continued)
2021-08-27Average-Case Complexity Theory
2021-08-27Summer Cluster in Quantum Computation | Polylogues
2021-08-27Approximate Message Passing Algorithms (continued)
2021-08-27Approximate Message Passing Algorithms
2021-08-27Average-Case Complexity Theory (continued)
2021-08-26Average-Case Complexity Theory
2021-08-26On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference (continued)
2021-08-26On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference
2021-08-26Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued)


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Computational Complexity of Statistical Inference Boot Camp
Andrea Montanari