Event
Weekly OSI Lab Seminar
Short summary
In this seminar, I start by introducing the problem of bandits, overall proof techniques for the fundamental lower bounds, and a brief overview of variants of bandits. Then I specifically focus on a special class of bandits, called combinatorial (semi-)bandits.
Papers
Papers and textbooks discussed in the seminar:
- Tor Lattimore, Csaba Szepesvári. “Bandit Algorithms.” (Cambridge University Press) 2020.
- Richard Combes, M. Sadegh Talebi, Alexandre Proutière, Marc Lelarge. “Combinatorial Bandits Revisited.” In NeurIPS 2015.
- Branislav Kveton, Zheng Wen, Azin Ashkan, Hoda Eydgahi, Brian Eriksson. “Matroid Bandits: Fast Combinatorial Optimization with Learning.” In UAI 2014.