Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization

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


Duration: 40:53
853 views
8

Negin Golrezaei (MIT)
https://simons.berkeley.edu/talks/online-learning-offline-greedy-algorithms-applications-market-design-and-optimization
Mathematics of Online Decision Making



Other Videos By Simons Institute for the Theory of Computing


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
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


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