mlsanityData to 7 Oct 2026

Near-optimal Optimistic Reinforcement Learning using Empirical Bernstein Inequalities

arXiv 1905.12425 ↗First posted 27 May 2019cs.LG cs.AI cs.GTcited by 15

Not on the map. Why?

Abstract (arXiv)

We study model-based reinforcement learning in an unknown finite communicating Markov decision process. We propose a simple algorithm that leverages a variance based confidence interval. We show that the proposed algorithm, UCRL-V, achieves the optimal regret tildeO(√DSAT) up to logarithmic factors, and so our work closes a gap with the lower bound without additional assumptions on the MDP. We perform experiments in a variety of environments that validates the theoretical bounds as well as prove UCRL-V to be better than the state-of-the-art algorithms.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 May 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 1; 2023: 7; 2024: 2; 2025: 1.

15 papers.

Sort:

By area: