~/talk

Stochastic Bandits: Foundations and Current Perspectives

links:none on file
slides:none on file

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

  1. 0:00Introduction to extensions
  2. 2:04Contextual bandits concept
  3. 3:44Linear bandit model
  4. 6:18Linear bandit regret
  5. 8:44UCB for linear bandits
  6. 12:22Context assumptions
  7. 15:24UCB algorithm details
  8. 20:32Linear bandit analysis
  9. 24:35Proof sketch
  10. 30:56Information gain analysis
  11. 35:32Technical Q&A
  12. 40:49Thompson sampling
  13. 44:33Further generalizations
  14. 46:44Assortment optimization
  15. 50:58Parametric model selection
  16. 53:43Constraints and objectives
  17. 1:00:12Conclusion and next steps
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.