|
Overview: This course studies how to make sequential decisions under uncertainty. We will develop online-learning and online-optimization methods with provable performance guarantees, study full-information and bandit feedback, and connect these ideas to inventory control and dynamic pricing.
Learning Objectives: Students will learn to formulate sequential decision problems, analyze algorithms such as Hedge, online gradient methods, UCB, and EXP3, prove regret guarantees, and adapt these tools to new problems.
Requirements: Three homework assignments and a final project consisting of a midterm proposal, a written report, and a final presentation.
Grading:
- Homework: 30% (three assignments, 10% each)
- Project: 70% (written report: 30%; final presentation: 40%)
Prerequisites: Familiarity with probability, calculus, linear algebra, optimization, and algorithm analysis. Prior exposure to machine learning is helpful but not required.
Related Materials and Courses: There is no required textbook. The following resources provide useful background and complementary perspectives.
Books:
Notes:
Related Courses:
Schedule:
Fall 2026 weekly course plan
| Week |
Date |
Topics |
Recommended Reading |
Homework |
| Week 1 |
Aug. 24 & 26 |
Introduction
|
Lecture Note 1 |
|
| Week 2 |
Aug. 31 & Sept. 2 |
Expert advice; Hedge; exponential weights
Regret lower bounds
|
Lecture Note 2 |
|
| Week 3 |
Sept. 7 & 9 |
Sept. 7: Labor Day — no class
Online convex optimization; FTRL; online gradient descent
|
Lecture Note 3 |
|
| Week 4 |
Sept. 14 & 16 |
Optimistic online learning
Learning in games
|
Lecture Note 4 |
|
| Week 5 |
Sept. 21 & 23 |
Stochastic multi-armed bandits; explore-then-exploit
Arm elimination; UCB
|
Lecture Note 5 |
|
| Week 6 |
Sept. 28 & 30 |
Adversarial multi-armed bandits
Epsilon-greedy; EXP3
|
Lecture Note 6 |
|
| Week 7 |
Oct. 5 & 7 |
Adversarial multi-armed bandits: lower bounds
Tsallis entropy
|
Lecture Note 7 |
|
| Week 8 |
Oct. 12 & 14 |
Adaptive bounds in multi-armed bandits
Small-loss bounds; best of both worlds
|
Lecture Note 8 |
|
| Week 9 |
Oct. 19 & 21 |
Stochastic and adversarial linear bandits
|
Lecture Note 9 |
|
| Week 10 |
Oct. 26 & 28 |
Contextual bandits
EXP4; SquareCB
|
Lecture Note 10 |
|
| Week 11 |
Nov. 2 & 4 |
Application: inventory control
Supply chain management
|
Lecture Note 11 |
|
| Week 12 |
Nov. 9 & 11 |
Application: dynamic pricing
|
Lecture Note 12 |
|
| Week 13 |
Nov. 16 & 18 |
Application: multinomial logit bandits
|
Lecture Note 13 |
|
| Week 14 |
Nov. 23 & 25 |
Fall Break / Thanksgiving — no class |
|
|
| Week 15 |
Nov. 30 & Dec. 2 |
Student presentations |
|
|
| Week 16 |
Dec. 7 & 9 |
Student presentations |
|
|
|