YoVDO

Adversarial Bandits: Theory and Algorithms

Offered By: Simons Institute via YouTube

Tags

Online Learning Courses Algorithms Courses Sequential Decision Making Courses

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

E-learning and Digital Cultures
University of Edinburgh via Coursera
Construcción de un Curso Virtual en la Plataforma Moodle
Universidad de San Martín de Porres via Miríadax
Teaching Computing: Part 2
University of East Anglia via FutureLearn
Learning Design
University of Leicester via EMMA
Nuevos escenarios de aprendizaje digital
University of the Basque Country via Miríadax