Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2002.07258
Cited By
v1
v2 (latest)
Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits
Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), 2020
17 February 2020
Thibaut Cuvelier
Richard Combes
É. Gourdin
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits"
12 / 12 papers shown
Tractable Instances of Bilinear Maximization: Implementing LinUCB on Ellipsoids
International Journal of Intelligent Systems and Applications in Engineering (IJISAE), 2025
Raymond Zhang
Hedi Hadiji
Richard Combes
129
1
0
10 Nov 2025
Oracle-Efficient Combinatorial Semi-Bandits
Jung-hun Kim
Milan Vojnovic
Min-hwan Oh
122
1
0
24 Oct 2025
Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
Neural Information Processing Systems (NeurIPS), 2024
Raymond Zhang
Richard Combes
208
0
0
07 Oct 2024
Matroid Semi-Bandits in Sublinear Time
Ruo-Chun Tzeng
Naoto Ohsaka
Kaito Ariu
289
1
0
28 May 2024
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
Neural Information Processing Systems (NeurIPS), 2022
Xutong Liu
Jinhang Zuo
Siwei Wang
Carlee Joe-Wong
John C. S. Lui
Wei Chen
415
28
0
31 Aug 2022
Unimodal Mono-Partite Matching in a Bandit Setting
Romaric Gaudel
Matthieu Rodet
193
0
0
02 Aug 2022
Learning to Schedule Multi-Server Jobs with Fluctuated Processing Speeds
IEEE Transactions on Parallel and Distributed Systems (TPDS), 2022
Hailiang Zhao
Shuiguang Deng
Feiyi Chen
Yuxiang Cai
Schahram Dustdar
Albert Y. Zomaya
192
9
0
09 Apr 2022
Pure Exploration and Regret Minimization in Matching Bandits
International Conference on Machine Learning (ICML), 2021
Flore Sentenac
Jialin Yi
Clément Calauzènes
Vianney Perchet
Milan Vojnović
269
5
0
31 Jul 2021
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time
International Conference on Algorithmic Learning Theory (ALT), 2021
Thibaut Cuvelier
Richard Combes
É. Gourdin
264
9
0
14 Feb 2021
On the Suboptimality of Thompson Sampling in High Dimensions
Neural Information Processing Systems (NeurIPS), 2021
Raymond Zhang
Richard Combes
222
4
0
10 Feb 2021
Experimental Design for Regret Minimization in Linear Bandits
International Conference on Artificial Intelligence and Statistics (AISTATS), 2020
Andrew Wagenmaker
Julian Katz-Samuels
Kevin Jamieson
446
16
0
01 Nov 2020
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits
Neural Information Processing Systems (NeurIPS), 2020
Pierre Perrault
Etienne Boursier
Vianney Perchet
Michal Valko
292
41
0
11 Jun 2020
1
Page 1 of 1
