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. 2206.03520
  4. Cited By
Finite-Time Regret of Thompson Sampling Algorithms for Exponential
  Family Multi-Armed Bandits

Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits

7 June 2022
Tianyuan Jin
Pan Xu
X. Xiao
Anima Anandkumar
ArXivPDFHTML

Papers citing "Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits"

3 / 3 papers shown
Title
Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret
Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret
Bingshan Hu
Zhiming Huang
Tianyue H. Zhang
Mathias Lécuyer
Nidhi Hegde
17
0
0
05 May 2025
Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded
  Rewards
Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards
Hao Qin
Kwang-Sung Jun
Chicheng Zhang
27
0
0
28 Apr 2023
On Bayesian index policies for sequential resource allocation
On Bayesian index policies for sequential resource allocation
E. Kaufmann
31
84
0
06 Jan 2016
1