Stochastic Bandits: Foundations and Current Perspectives
summary
Covers algorithms and precise guarantees for stochastic bandits with feature vectors: a linear contextual model where contexts are seen before choice, are oblivious, and rewards equal x_t·μ plus sub-Gaussian noise with a common unknown μ. Extends UCB via a confidence-ball UCB (least‑squares estimator + B_t norm) to get regret ~Õ(d √T) independent of the number of arms, information-theoretic lower bound ~Ω(√(dT)), and a Thompson‑sampling variant with an extra √d factor; also addresses assortment optimization and vector rewards with convex objectives and budget/fairness constraints.
AI-written summary · about
chapters (17)
- 0:00Introduction to extensions
- 2:04Contextual bandits concept
- 3:44Linear bandit model
- 6:18Linear bandit regret
- 8:44UCB for linear bandits
- 12:22Context assumptions
- 15:24UCB algorithm details
- 20:32Linear bandit analysis
- 24:35Proof sketch
- 30:56Information gain analysis
- 35:32Technical Q&A
- 40:49Thompson sampling
- 44:33Further generalizations
- 46:44Assortment optimization
- 50:58Parametric model selection
- 53:43Constraints and objectives
- 1:00:12Conclusion and next steps
related talks
46mDynamic Regret Minimization for Bandits without Prior Knowledge
48mAdaptivity and Confounding in Multi-armed Bandit Experiments
30mFast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe
22mOnline Learning and Bandits with Queried Hints
27mOn the Complexity of Best Arm Identification in Multi-Armed Bandit Models
Bandits and Agents: How to Incentivize Exploration?
32mRevisiting the Exploration-Exploitation Trade-Off in Bandit Models
30mPractical Multi Armed Bandits
