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