An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture

An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture

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


Duration: 1:01:26
2,028 views
28

Yuansi Chen (Duke University)

https://simons.berkeley.edu/events/breakthroughs-almost-constant-lower-bound-isoperimetric-coefficient-kls-conjecture-0

Breakthroughs lecture series



Other Videos By Simons Institute for the Theory of Computing


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
2021-07-16Linear Growth of Quantum Circuit Complexity
2021-07-16Entanglement Spread in Communication Complexity and Many-Body Physics
2021-07-16Exponential Separations Between Learning With and Without Quantum Memory
2021-07-16A Rigorous and Robust Quantum Speed-up in Supervised Machine Learning
2021-07-16Provably Efficient Machine Learning for Quantum Many-Body Problems


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Breakthroughs Lecture Series
Yuansi Chen