118 citations · 405 across the 29 of their papers we have counts for
Showing 2021 · stat.MLShow all
3 papers · 2 filters
stat.ML2021★ 5 cited
Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information
Wei Huang, Richard Combes, Cindy Trinh
We propose a novel algorithm for multi-player multi-armed bandits without collision sensing information. Our algorithm circumvents two problems shared by all state-of-the-art algor…
stat.ML2021★ 2 cited
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time
Thibaut Cuvelier, Richard Combes, Eric Gourdin
We consider combinatorial semi-bandits with uncorrelated Gaussian rewards. In this article, we propose the first method, to the best of our knowledge, that enables to compute the s…
stat.ML2021★ 1 cited
On the Suboptimality of Thompson Sampling in High Dimensions
Raymond Zhang, Richard Combes
In this paper we consider Thompson Sampling (TS) for combinatorial semi-bandits. We demonstrate that, perhaps surprisingly, TS is sub-optimal for this problem in the sense that its…