Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits

17 February 2020

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

5 / 5 papers shown

Title
Matroid Semi-Bandits in Sublinear Time Ruo-Chun Tzeng Naoto Ohsaka Kaito Ariu 40 0 0 28 May 2024
Unimodal Mono-Partite Matching in a Bandit Setting Romaric Gaudel Matthieu Rodet 36 0 0 02 Aug 2022
Learning to Schedule Multi-Server Jobs with Fluctuated Processing Speeds Hailiang Zhao Shuiguang Deng Feiyi Chen Jianwei Yin Schahram Dustdar Albert Y. Zomaya 49 5 0 09 Apr 2022
On the Suboptimality of Thompson Sampling in High Dimensions Raymond Zhang Richard Combes 19 4 0 10 Feb 2021
Matroid Bandits: Fast Combinatorial Optimization with Learning Branislav Kveton Zheng Wen Azin Ashkan Hoda Eydgahi Brian Eriksson 46 119 0 20 Mar 2014