Skip navigation
Skip navigation

Asymptotic learnability of reinforcement problems with arbitrary dependence

Ryabko, Daniil; Hutter, Marcus


We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions, i.e. environments more general than (PO) MDPs. The task for an agent is to attain the best possible asymptotic reward where the true generating environment is unknown but belongs to a known countable family of environments. We find some sufficient conditions on the class of environments under which an agent exists which attains the best...[Show more]

CollectionsANU Research Publications
Date published: 2006
Type: Conference paper
Source: Proceedings of International Conference on Algorithmic Learning Theory (ALT 2006)


File Description SizeFormat Image
01_Ryabko_Asymptotic_learnability_of_2006.pdf26.33 kBAdobe PDF    Request a copy
02_Ryabko_Asymptotic_learnability_of_2006.pdf130.88 kBAdobe PDF    Request a copy
03_Ryabko_Asymptotic_learnability_of_2006.pdf160.2 kBAdobe PDF    Request a copy
04_Ryabko_Asymptotic_learnability_of_2006.pdf390.09 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  22 January 2019/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator