Lower Bounds on Statistical Estimation Rates Under Various Constraints

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


Duration: 1:06:26
996 views
22

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



Other Videos By Simons Institute for the Theory of Computing


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
2021-07-18Until the Sun Engulfs the Earth: Lower Bounds in Computational Complexity | Theory Shorts
2021-07-17Twisted Product Constructions for LDPC Quantum Codes
2021-07-17What the Foundations of Quantum Computer Science Teach Us About Chemistry
2021-07-17Electronic Structure in a Fixed Basis Is QMA-Complete
2021-07-17Improved Upper Bounds on the Stabilizer Rank of Magic States


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