{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/exploring-td-error-as-a-heuristic-for","title":"Exploring TD error as a heuristic for $σ$ selection in Q($σ$, $λ$)","arxiv_id":"1912.10316","date":"2019-12-21","proceeding":null,"authors":["Abhishek Nan"],"abstract":"In the landscape of TD algorithms, the Q($\\sigma$, $\\lambda$) algorithm is an algorithm with the ability to perform a multistep backup in an online manner while also successfully unifying the concepts of sampling with using the expectation across all actions for a state. $\\sigma \\in [0, 1]$ indicates the extent to which sampling is used. Selecting the value of {\\sigma} can be based on characteristics of the current state rather than having a constant value or being time based. This report explores the viability of such a TD-error based scheme.","url_abs":"https://arxiv.org/abs/1912.10316v1","url_pdf":"https://arxiv.org/pdf/1912.10316v1.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":"exploring-td-error-as-a-heuristic-for","repo_url":"https://github.com/abnan/CMPUT_609_Project","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}