Skip navigation
Skip navigation

The Sample-Complexity of General Reinforcement Learning

Lattimore, Tor; Hutter, Marcus; Sunehag, Peter

Description

We present a new algorithm for general reinforcement learning where the true environment is known to belong to a finite class of N arbitrary models. The algorithm is shown to be near-optimal for all but O(N log2 N) time-steps with high probability. Infinite classes are also considered where we show that compactness is a key criterion for determining the existence of uniform sample-complexity bounds. A matching lower bound is given for the finite case.

CollectionsANU Research Publications
Date published: 2013
Type: Conference paper
URI: http://hdl.handle.net/1885/65766
Source: The Sample-Complexity of General Reinforcement Learning

Download

File Description SizeFormat Image
01_Lattimore_The_Sample-Complexity_of_2013.pdf393.56 kBAdobe PDF    Request a copy


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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator