On the Complexity of Learning Good Policies With and Without Rewards

Channel:

Subscribers:

68,700

Published on October 28, 2020 5:10:00 PM ● Video Link: https://www.youtube.com/watch?v=zoAPej_4l3E

Duration: 30:58

283 views

Other Videos By Simons Institute for the Theory of Computing

2020-10-30	Corruption Robust Exploration in Episodic Reinforcement Learning
2020-10-30	Representation Learning and Exploration in Reinforcement Learning
2020-10-29	Multiplayer Bandit Learning - From Competition to Cooperation
2020-10-29	Multi-Player Multi-Armed Bandit: Can We Still Collaborate at Homes Without "Zoom"?
2020-10-29	Country-Scale Bandit Implementation for Targeted COVID-19 Testing
2020-10-29	Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
2020-10-29	Beating the Curse of Dimensionality in High-Dimensional Optimal Stopping
2020-10-29	Berkeley in the 80s, Episode 5: Richard Karp
2020-10-29	A Generalization Bound for Online Variational Inference
2020-10-28	Model-Based Reinforcement Learning with Value-Targeted Regression
2020-10-28	On the Complexity of Learning Good Policies With and Without Rewards
2020-10-28	A Unifying View of Optimism in Episodic Reinforcement Learning
2020-10-27	Competitive Algorithms for Online Control
2020-10-27	The Non-Stochastic Control Framework
2020-10-27	Robust Algorithms for Secretaries and Bandits
2020-10-27	Regret Minimization for Stochastic Shortest Paths
2020-10-27	Pandora's Box with Correlations: Learning and Approximation
2020-10-26	Learning Outcomes in Queueing Systems
2020-10-26	Gradient Descent-Ascent Provably Converges to Strict Local Minmax Equilibria with a Finite Timescale
2020-10-26	Pure Exploration Problems
2020-10-26	Selfish Robustness and Equilibria in Multi-Player Bandits

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Emilie Kaufmann

Mathematics of Online Decision Making