Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning

Odalric-Ambrym Maillard 1 Phuong Nguyen 2 Ronald Ortner 1 Daniil Ryabko 3
1 MUL - Montanuniversität Leoben
2 NICTA - National ICT Australia [Sydney]
3 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal, Inria Lille - Nord Europe
Abstract : We consider an agent interacting with an environment in a single stream of actions, observations, and rewards, with no reset. This process is not assumed to be a Markov Decision Process (MDP). Rather, the agent has several representations (mapping histories of past interactions to a discrete state space) of the environment with unknown dynamics, only some of which result in an MDP. The goal is to minimize the average regret criterion against an agent who knows an MDP representation giving the highest optimal reward, and acts optimally in it. Recent regret bounds for this setting are of order $O(T^{2/3})$ with an additive term constant yet exponential in some characteristics of the optimal MDP. We propose an algorithm whose regret after $T$ time steps is $O(\sqrt{T})$, with all constants reasonably small. This is optimal in $T$ since $O(\sqrt{T})$ is the optimal regret in the setting of learning in a (single discrete) MDP.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
https://hal.inria.fr/hal-00778586
Contributor : Daniil Ryabko <>
Submitted on : Wednesday, March 20, 2013 - 10:52:14 AM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on: Friday, June 21, 2013 - 4:12:20 AM

File

icml1_iblb_cr-corrected.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00778586, version 1

Collections

CNRS | INRIA | LAGIS | UNIV-LILLE3 | CRISTAL | CRISTAL-SEQUEL

Citation

Odalric-Ambrym Maillard, Phuong Nguyen, Ronald Ortner, Daniil Ryabko. Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning. ICML - 30th International Conference on Machine Learning, 2013, Atlanta, USA, United States. pp.543-551. ⟨hal-00778586⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

407

Files downloads

171

 

 

Contact

archive-ouverte@inria.fr