{"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":"/paper/a-greedy-approach-to-adapting-the-trace","title":"A Greedy Approach to Adapting the Trace Parameter for Temporal Difference Learning","arxiv_id":"1607.00446","date":"2016-07-02","proceeding":null,"authors":["Martha White","Adam White"],"abstract":"One of the main obstacles to broad application of reinforcement learning\nmethods is the parameter sensitivity of our core learning algorithms. In many\nlarge-scale applications, online computation and function approximation\nrepresent key strategies in scaling up reinforcement learning algorithms. In\nthis setting, we have effective and reasonably well understood algorithms for\nadapting the learning-rate parameter, online during learning. Such\nmeta-learning approaches can improve robustness of learning and enable\nspecialization to current task, improving learning speed. For\ntemporal-difference learning algorithms which we study here, there is yet\nanother parameter, $\\lambda$, that similarly impacts learning speed and\nstability in practice. Unfortunately, unlike the learning-rate parameter,\n$\\lambda$ parametrizes the objective function that temporal-difference methods\noptimize. Different choices of $\\lambda$ produce different fixed-point\nsolutions, and thus adapting $\\lambda$ online and characterizing the\noptimization is substantially more complex than adapting the learning-rate\nparameter. There are no meta-learning method for $\\lambda$ that can achieve (1)\nincremental updating, (2) compatibility with function approximation, and (3)\nmaintain stability of learning under both on and off-policy sampling. In this\npaper we contribute a novel objective function for optimizing $\\lambda$ as a\nfunction of state rather than time. We derive a new incremental, linear\ncomplexity $\\lambda$-adaption algorithm that does not require offline batch\nupdating or access to a model of the world, and present a suite of experiments\nillustrating the practicality of our new algorithm in three different settings.\nTaken together, our contributions represent a concrete step towards black-box\napplication of temporal-difference learning methods in real world problems.","url_abs":"http://arxiv.org/abs/1607.00446v2","url_pdf":"http://arxiv.org/pdf/1607.00446v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-greedy-approach-to-adapting-the-trace","repo_url":"https://github.com/PwnerHarry/META","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-greedy-approach-to-adapting-the-trace","repo_url":"https://github.com/PwnerHarry/MTA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"meta-learning","task_name":"Meta-Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1607.00446","atlas_url":"https://app.syntology.ai/?focus=1607.00446","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1607.00446"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1607.00446\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1607.00446"},"call":"get_concepts_for_paper(arxiv_id=\"1607.00446\")"}],"by_repo":[{"repo":"PwnerHarry/META","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1904.11439"],"harvested_for_calls":[{"arxiv_id":"1904.11439","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.11439"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.11439\")"}]},{"repo":"PwnerHarry/MTA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e3fab5103658fe5203968bf8cec7bdeb3322086c56ca44437a202b0682d033ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}