Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits

17 February 2020

Papers citing "Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits"

7 / 7 papers shown

Title
Top-k Combinatorial Bandits with Full-Bandit Feedback Idan Rejwan Yishay Mansour 41 51 0 28 May 2019
Thompson Sampling for Combinatorial Semi-Bandits Siwei Wang Wei Chen 40 127 0 13 Mar 2018
Combinatorial semi-bandit with known covariance Rémy Degenne Vianney Perchet 26 47 0 06 Dec 2016
Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits Branislav Kveton Zheng Wen Azin Ashkan Csaba Szepesvári 39 47 0 03 Oct 2014
Efficient Learning in Large-Scale Combinatorial Semi-Bandits Zheng Wen Branislav Kveton Azin Ashkan OffRL 134 96 0 28 Jun 2014
Matroid Bandits: Fast Combinatorial Optimization with Learning Branislav Kveton Zheng Wen Azin Ashkan Hoda Eydgahi Brian Eriksson 69 119 0 20 Mar 2014
Kullback-Leibler upper confidence bounds for optimal sequential allocation Olivier Cappé Aurélien Garivier Odalric-Ambrym Maillard Rémi Munos Gilles Stoltz 96 395 0 03 Oct 2012