Automatic complexity reduction in reinforcement learning
From MaRDI portal
Recommendations
- Abstraction from demonstration for efficient reinforcement learning in high-dimensional domains
- Dimension reduction and its application to model-based exploration in continuous spaces
- AI 2005: Advances in Artificial Intelligence
- scientific article; zbMATH DE number 2044701
- The effect of representation and knowledge on goal-directed exploration with reinforcement-learning algorithms
Cites work
- Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
- scientific article; zbMATH DE number 5957399 (Why is no real title available?)
- scientific article; zbMATH DE number 5957492 (Why is no real title available?)
- scientific article; zbMATH DE number 1560499 (Why is no real title available?)
- scientific article; zbMATH DE number 1931843 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Learning recursive control programs from problem solving
- Network flows. Theory, algorithms, and applications.
- Recent advances in hierarchical reinforcement learning
Cited in
(6)- Model-based reinforcement learning with dimension reduction
- Automatic move pruning for single-agent search
- scientific article; zbMATH DE number 2079525 (Why is no real title available?)
- Abstraction from demonstration for efficient reinforcement learning in high-dimensional domains
- Automated Reinforcement Learning (AutoRL): A Survey and Open Problems
- Low-Rank Representation of Reinforcement Learning Policies
This page was built for publication: Automatic complexity reduction in reinforcement learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224337)
