Adversarial Bandits: Theory and Algorithms
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore the theory and algorithms behind adversarial multi-armed bandit problems in this comprehensive lecture by Haipeng Luo from USC. Delve into the intersection of online learning and bandit literature, focusing on sequential decision-making without distributional assumptions and learning with partial information feedback. Begin with an overview of classical algorithms and their analysis before progressing to recent advances in data-dependent regret guarantees, structural bandits, bandits with switching costs, and combining bandit algorithms. Compare and contrast online learning with full-information feedback versus bandit feedback, gaining valuable insights into this influential field of study.
Syllabus
Adversarial Bandits: Theory and Algorithms
Taught by
Simons Institute
Related Courses
Toward Generalizable Embodied AI for Machine AutonomyBolei Zhou via YouTube What Are the Statistical Limits of Offline Reinforcement Learning With Function Approximation?
Simons Institute via YouTube Better Learning from the Past - Counterfactual - Batch RL
Simons Institute via YouTube Off-Policy Policy Optimization
Simons Institute via YouTube Provably Efficient Reinforcement Learning with Linear Function Approximation - Chi Jin
Institute for Advanced Study via YouTube