{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/eligibility-trace","slug":"eligibility-trace","name":"Eligibility Trace","full_name":"Eligibility Trace","full_name_withheld":false,"description_markdown":"An **Eligibility Trace** is a memory vector $\\textbf{z}\\_{t} \\in \\mathbb{R}^{d}$ that parallels the long-term weight vector $\\textbf{w}\\_{t} \\in \\mathbb{R}^{d}$. The idea is that when a component of $\\textbf{w}\\_{t}$ participates in producing an estimated value, the corresponding component of $\\textbf{z}\\_{t}$ is bumped up and then begins to fade away. Learning will then occur in that component of $\\textbf{w}\\_{t}$ if a nonzero TD error occurs before the trade falls back to zero. The trace-decay parameter $\\lambda \\in \\left[0, 1\\right]$ determines the rate at which the trace falls.\r\n\r\nIntuitively, they tackle the credit assignment problem by capturing both a frequency heuristic - states that are visited more often deserve more credit - and a recency heuristic - states that are visited more recently deserve more credit.\r\n\r\n$$E\\_{0}\\left(s\\right) = 0 $$\r\n$$E\\_{t}\\left(s\\right) = \\gamma\\lambda{E}\\_{t-1}\\left(s\\right) + \\textbf{1}\\left(S\\_{t} = s\\right) $$\r\n\r\nSource: Sutton and Barto, Reinforcement Learning, 2nd Edition","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Eligibility Traces","url":"/methods/category/eligibility-traces","pwc_aliases":[]}],"n_papers_tagged":11,"archive_num_papers":11,"papers_newest_first":[{"paper":null,"slug":"noise-based-reward-modulated-learning","title":"Noise-based reward-modulated learning","date":"2025-03-31","arxiv_id":"2503.23972","n_code_links":0,"syntology":null},{"paper":null,"slug":"predecessor-features","title":"Predecessor Features","date":"2022-06-01","arxiv_id":"2206.00303","n_code_links":0,"syntology":null},{"paper":"/paper/meta-learning-eligibility-traces-for-more","slug":"meta-learning-eligibility-traces-for-more","title":"META-Learning Eligibility Traces for More Sample Efficient Temporal Difference Learning","date":"2020-06-16","arxiv_id":"2006.08906","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-use-of-heuristics-for-accelerating","title":"Efficient Use of heuristics for accelerating XCS-based Policy Learning in Markov Games","date":"2020-05-26","arxiv_id":"2005.12553","n_code_links":0,"syntology":null},{"paper":null,"slug":"gradient-q-a-unified-algorithm-with-function","title":"Gradient Q$(σ, λ)$: A Unified Algorithm with Function Approximation for Reinforcement Learning","date":"2019-09-06","arxiv_id":"1909.02877","n_code_links":0,"syntology":null},{"paper":null,"slug":"gap-increasing-policy-evaluation-for","title":"Gap-Increasing Policy Evaluation for Efficient and Noise-Tolerant Reinforcement Learning","date":"2019-06-18","arxiv_id":"1906.07586","n_code_links":0,"syntology":null},{"paper":"/paper/faster-and-more-accurate-learning-with-meta","slug":"faster-and-more-accurate-learning-with-meta","title":"META-Learning State-based Eligibility Traces for More Sample-Efficient Policy Evaluation","date":"2019-04-25","arxiv_id":"1904.11439","n_code_links":2,"syntology":{"ran":3,"of":14,"n_ran_checked":3,"n_instrument":0,"unverified":11,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified","official":{"repos":["PwnerHarry/META","PwnerHarry/MTA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":11,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"metatrace-online-step-size-tuning-by-meta","title":"Metatrace Actor-Critic: Online Step-size Tuning by Meta-gradient Descent for Reinforcement Learning Control","date":"2018-05-10","arxiv_id":"1805.04514","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-approach-for-multi-step-temporal","title":"A Unified Approach for Multi-step Temporal-Difference Learning with Eligibility Traces in Reinforcement Learning","date":"2018-02-09","arxiv_id":"1802.03171","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-forward-model-at-purkinje-cell-synapses","title":"A forward model at Purkinje cell synapses facilitates cerebellar anticipatory control","date":"2016-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"q-with-off-policy-corrections","title":"Q($λ$) with Off-Policy Corrections","date":"2016-02-16","arxiv_id":"1602.04951","n_code_links":0,"syntology":null}],"papers_shown":11,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":11,"with_a_code_link":2,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":11,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/eligibility-trace/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/eligibility-trace/papers/ran/1","json":"/method/eligibility-trace/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":6},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":6},{"task":"/task/meta-learning","name":"Meta-Learning","papers":3},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":2},{"task":"/task/atari-games","name":"Atari Games","papers":1},{"task":"/task/q-learning","name":"Q-Learning","papers":1},{"task":null,"name":"counterfactual","papers":1}],"tasks_shown":7,"n_tasks":7,"usage_by_year":[{"year":"2016","papers":2},{"year":"2018","papers":2},{"year":"2019","papers":3},{"year":"2020","papers":2},{"year":"2022","papers":1},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/eligibility-trace"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Eligibility%20Trace","read_at":"2026-10-05T00:55:32+00:00","query":"Eligibility Trace","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Eligibility Trace' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["Selective Eligibility Traces (S-trace)","TRACE","TRACE","TRACE","TRACE","TRACE","TRACE","Trace"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"22b3c17f01475dcdaec03aa229d5cabb471ec9f75f024395e93f1f798537c0aa","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}