Skip to Main content Skip to Navigation
Conference papers

Tightening Exploration in Upper Confidence Reinforcement Learning

Hippolyte Bourel 1 Odalric-Ambrym Maillard 1, 2 Mohammad Talebi 1
1 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
2 Scool - Scool
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : The upper confidence reinforcement learning (UCRL2) algorithm introduced in (Jaksch et al., 2010) is a popular method to perform regret minimization in unknown discrete Markov Decision Processes under the average-reward criterion. Despite its nice and generic theoretical regret guarantees , this algorithm and its variants have remained until now mostly theoretical as numerical experiments in simple environments exhibit long burn-in phases before the learning takes place. In pursuit of practical efficiency, we present UCRL3, following the lines of UCRL2, but with two key modifications: First, it uses state-of-the-art time-uniform concentration inequalities to compute confidence sets on the reward and (component-wise) transition distributions for each state-action pair. Furthermore , to tighten exploration, it uses an adap-tive computation of the support of each transition distribution, which in turn enables us to revisit the extended value iteration procedure of UCRL2 to optimize over distributions with reduced support by disregarding low probability transitions, while still ensuring near-optimism. We demonstrate , through numerical experiments in standard environments, that reducing exploration this way yields a substantial numerical improvement compared to UCRL2 and its variants. On the theoretical side, these key modifications enable us to derive a regret bound for UCRL3 improving on UCRL2, that for the first time makes appear notions of local diameter and local effective support, thanks to variance-aware concentration bounds.
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download
Contributor : Odalric-Ambrym Maillard Connect in order to contact the contributor
Submitted on : Thursday, November 12, 2020 - 9:18:48 AM
Last modification on : Friday, January 21, 2022 - 3:11:44 AM
Long-term archiving on: : Saturday, February 13, 2021 - 6:22:19 PM


  • HAL Id : hal-03000664, version 1


Hippolyte Bourel, Odalric-Ambrym Maillard, Mohammad Talebi. Tightening Exploration in Upper Confidence Reinforcement Learning. International Conference on Machine Learning, Jul 2020, Vienna, Austria. ⟨hal-03000664⟩



Les métriques sont temporairement indisponibles