Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence

DOI10.1007/11894841_27zbMath1168.68491OpenAlexW2134278243WikidataQ62614588 ScholiaQ62614588MaRDI QIDQ3522996

Daniil Ryabko, Marcus Hutter

Publication date: 4 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1885/28514

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Markov and semi-Markov decision processes (90C40)

Related Items

Open problems in universal induction \& intelligence ⋮ Predicting non-stationary processes

Uses Software

• R-MAX