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. 1209.3353
  4. Cited By
Further Optimal Regret Bounds for Thompson Sampling

Further Optimal Regret Bounds for Thompson Sampling

15 September 2012
Shipra Agrawal
Navin Goyal
ArXivPDFHTML

Papers citing "Further Optimal Regret Bounds for Thompson Sampling"

5 / 5 papers shown
Title
Online Joint Assortment-Inventory Optimization under MNL Choices
Online Joint Assortment-Inventory Optimization under MNL Choices
Yong Liang
Xiaojie Mao
Shiyuan Wang
107
0
0
03 Jan 2025
Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
Arun Verma
Zhongxiang Dai
Xiaoqiang Lin
Patrick Jaillet
K. H. Low
93
5
0
24 Jul 2024
Thompson Sampling for Contextual Bandits with Linear Payoffs
Thompson Sampling for Contextual Bandits with Linear Payoffs
Shipra Agrawal
Navin Goyal
133
993
0
15 Sep 2012
A Finite-Time Analysis of Multi-armed Bandits Problems with
  Kullback-Leibler Divergences
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences
Odalric-Ambrym Maillard
Rémi Munos
Gilles Stoltz
65
146
0
29 May 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
Aurélien Garivier
Olivier Cappé
99
613
0
12 Feb 2011
1