Least-squares temporal difference with expected eligibility traces

Abstract Temporal Difference (TD) and Least-Squares Temporal Difference (LSTD) are related methods to estimate the value function of a Markov Decision Process (MDP). While TD is a direct method using local data to update the value function estimate, LSTD is a Bellman projected equation method using full data to compute a one-time estimate. TD( $$\lambda $$ ) and LSTD( $$\lambda $$ ) extend TD and LSTD with eligibility traces. While estimating the value function, TD( $$\lambda $$ ) and LSTD( $$\lambda $$ ) use actual histories of features as traces. Recently, expected eligibility traces have been proposed for TD( $$\lambda $$ ) to not only include actual histories, but also all potential histories of features that could have occurred based on the model or the available data. While this idea can account for non-linear feature architectures, here we limit ourselves to linear feature architectures with full data updates in the context of LSTD. We show that, in striking contrast with the direct versions, an extension of LSTD to include the theoretical expected eligibility traces is equivalent to LSTD without eligibility traces (LSTD(0)). We obtain a similar result if we consider mixed eligibility traces; a combination of expected eligibility traces and ordinary eligibility traces. In fact, we show that LSTD with theoretical mixed eligibility traces is equivalent to LSTD( $$\lambda ^\prime $$ ) for a given $$\lambda ^\prime $$ that captures both the decay of the eligibility trace, as well as the balance between the expected eligibility trace and the ordinary trace. Furthermore, we consider alternative methods LSET( $$\lambda $$ ) and LSET( $$\eta $$ , $$\lambda $$ ), which rely on the empirical means of the eligibility traces rather than the theoretical expected eligibility traces, and show that their value estimates converges to those of LSTD(0) and LSTD( $$\lambda ^\prime $$ ).

Authors

Institutions

Publication Details

Journal
Machine Learning
Published
2025-11-07
DOI
https://doi.org/10.1007/s10994-025-06912-z
Primary Topic
Bayesian Modeling and Causal Inference
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Least-squares temporal difference with expected eligibility traces

Duarte Antunes, Roy van Zuijlen
Machine Learning
Bayesian Modeling and Causal Inference
article

Least-squares temporal difference with expected eligibility traces

Duarte Antunes, Roy van Zuijlen
article en

Abstract

Abstract Temporal Difference (TD) and Least-Squares Temporal Difference (LSTD) are related methods to estimate the value function of a Markov Decision Process (MDP). While TD is a direct method using local data to update the value function estimate, LSTD is a Bellman projected equation method using full data to compute a one-time estimate. TD( $$\lambda $$ ) and LSTD( $$\lambda $$ ) extend TD and LSTD with eligibility traces. While estimating the value function, TD( $$\lambda $$ ) and LSTD( $$\lambda $$ ) use actual histories of features as traces. Recently, expected eligibility traces have been proposed for TD( $$\lambda $$ ) to not only include actual histories, but also all potential histories of features that could have occurred based on the model or the available data. While this idea can account for non-linear feature architectures, here we limit ourselves to linear feature architectures with full data updates in the context of LSTD. We show that, in striking contrast with the direct versions, an extension of LSTD to include the theoretical expected eligibility traces is equivalent to LSTD without eligibility traces (LSTD(0)). We obtain a similar result if we consider mixed eligibility traces; a combination of expected eligibility traces and ordinary eligibility traces. In fact, we show that LSTD with theoretical mixed eligibility traces is equivalent to LSTD( $$\lambda ^\prime $$ ) for a given $$\lambda ^\prime $$ that captures both the decay of the eligibility trace, as well as the balance between the expected eligibility trace and the ordinary trace. Furthermore, we consider alternative methods LSET( $$\lambda $$ ) and LSET( $$\eta $$ , $$\lambda $$ ), which rely on the empirical means of the eligibility traces rather than the theoretical expected eligibility traces, and show that their value estimates converges to those of LSTD(0) and LSTD( $$\lambda ^\prime $$ ).

Machine LearningVol. 114(12)
Eindhoven University of Technology (NL)
Openalex Percentile: Top 83%
Bayesian Modeling and Causal Inference
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Least-squares temporal difference with expected eligibility traces — Duarte Antunes, Roy van Zuijlen · Machine Learning (2025) | TGRS Research Map | TGRS