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. 1405.5096
  4. Cited By
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms

Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms

20 May 2014
Richard Combes
Alexandre Proutiere
ArXivPDFHTML

Papers citing "Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms"

5 / 5 papers shown
Title
Best-Arm Identification in Unimodal Bandits
Best-Arm Identification in Unimodal Bandits
Riccardo Poiani
Marc Jourdan
E. Kaufmann
Rémy Degenne
126
0
0
04 Nov 2024
Kullback-Leibler upper confidence bounds for optimal sequential
  allocation
Kullback-Leibler upper confidence bounds for optimal sequential allocation
Olivier Cappé
Aurélien Garivier
Odalric-Ambrym Maillard
Rémi Munos
Gilles Stoltz
93
394
0
03 Oct 2012
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é
133
613
0
12 Feb 2011
Multi-Armed Bandits in Metric Spaces
Multi-Armed Bandits in Metric Spaces
Robert D. Kleinberg
Aleksandrs Slivkins
E. Upfal
277
468
0
29 Sep 2008
On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems
On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems
Aurélien Garivier
Eric Moulines
82
294
0
22 May 2008
1