TD(λ) learning without eligibility traces: a theoretical analysis

DOI10.1080/095281399146562zbMath1069.68575OpenAlexW2009384474MaRDI QIDQ4421245

Paweł Cichosz

Publication date: 2 November 2003

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/095281399146562

zbMATH Keywords

Reinforcement LearningEligibility TracesTemporal Differences

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Practical issues in temporal difference learning
• \({\mathcal Q}\)-learning
• On the Convergence of Stochastic Iterative Dynamic Programming Algorithms

This page was built for publication: TD(λ) learning without eligibility traces: a theoretical analysis