Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2006.06613
Cited By
v1
v2 (latest)
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits
11 June 2020
Pierre Perrault
Etienne Boursier
Vianney Perchet
Michal Valko
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits"
26 / 26 papers shown
Title
Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
Fateme Jamshidi
Mohammad Shahverdikondori
Negar Kiyavash
56
1
0
10 Mar 2025
Both Ears Wide Open: Towards Language-Driven Spatial Audio Generation
Peiwen Sun
Sitong Cheng
Xin Li
Zhen Ye
Huadai Liu
Honggang Zhang
Wei Xue
Yike Guo
DiffM
54
5
0
14 Oct 2024
Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
Raymond Zhang
Richard Combes
51
0
0
07 Oct 2024
Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Bandits
Tatsuhiro Shimizu
Koichi Tanaka
Ren Kishimoto
Haruka Kiyohara
Masahiro Nomura
Yuta Saito
CML
OffRL
88
1
0
20 Aug 2024
Matroid Semi-Bandits in Sublinear Time
Ruo-Chun Tzeng
Naoto Ohsaka
Kaito Ariu
66
0
0
28 May 2024
Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo
Haoyang Zheng
Wei Deng
Christian Moya
Guang Lin
85
6
0
22 Jan 2024
Constant or logarithmic regret in asynchronous multiplayer bandits
Hugo Richard
Etienne Boursier
Vianney Perchet
61
1
0
31 May 2023
When Combinatorial Thompson Sampling meets Approximation Regret
Pierre Perrault
101
8
0
22 Feb 2023
A survey on multi-player bandits
Etienne Boursier
Vianney Perchet
89
16
0
29 Nov 2022
Unimodal Mono-Partite Matching in a Bandit Setting
Romaric Gaudel
Matthieu Rodet
70
0
0
02 Aug 2022
Thompson Sampling for (Combinatorial) Pure Exploration
Siwei Wang
Jun Zhu
28
6
0
18 Jun 2022
Uplifting Bandits
Yu-Guan Hsieh
S. Kasiviswanathan
Branislav Kveton
32
1
0
08 Jun 2022
An
α
α
α
-No-Regret Algorithm For Graphical Bilinear Bandits
Geovani Rizk
Igor Colin
Albert Thomas
R. Laraki
Y. Chevaleyre
14
0
0
01 Jun 2022
Thompson Sampling for Bandit Learning in Matching Markets
Fang-yuan Kong
Junming Yin
Shuaiqi Li
53
17
0
26 Apr 2022
Towards Scalable and Robust Structured Bandits: A Meta-Learning Framework
Runzhe Wan
Linjuan Ge
Rui Song
69
14
0
26 Feb 2022
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle
Fang-yuan Kong
Yueran Yang
Wei Chen
Shuai Li
81
8
0
08 Nov 2021
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization
Chengshuai Shi
Wei Xiong
Cong Shen
Jing Yang
62
24
0
27 Oct 2021
Pure Exploration and Regret Minimization in Matching Bandits
Flore Sentenac
Jialin Yi
Clément Calauzènes
Vianney Perchet
Milan Vojnović
23
6
0
31 Jul 2021
Censored Semi-Bandits for Resource Allocation
Arun Verma
M. Hanawal
A. Rajkumar
Raman Sankaran
34
2
0
12 Apr 2021
On the Suboptimality of Thompson Sampling in High Dimensions
Raymond Zhang
Richard Combes
66
4
0
10 Feb 2021
Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback
Marc Jourdan
Mojmír Mutný
Johannes Kirschner
Andreas Krause
97
32
0
21 Jan 2021
Be Greedy in Multi-Armed Bandits
Matthieu Jedor
Jonathan Louëdec
Vianney Perchet
397
8
0
04 Jan 2021
Lifelong Learning in Multi-Armed Bandits
Matthieu Jedor
Jonathan Louëdec
Vianney Perchet
57
2
0
28 Dec 2020
Best Arm Identification in Graphical Bilinear Bandits
Geovani Rizk
Albert Thomas
Igor Colin
R. Laraki
Y. Chevaleyre
94
6
0
14 Dec 2020
Experimental Design for Regret Minimization in Linear Bandits
Andrew Wagenmaker
Julian Katz-Samuels
Kevin Jamieson
114
16
0
01 Nov 2020
Thompson Sampling for Combinatorial Semi-Bandits
Siwei Wang
Wei Chen
83
130
0
13 Mar 2018
1