What Are the Statistical Limits of Offline Reinforcement Learning With Function Approximation?

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


Duration: 55:08
1,352 views
18

Sham Kakade (University of Washington & Microsoft Research)
https://simons.berkeley.edu/talks/lower-bounds-batch-reinforcement-learning
Mathematics of Online Decision Making



Other Videos By Simons Institute for the Theory of Computing


2020-11-11Algorithms with Prediction
2020-11-11Networks and Graphical Models
2020-11-11Geometric Aspects of Sampling and Optimization
2020-11-10Economics and Learning
2020-11-10Overview of FODSI
2020-11-10The Planted Matching Problem
2020-11-10Is Your Distribution In Shape?
2020-11-04Work in Progress: a Structured Sampling Package
2020-11-04Thin Shell Estimates for Maximal Affine Surface Area
2020-11-04Capacity Bounds via Productization
2020-10-30What Are the Statistical Limits of Offline Reinforcement Learning With Function Approximation?
2020-10-30An Alternative Softmax Operator for Reinforcement Learning
2020-10-30On the Global Convergence and Approximation Benefits of Policy Gradient Methods
2020-10-30Corruption Robust Exploration in Episodic Reinforcement Learning
2020-10-30Representation Learning and Exploration in Reinforcement Learning
2020-10-29Multiplayer Bandit Learning - From Competition to Cooperation
2020-10-29Multi-Player Multi-Armed Bandit: Can We Still Collaborate at Homes Without "Zoom"?
2020-10-29Country-Scale Bandit Implementation for Targeted COVID-19 Testing
2020-10-29Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
2020-10-29Beating the Curse of Dimensionality in High-Dimensional Optimal Stopping
2020-10-29Berkeley in the 80s, Episode 5: Richard Karp


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Sham Kakade
Mathematics of Online Decision Making