ResearchTrend.AI
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle

The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle

Fang-yuan Kong
Yueran Yang
Wei Chen
Shuai Li
ArXivPDFHTML

Papers citing "The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle"

2 / 2 papers shown
Title
Matroid Semi-Bandits in Sublinear Time
Matroid Semi-Bandits in Sublinear Time
Ruo-Chun Tzeng
Naoto Ohsaka
Kaito Ariu
29
0
0
28 May 2024
Matroid Bandits: Fast Combinatorial Optimization with Learning
Matroid Bandits: Fast Combinatorial Optimization with Learning
B. Kveton
Zheng Wen
Azin Ashkan
Hoda Eydgahi
Brian Eriksson
46
119
0
20 Mar 2014