Pure Exploration Problems

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


Duration: 29:04
564 views
12

Wouter Koolen (Centrum Wiskunde & Informatica)
https://simons.berkeley.edu/talks/pure-exploration-problems
Mathematics of Online Decision Making



Other Videos By Simons Institute for the Theory of Computing


2020-10-28Model-Based Reinforcement Learning with Value-Targeted Regression
2020-10-28On the Complexity of Learning Good Policies With and Without Rewards
2020-10-28A Unifying View of Optimism in Episodic Reinforcement Learning
2020-10-27Competitive Algorithms for Online Control
2020-10-27The Non-Stochastic Control Framework
2020-10-27Robust Algorithms for Secretaries and Bandits
2020-10-27Regret Minimization for Stochastic Shortest Paths
2020-10-27Pandora's Box with Correlations: Learning and Approximation
2020-10-26Learning Outcomes in Queueing Systems
2020-10-26Gradient Descent-Ascent Provably Converges to Strict Local Minmax Equilibria with a Finite Timescale
2020-10-26Pure Exploration Problems
2020-10-26Selfish Robustness and Equilibria in Multi-Player Bandits
2020-10-26Multi-Task Optimal Experiment Design
2020-10-26Online Multiserver Convex Chasing and Optimization
2020-10-23Lower Estimates of Marginal Density
2020-10-23Graph Matching in Correlated Random Graphs via Small Subgraph Statistics
2020-10-23The (Non-)Concentration of the Chromatic Number
2020-10-23Log Concavity and Concentration of Measure on the Discrete Hypercube
2020-10-22Sharp Poincare and log-Sobolev Inequalities for the Switch Chain on Regular Bipartite Graphs
2020-10-22Rates of Normal Approximation for Typical Weighted Sums
2020-10-22The Langevin Algorithm in the Non Smooth Log-Concave Case


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