Abstraction from demonstration for efficient reinforcement learning in high-dimensional domains

DOI10.1016/J.ARTINT.2014.07.003zbMATH Open1405.68283OpenAlexW1965568826MaRDI QIDQ460616FDOQ460616

Kaushik Subramanian, Charles L. jun. Isbell, Aaron D. Lanterman, Luis C. Cobo, Andrea L. Thomaz

Publication date: 13 October 2014

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2014.07.003

zbMATH Keywords

dimensionality reductionreinforcement learningfunction approximationlearning from demonstration

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Recent advances in hierarchical reinforcement learning
• Programming backgammon using self-teaching neural nets
• 10.1162/1532443041827907
• Reducing reinforcement learning to KWIK online regression
• Algorithms for Reinforcement Learning
• Title not available (Why is that?)
• Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
• Title not available (Why is that?)
• ML-KNN: A lazy learning approach to multi-label learning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• EFFICIENT ABSTRACTION SELECTION IN REINFORCEMENT LEARNING

Cited In (2)

• AI 2005: Advances in Artificial Intelligence
• Title not available (Why is that?)

Uses Software

• Scikit
• C4.5
• ML-KNN

This page was built for publication: Abstraction from demonstration for efficient reinforcement learning in high-dimensional domains

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