mlsanityData to 7 Oct 2026

Improved Analysis of UCRL2 with Empirical Bernstein Inequality

arXiv 2007.05456 ↗First posted 10 Jul 2020cs.LG stat.MLcited by 18

Not on the map. Why?

Abstract (arXiv)

We consider the problem of exploration-exploitation in communicating Markov Decision Processes. We provide an analysis of UCRL2 with Empirical Bernstein inequalities (UCRL2B). For any MDP with S states, A actions, Gamma ≤ S next states and diameter D, the regret of UCRL2B is bounded as widetildeO(√DGamma S A T).

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 2; 2023: 2; 2024: 5; 2025: 2; 2026: 4.

18 papers.

Sort:

By area:

  1. 2021Understanding Domain Randomization for Sim-to-real Transfercited by 69
  2. 2022Policy Optimization with Linear Temporal Logic Constraintscited by 19
  3. 2021Nearly Minimax Optimal Regret for Learning Infinite-horizon Average-reward MDPs with Linear Function Approximationcited by 18
  4. 2024Achieving Tractable Minimax Optimal Regret in Average Reward MDPscited by 13
  5. 2024Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPscited by 7
  6. 2021Optimism and Delays in Episodic Reinforcement Learningcited by 4
  7. 2022Horizon-Free and Variance-Dependent Reinforcement Learning for Latent Markov Decision Processescited by 3
  8. 2026Optimistic World Models: Efficient Exploration in Model-Based Deep Reinforcement Learningcited by 2
  9. 2024Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Spancited by 1
  10. 2024Model Selection for Average Reward RL with Application to Utility Maximization in Repeated Gamescited by 1
  11. 2024Provably Efficient Exploration in Reward Machines with Low Regretcited by 1
  12. 2025A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Modelcited by 1
6 more
  1. 2026Sample Complexity Bounds for Stochastic Shortest Path with a Generative Modelcited by 1
  2. 2023A Cover Time Study of a non-Markovian Algorithmcited by 0
  3. 2023On Reward Structures of Markov Decision Processescited by 0
  4. 2025Tail Distribution of Regret in Optimistic Reinforcement Learningcited by 0
  5. 2026Fast Non-Episodic Finite-Horizon RL with K-Step Lookahead Thresholdingcited by 0
  6. 2026Finite Constant Frontiers and Auditable Regret Certificates for Average-Reward Reinforcement Learningcited by 0