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. 2302.11182
  4. Cited By
When Combinatorial Thompson Sampling meets Approximation Regret

When Combinatorial Thompson Sampling meets Approximation Regret

22 February 2023
Pierre Perrault
ArXivPDFHTML

Papers citing "When Combinatorial Thompson Sampling meets Approximation Regret"

6 / 6 papers shown
Title
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
Xutong Liu
Siwei Wang
Jinhang Zuo
Han Zhong
Xuchuang Wang
Zhiyong Wang
Shuai Li
Mohammad Hajiesmaili
J. C. Lui
Wei Chen
168
4
0
03 Jun 2024
On the Suboptimality of Thompson Sampling in High Dimensions
On the Suboptimality of Thompson Sampling in High Dimensions
Raymond Zhang
Richard Combes
59
4
0
10 Feb 2021
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically
  Triggered Arms
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms
Wei Chen
Yajun Wang
Yang Yuan
Qinshi Wang
80
283
0
31 Jul 2014
Efficient Learning in Large-Scale Combinatorial Semi-Bandits
Efficient Learning in Large-Scale Combinatorial Semi-Bandits
Zheng Wen
Branislav Kveton
Azin Ashkan
OffRL
141
96
0
28 Jun 2014
Thompson Sampling for Contextual Bandits with Linear Payoffs
Thompson Sampling for Contextual Bandits with Linear Payoffs
Shipra Agrawal
Navin Goyal
172
997
0
15 Sep 2012
Thompson Sampling: An Asymptotically Optimal Finite Time Analysis
Thompson Sampling: An Asymptotically Optimal Finite Time Analysis
E. Kaufmann
N. Korda
Rémi Munos
137
588
0
18 May 2012
1