Robust Algorithms for Secretaries and Bandits

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


Duration: 33:04
446 views
7

Anupam Gupta
https://simons.berkeley.edu/talks/tbd-232
Mathematics of Online Decision Making



Other Videos By Simons Institute for the Theory of Computing


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
2020-10-29A Generalization Bound for Online Variational Inference
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


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