Algebraic results and bottom-up algorithm for policies generalization in reinforcement learning using concept lattices
From MaRDI portal
(Redirected from Publication:1003553)
Recommendations
- Algebraic reinforcement learning. Hypothesis induction for relational reinforcement learning using term generalization.
- Learning generalized policies from planning examples using concept languages
- Towards min max generalization in reinforcement learning
- scientific article; zbMATH DE number 67800
- A generalization error for Q-learning
Cites work
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 1560499 (Why is no real title available?)
- Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
- Equivalence notions and model minimization in Markov decision processes
- Relational reinforcement learning
- \({\mathcal Q}\)-learning
Cited in
(4)- Algebraic reinforcement learning. Hypothesis induction for relational reinforcement learning using term generalization.
- Learning generalized policies from planning examples using concept languages
- A new algebraic structure for formal concept analysis
- scientific article; zbMATH DE number 67800 (Why is no real title available?)
This page was built for publication: Algebraic results and bottom-up algorithm for policies generalization in reinforcement learning using concept lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003553)
