Skip to Main content Skip to Navigation
Conference papers

Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning

Kailasam Lakshmanan 1 Ronald Ortner 1 Daniil Ryabko 2
2 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : We consider the problem of undiscounted reinforcement learning in continuous state space. Regret bounds in this setting usually hold under various assumptions on the structure of the reward and transition function. Under the assumption that the rewards and transition probabilities are Lipschitz, for 1-dimensional state space a regret bound of $\tilde{O}(T^{\frac{3}{4}})$ after any $T$ steps has been given by \citet{contrl}. Here we improve upon this result by using non-parametric kernel density estimation for estimating the transition probability distributions, and obtain regret bounds that depend on the smoothness of the transition probability distributions. In particular, under the assumption that the transition probability functions are smoothly differentiable, the regret bound is shown to be $\tilde{O}(T^{\frac{2}{3}})$ asymptotically for reinforcement learning in 1-dimensional state space. Finally, we also derive improved regret bounds for higher dimensional state space.
Document type :
Conference papers
Complete list of metadata
Contributor : Daniil Ryabko Connect in order to contact the contributor
Submitted on : Sunday, June 21, 2015 - 6:57:00 AM
Last modification on : Thursday, January 20, 2022 - 4:17:13 PM


  • HAL Id : hal-01165966, version 1


Kailasam Lakshmanan, Ronald Ortner, Daniil Ryabko. Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning. International Conference on Machine Learning (ICML), Jul 2015, Lille, France. ⟨hal-01165966⟩



Les métriques sont temporairement indisponibles