scientific article; zbMATH DE number 67800

MaRDI QIDQ4013741zbMATH OpenFDO

Authors

Publication date 27 September 1992

zbMATH Keywords

delayed reinforcement learninginput generalization problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Recommendations

• Simple statistical gradient-following algorithms for connectionist reinforcement learning
• Learning action probabilities from delayed reinforcement
• A tutorial survey of reinforcement learning
• Algebraic results and bottom-up algorithm for policies generalization in reinforcement learning using concept lattices
• scientific article; zbMATH DE number 1356140

Cited in

(9)

• Embedding connectionist autonomous agents in time: The `road sign problem'
• \({\mathcal Q}\)-learning
• A tutorial survey of reinforcement learning
• Stochastic dynamic programming with factored representations
• Abstraction from demonstration for efficient reinforcement learning in high-dimensional domains
• Abstraction and approximate decision-theoretic planning.
• Algebraic results and bottom-up algorithm for policies generalization in reinforcement learning using concept lattices
• Reinforcement learning of non-Markov decision processes
• Solving factored MDPs using non-homogeneous partitions

This page was built for publication:

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