ResearchTrend.AI
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

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
30
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