Methods › Reinforcement Learning › Eligibility Traces › Replacing Eligibility Trace
Replacing Eligibility Trace
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
In a Replacing Eligibility Trace, each time the state is revisited, the trace is reset to $1$ regardless of the presence of a prior trace.. For the memory vector eₜ ∈ℝᵇ ≥0:
𝐞₀ = 0
eₜ = γλeₜ₋₁(s) if s ≠sₜ
eₜ = 1 if s = sₜ
They can be seen as crude approximation to dutch traces, which have largely superseded them as they perform better than replacing traces and have a clearer theoretical basis. Accumulating traces remain of interest for nonlinear function approximations where dutch traces are not available.
Source: Sutton and Barto, Reinforcement Learning, 2nd Edition
Papers archive 2025-07-28
The archive tags no paper with this method.
Tasks archive 2025-07-28
The archive attaches no task to a paper tagged with this method.
Usage over time archive 2025-07-28
No dated papers to chart.
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections