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. 1905.12425
  4. Cited By
Near-optimal Optimistic Reinforcement Learning using Empirical Bernstein
  Inequalities
v1v2 (latest)

Near-optimal Optimistic Reinforcement Learning using Empirical Bernstein Inequalities

27 May 2019
Aristide C. Y. Tossou
D. Basu
Christos Dimitrakakis
ArXiv (abs)PDFHTML

Papers citing "Near-optimal Optimistic Reinforcement Learning using Empirical Bernstein Inequalities"

5 / 5 papers shown
Title
Regret Minimization for Reinforcement Learning by Evaluating the Optimal
  Bias Function
Regret Minimization for Reinforcement Learning by Evaluating the Optimal Bias Function
Zihan Zhang
Xiangyang Ji
79
72
0
12 Jun 2019
Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy
  Policies
Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies
Yonathan Efroni
Nadav Merlis
Mohammad Ghavamzadeh
Shie Mannor
OffRL
109
68
0
27 May 2019
Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPs
Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPs
Max Simchowitz
Kevin Jamieson
67
147
0
09 May 2019
REGAL: A Regularization based Algorithm for Reinforcement Learning in
  Weakly Communicating MDPs
REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs
Peter L. Bartlett
Ambuj Tewari
101
286
0
09 May 2012
Empirical Bernstein Bounds and Sample Variance Penalization
Empirical Bernstein Bounds and Sample Variance Penalization
Andreas Maurer
Massimiliano Pontil
418
545
0
21 Jul 2009
1