Efficient abstraction selection in reinforcement learning

DOI10.1111/COIN.12016MaRDI QIDQ4972555zbMATH OpenOpenAlexFDO

Authors Harm van Seijen, Shimon Whiteson, Leon Kester

Publication date 25 November 2019

Published in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/coin.12016

zbMATH Keywords

abstraction selectionmodel-free learningreinforcement learningstructure learning

Mathematics Subject Classification ID

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

Recommendations

• AI 2005: Advances in Artificial Intelligence
• Abstraction from demonstration for efficient reinforcement learning in high-dimensional domains
• Abstraction and approximate decision-theoretic planning.
• Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
• Extreme state aggregation beyond Markov decision processes

Cited in

(5)

• Qualitative spatial abstraction in reinforcement learning. Foreword by Christian Freksa.
• Abstraction from demonstration for efficient reinforcement learning in high-dimensional domains
• scientific article; zbMATH DE number 7370547 (Why is no real title available?)
• A sufficient statistic for influence in structured multiagent environments
• AI 2005: Advances in Artificial Intelligence

This page was built for publication: Efficient abstraction selection in reinforcement learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972555)