Papers › META-Learning State-based Eligibility Traces for More Sample-Efficient Policy Evaluation

META-Learning State-based Eligibility Traces for More Sample-Efficient Policy Evaluation

25 Apr 2019arXiv:1904.11439archive 2025-07-28

Mingde Zhao, Sitao Luan, Ian Porada, Xiao-Wen Chang, Doina Precup

Temporal-Difference (TD) learning is a standard and very successful reinforcement learning approach, at the core of both algorithms that learn the value of a given policy, as well as algorithms which learn how to improve policies. TD-learning with eligibility traces provides a way to boost sample efficiency by temporal credit assignment, i.e. deciding which portion of a reward should be assigned to predecessor states that occurred at different previous times, controlled by a parameter λ. However, tuning this parameter can be time-consuming, and not tuning it can lead to inefficient learning. For better sample efficiency of TD-learning, we propose a meta-learning method for adjusting the eligibility trace parameter, in a state-dependent manner. The adaptation is achieved with the help of auxiliary learners that learn distributional information about the update targets online, incurring roughly the same computational complexity per step as the usual value learner. Our approach can be used both in on-policy and off-policy learning. We prove that, under some assumptions, the proposed method improves the overall quality of the update targets, by minimizing the overall target error. This method can be viewed as a plugin to assist prediction with function approximation by meta-learning feature (observation)-based λ online, or even in the control case to assist policy improvement. Our empirical evaluation demonstrates significant performance improvements, as well as improved robustness of the proposed algorithm to learning rate variation.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1904.11439")

Code

Syntology Ran 0 of 14 code samples harvested from 1 repository linked to this paper; 14 have no recorded run.

By repository: official repository: 14 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

PwnerHarry/META officialmentioned in papermentioned on GitHubMIT report
PwnerHarry/MTA officialmentioned in papermentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 0 ran; 0 honoured the contract we drafted; 14 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

14unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from PwnerHarry/META. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

AC PwnerHarry/META/AC.py official repository unverified MIT (permissive) · cfb79e41dca854fb · report
MC PwnerHarry/META/MC.py official repository unverified MIT (permissive) · 33e84958b7ee29a9 · report
MTA PwnerHarry/META/mta.py official repository unverified MIT (permissive) · b85342e702c3deb1 · report
decide PwnerHarry/META/utils.py official repository unverified MIT (permissive) · 44fe7c9390bf642b · report
eval_AC PwnerHarry/META/AC.py official repository unverified MIT (permissive) · 45ba36007fd82d86 · report
eval_AC_per_run PwnerHarry/META/AC.py official repository unverified MIT (permissive) · 7fe8b90f604bea21 · report
eval_MTA PwnerHarry/META/mta.py official repository unverified MIT (permissive) · cb2af316670acb7a · report
eval_MTA_per_run PwnerHarry/META/mta.py official repository unverified MIT (permissive) · 7aa28e986811a6c4 · report
eval_greedy PwnerHarry/META/greedy.py official repository unverified MIT (permissive) · 08642331ca69bfe7 · report
eval_greedy_per_run PwnerHarry/META/greedy.py official repository unverified MIT (permissive) · 0dc689c2e98dd889 · report
greedy PwnerHarry/META/greedy.py official repository unverified MIT (permissive) · 5a96948f392f2d15 · report
gtd PwnerHarry/META/BACKUPS/methods.py official repository unverified MIT (permissive) · 5f8a9b449cd0889e · report
islambda PwnerHarry/META/BACKUPS/methods.py official repository unverified MIT (permissive) · a17914a87ebbee6c · report
monte_carlo PwnerHarry/META/BACKUPS/methods.py official repository unverified MIT (permissive) · 32214dc30cceff52 · report

Tasks

Meta-LearningReinforcement Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Eligibility Trace

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