Extreme state aggregation beyond Markov decision processes

DOI10.1016/j.tcs.2016.07.032zbMath1353.68236OpenAlexW2482498454WikidataQ58012178 ScholiaQ58012178MaRDI QIDQ329613

Marcus Hutter

Publication date: 21 October 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.032

zbMATH Keywords

reinforcement learningnon-MDPstate aggregation

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• General time consistent discounting
• Near-optimal PAC bounds for discounted MDPs
• Equivalence notions and model minimization in Markov decision processes
• Universal artificial intelligence. Sequential decisions based on algorithmic probability.
• On a general approach to the strong laws of large numbers
• Extreme State Aggregation beyond MDPs
• Pseudometrics for State Aggregation in Average Reward Markov Decision Processes
• A General Approach to the Strong Law of Large Numbers
• Consistency of Feature Markov Processes
• Learning Theory and Kernel Machines

This page was built for publication: Extreme state aggregation beyond Markov decision processes