Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued)

Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued)

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


Duration: 1:02:56
388 views
10

Po-Ling Loh (University of Cambridge)
https://simons.berkeley.edu/talks/title-tba-8
Computational Complexity of Statistical Inference Boot Camp



Other Videos By Simons Institute for the Theory of Computing


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)
2021-08-25Lower Bounds on Statistical Estimation Rates Under Various Constraints
2021-08-25On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference (continued)
2021-08-25On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference
2021-08-25Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued)
2021-08-24Lower Bounds on Statistical Estimation Rates Under Various Constraints
2021-08-24The Fine Line between Hard and Easy Inference Problems: The View from CSPs (continued)
2021-08-24The Fine Line between Hard and Easy Inference Problems: The View from CSPs
2021-08-24In Search of New Algorithms Part II: Graphical Models
2021-08-23In Search of New Algorithms Part I: Neural Networks
2021-08-06An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Computational Complexity of Statistical Inference Boot Camp
Po-Ling Loh