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. 1205.4217
  4. Cited By
Thompson Sampling: An Asymptotically Optimal Finite Time Analysis

Thompson Sampling: An Asymptotically Optimal Finite Time Analysis

18 May 2012
E. Kaufmann
N. Korda
Rémi Munos
ArXivPDFHTML

Papers citing "Thompson Sampling: An Asymptotically Optimal Finite Time Analysis"

7 / 7 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
10
0
0
05 May 2025
Replicability is Asymptotically Free in Multi-armed Bandits
Replicability is Asymptotically Free in Multi-armed Bandits
Junpei Komiyama
Shinji Ito
Yuichi Yoshida
Souta Koshino
8
1
0
12 Feb 2024
Bandit Social Learning: Exploration under Myopic Behavior
Bandit Social Learning: Exploration under Myopic Behavior
Kiarash Banihashem
Mohammadtaghi Hajiaghayi
Suho Shin
Aleksandrs Slivkins
6
4
0
15 Feb 2023
Bandit Algorithms for Precision Medicine
Bandit Algorithms for Precision Medicine
Yangyi Lu
Ziping Xu
Ambuj Tewari
38
11
0
10 Aug 2021
Minimal Exploration in Structured Stochastic Bandits
Minimal Exploration in Structured Stochastic Bandits
Richard Combes
Stefan Magureanu
Alexandre Proutière
15
115
0
01 Nov 2017
Misspecified Linear Bandits
Misspecified Linear Bandits
Avishek Ghosh
Sayak Ray Chowdhury
Aditya Gopalan
17
65
0
23 Apr 2017
A Survey of Online Experiment Design with the Stochastic Multi-Armed
  Bandit
A Survey of Online Experiment Design with the Stochastic Multi-Armed Bandit
Giuseppe Burtini
Jason L. Loeppky
Ramon Lawrence
16
118
0
02 Oct 2015
1