mlsanityData to 14 Oct 2026

UVIP: Model-Free Approach to Evaluate Reinforcement Learning Algorithms

arXiv 2105.02135 ↗First posted 5 May 2021cs.LG math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

Policy evaluation is an important instrument for the comparison of different algorithms in Reinforcement Learning (RL). However, even a precise knowledge of the value function Vπ corresponding to a policy π does not provide reliable information on how far the policy π is from the optimal one. We present a novel model-free upper value iteration procedure (sf UVIP) that allows us to estimate the suboptimality gap Vstar(x) - Vπ(x) from above and to construct confidence intervals for (V^star). Our approach relies on upper bounds to the solution of the Bellman optimality equation via the martingale approach. We provide theoretical guarantees for sf UVIP under general assumptions and illustrate its performance on a number of benchmark RL problems.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 18 of its 51 references that are in the map. First posted on arXiv 5 May 2021.

Builds on

18 of 51 references.

References · 18

  1. 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
  2. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
  3. 2016OpenAI Gymcited by 1,736
  4. 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 785
  5. 2017Minimax Regret Bounds for Reinforcement Learningcited by 503
  6. 2018Is Q-learning Provably Efficient?cited by 487
  7. 2015Learning Continuous Control Policies by Stochastic Value Gradientscited by 162
  8. 2018Policy Certificates: Towards Accountable Reinforcement Learningcited by 81
  9. 2019Variance-reduced Q-learning is minimax optimalcited by 73
  10. 2019A Comparative Analysis of Expected and Distributional Reinforcement Learningcited by 47
  11. 2019Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policiescited by 39
  12. 2018Expected Policy Gradients for Reinforcement Learningcited by 28
6 more
  1. 2020Tightening Exploration in Upper Confidence Reinforcement Learningcited by 25
  2. 2020Kernel-Based Reinforcement Learning: A Finite-Time Analysiscited by 23
  3. 2014Practical Kernel-Based Reinforcement Learningcited by 14
  4. 2019Conditional Importance Sampling for Off-Policy Learningcited by 13
  5. 2016Policy Error Bounds for Model-Based Reinforcement Learning with Factored Linear Modelscited by 5
  6. 2020Lookahead-Bounded Q-Learningcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.