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. 1702.07211
  4. Cited By
A minimax and asymptotically optimal algorithm for stochastic bandits

A minimax and asymptotically optimal algorithm for stochastic bandits

23 February 2017
Pierre Ménard
Aurélien Garivier
ArXivPDFHTML

Papers citing "A minimax and asymptotically optimal algorithm for stochastic bandits"

10 / 10 papers shown
Title
On Lai's Upper Confidence Bound in Multi-Armed Bandits
On Lai's Upper Confidence Bound in Multi-Armed Bandits
Huachen Ren
Cun-Hui Zhang
20
1
0
03 Oct 2024
Multi-Armed Bandits with Abstention
Multi-Armed Bandits with Abstention
Junwen Yang
Tianyuan Jin
Vincent Y. F. Tan
16
0
0
23 Feb 2024
Optimal Batched Best Arm Identification
Optimal Batched Best Arm Identification
Tianyuan Jin
Yu Yang
Jing Tang
Xiaokui Xiao
Pan Xu
24
3
0
21 Oct 2023
VITS : Variational Inference Thompson Sampling for contextual bandits
VITS : Variational Inference Thompson Sampling for contextual bandits
Pierre Clavier
Tom Huix
Alain Durmus
20
3
0
19 Jul 2023
Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded
  Rewards
Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards
Hao Qin
Kwang-Sung Jun
Chicheng Zhang
17
0
0
28 Apr 2023
Truncated LinUCB for Stochastic Linear Bandits
Truncated LinUCB for Stochastic Linear Bandits
Yanglei Song
Meng zhou
42
0
0
23 Feb 2022
Maillard Sampling: Boltzmann Exploration Done Optimally
Maillard Sampling: Boltzmann Exploration Done Optimally
Jieming Bian
Kwang-Sung Jun
11
12
0
05 Nov 2021
KL-UCB-switch: optimal regret bounds for stochastic bandits from both a
  distribution-dependent and a distribution-free viewpoints
KL-UCB-switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpoints
Aurélien Garivier
Hédi Hadiji
Pierre Menard
Gilles Stoltz
11
32
0
14 May 2018
Learning the distribution with largest mean: two bandit frameworks
Learning the distribution with largest mean: two bandit frameworks
E. Kaufmann
Aurélien Garivier
14
19
0
31 Jan 2017
On Bayesian index policies for sequential resource allocation
On Bayesian index policies for sequential resource allocation
E. Kaufmann
23
84
0
06 Jan 2016
1