{"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/temporal-regularization-for-markov-decision","title":"Temporal Regularization for Markov Decision Process","arxiv_id":null,"date":"2018-12-01","proceeding":"NeurIPS 2018 12","authors":["Pierre Thodoroff","Audrey Durand","Joelle Pineau","Doina Precup"],"abstract":"Several applications of Reinforcement Learning suffer from instability due to high\nvariance. This is especially prevalent in high dimensional domains. Regularization\nis a commonly used technique in machine learning to reduce variance, at the cost\nof introducing some bias. Most existing regularization techniques focus on spatial\n(perceptual) regularization. Yet in reinforcement learning, due to the nature of the\nBellman equation, there is an opportunity to also exploit temporal regularization\nbased on smoothness in value estimates over trajectories. This paper explores a\nclass of methods for temporal regularization. We formally characterize the bias\ninduced by this technique using Markov chain concepts. We illustrate the various\ncharacteristics of temporal regularization via a sequence of simple discrete and\ncontinuous MDPs, and show that the technique provides improvement even in\nhigh-dimensional Atari games.","url_abs":"http://papers.nips.cc/paper/7449-temporal-regularization-for-markov-decision-process","url_pdf":"http://papers.nips.cc/paper/7449-temporal-regularization-for-markov-decision-process.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":"temporal-regularization-for-markov-decision","repo_url":"https://github.com/pierthodo/temporal_regularization","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"atari-games","task_name":"Atari Games"},{"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":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"pierthodo/temporal_regularization","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"6971a90561c8d06252f5c4c87e9e85280554c9c3fdae4bcc4b94f07a9507bde7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}