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. 1603.08661
  4. Cited By
Regret Analysis of the Anytime Optimally Confident UCB Algorithm

Regret Analysis of the Anytime Optimally Confident UCB Algorithm

29 March 2016
Tor Lattimore
ArXivPDFHTML

Papers citing "Regret Analysis of the Anytime Optimally Confident UCB Algorithm"

4 / 4 papers shown
Title
Exploration in Deep Reinforcement Learning: From Single-Agent to
  Multiagent Domain
Exploration in Deep Reinforcement Learning: From Single-Agent to Multiagent Domain
Jianye Hao
Tianpei Yang
Hongyao Tang
Chenjia Bai
Jinyi Liu
Zhaopeng Meng
Peng Liu
Zhen Wang
OffRL
28
91
0
14 Sep 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
13
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
17
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