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. 1310.7163
  4. Cited By
Generalized Thompson Sampling for Contextual Bandits

Generalized Thompson Sampling for Contextual Bandits

27 October 2013
Lihong Li
ArXivPDFHTML

Papers citing "Generalized Thompson Sampling for Contextual Bandits"

11 / 11 papers shown
Title
Optimal Exploration is no harder than Thompson Sampling
Optimal Exploration is no harder than Thompson Sampling
Zhaoqi Li
Kevin Jamieson
Lalit P. Jain
32
2
0
09 Oct 2023
A Scalable Recommendation Engine for New Users and Items
A Scalable Recommendation Engine for New Users and Items
Boya Xu
Yiting Deng
C. Mela
35
2
0
06 Sep 2022
Lifting the Information Ratio: An Information-Theoretic Analysis of
  Thompson Sampling for Contextual Bandits
Lifting the Information Ratio: An Information-Theoretic Analysis of Thompson Sampling for Contextual Bandits
Gergely Neu
Julia Olkhovskaya
Matteo Papini
Ludovic Schwartz
44
16
0
27 May 2022
Latent Contextual Bandits and their Application to Personalized
  Recommendations for New Users
Latent Contextual Bandits and their Application to Personalized Recommendations for New Users
Li Zhou
Emma Brunskill
19
62
0
22 Apr 2016
Online Stochastic Linear Optimization under One-bit Feedback
Online Stochastic Linear Optimization under One-bit Feedback
Lijun Zhang
Tianbao Yang
Rong Jin
Zhi-Hua Zhou
12
65
0
25 Sep 2015
On the Prior Sensitivity of Thompson Sampling
On the Prior Sensitivity of Thompson Sampling
Che-Yu Liu
Lihong Li
19
24
0
10 Jun 2015
A Note on Information-Directed Sampling and Thompson Sampling
A Note on Information-Directed Sampling and Thompson Sampling
Li Zhou
29
1
0
24 Mar 2015
Personalized Web Search
Personalized Web Search
Li Zhou
23
18
0
03 Feb 2015
An Information-Theoretic Analysis of Thompson Sampling
An Information-Theoretic Analysis of Thompson Sampling
Daniel Russo
Benjamin Van Roy
34
421
0
21 Mar 2014
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Alekh Agarwal
Daniel J. Hsu
Satyen Kale
John Langford
Lihong Li
Robert Schapire
OffRL
30
503
0
04 Feb 2014
Learning to Optimize Via Posterior Sampling
Learning to Optimize Via Posterior Sampling
Daniel Russo
Benjamin Van Roy
50
694
0
11 Jan 2013
1