What is the Statistical Complexity of Reinforcement Learning?

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


Duration: 30:06
1,102 views
27

Sham Kakade (Harvard University)
Simons Institute 10th Anniversary Symposium



Other Videos By Simons Institute for the Theory of Computing


2022-05-27Coding Theory for Storage and Computation
2022-05-27Is There a Framework for Deep Learning in Multi-Agent Settings?
2022-05-27Some New Fine-Grained Complexity Results
2022-05-27Connections Between Pseudorandomness and Machine Learning
2022-05-27Connections Between Pseudorandomness and Machine Learning
2022-05-26MIP* = RE
2022-05-26Expansion in Graphs, Codes, and Proofs
2022-05-26How to Hide Secrets in Software
2022-05-26The Long Arm of Theoretical Computer Science: The Case of Blockchains/Web3
2022-05-26Graphs as Geometric Objects
2022-05-26What is the Statistical Complexity of Reinforcement Learning?
2022-05-26Patterns, Memory, and Maps: The Brain's Circuitry for Navigating the World
2022-05-26Realizing the Promise of Neuromorphic Computing
2022-05-26Fully Homomorphic Encryption, 10 Years Later: Definitions and Open Problems
2022-05-26Max-Flow and Friends, In Almost Linear Time
2022-05-25Modeling Conflict in Social Media
2022-05-25Welcome
2022-05-11Black Holes and the Quantum-Extended Church-Turing Thesis | Quantum Colloquium
2022-05-06The Role of Conventions in Adaptive Human-AI Interaction
2022-05-06Learning Decentralized Policies in Multiagent Systems: How to Learn Efficiently and ...
2022-05-06No-Regret Learning in Extensive-Form Games


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Simons Institute 10th Anniversary Symposium
Sham Kakade