ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2006.06613
  4. Cited By
Statistical Efficiency of Thompson Sampling for Combinatorial
  Semi-Bandits

Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits

11 June 2020
Pierre Perrault
Etienne Boursier
Vianney Perchet
Michal Valko
ArXivPDFHTML

Papers citing "Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits"

8 / 8 papers shown
Title
Matroid Semi-Bandits in Sublinear Time
Matroid Semi-Bandits in Sublinear Time
Ruo-Chun Tzeng
Naoto Ohsaka
Kaito Ariu
40
0
0
28 May 2024
A survey on multi-player bandits
A survey on multi-player bandits
Etienne Boursier
Vianney Perchet
32
13
0
29 Nov 2022
Unimodal Mono-Partite Matching in a Bandit Setting
Unimodal Mono-Partite Matching in a Bandit Setting
Romaric Gaudel
Matthieu Rodet
36
0
0
02 Aug 2022
Towards Scalable and Robust Structured Bandits: A Meta-Learning
  Framework
Towards Scalable and Robust Structured Bandits: A Meta-Learning Framework
Runzhe Wan
Linjuan Ge
Rui Song
20
13
0
26 Feb 2022
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and
  Generalization
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization
Chengshuai Shi
Wei Xiong
Cong Shen
Jing Yang
25
23
0
27 Oct 2021
On the Suboptimality of Thompson Sampling in High Dimensions
On the Suboptimality of Thompson Sampling in High Dimensions
Raymond Zhang
Richard Combes
19
4
0
10 Feb 2021
Thompson Sampling for Combinatorial Semi-Bandits
Thompson Sampling for Combinatorial Semi-Bandits
Siwei Wang
Wei Chen
22
125
0
13 Mar 2018
Matroid Bandits: Fast Combinatorial Optimization with Learning
Matroid Bandits: Fast Combinatorial Optimization with Learning
Branislav Kveton
Zheng Wen
Azin Ashkan
Hoda Eydgahi
Brian Eriksson
46
119
0
20 Mar 2014
1