True online temporal-difference learning

MaRDI QIDQ2834469zbMATH OpenFDO

Authors Harm van Seijen, A. Rupam Mahmood, Patrick M. Pilarski, Marlos C. Machado, Richard S. Sutton

Publication date 22 November 2016

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.04087, http://jmlr.csail.mit.edu/papers/v17/15-599.html

zbMATH Keywords

eligibility tracesforward-view equivalencetemporal-difference learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Recommendations

• Linear least-squares algorithms for temporal difference learning
• Linear least-squares algorithms for temporal difference learning
• TD(λ) learning without eligibility traces: a theoretical analysis
• A finite time analysis of temporal difference learning with linear function approximation
• On the worst-case analysis of temporal-difference learning algorithms

Cited in

(4)

• Fast online \(Q(\lambda)\)
• Evolutionary function approximation for reinforcement learning
• AN ANALYSIS OF EXPERIENCE REPLAY IN TEMPORAL DIFFERENCE LEARNING
• Learning‐based T‐sHDP() for optimal control of a class of nonlinear discrete‐time systems

This page was built for publication: True online temporal-difference learning

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