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. 2310.06069
  4. Cited By
Optimal Exploration is no harder than Thompson Sampling

Optimal Exploration is no harder than Thompson Sampling

9 October 2023
Zhaoqi Li
Kevin Jamieson
Lalit P. Jain
ArXivPDFHTML

Papers citing "Optimal Exploration is no harder than Thompson Sampling"

3 / 3 papers shown
Title
Enhancing Preference-based Linear Bandits via Human Response Time
Enhancing Preference-based Linear Bandits via Human Response Time
Shen Li
Yuyang Zhang
Zhaolin Ren
Claire Liang
Na Li
J. Shah
42
0
0
03 Jan 2025
Thompson Exploration with Best Challenger Rule in Best Arm
  Identification
Thompson Exploration with Best Challenger Rule in Best Arm Identification
Jongyeong Lee
Junya Honda
Masashi Sugiyama
33
3
0
01 Oct 2023
On Elimination Strategies for Bandit Fixed-Confidence Identification
On Elimination Strategies for Bandit Fixed-Confidence Identification
Andrea Tirinzoni
Rémy Degenne
47
7
0
22 May 2022
1