{"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/hybrid-reward-architecture-for-reinforcement","title":"Hybrid Reward Architecture for Reinforcement Learning","arxiv_id":"1706.04208","date":"2017-06-13","proceeding":"NeurIPS 2017 12","authors":["Harm van Seijen","Mehdi Fatemi","Joshua Romoff","Romain Laroche","Tavian Barnes","Jeffrey Tsang"],"abstract":"One of the main challenges in reinforcement learning (RL) is generalisation.\nIn typical deep RL methods this is achieved by approximating the optimal value\nfunction with a low-dimensional representation using a deep network. While this\napproach works well in many domains, in domains where the optimal value\nfunction cannot easily be reduced to a low-dimensional representation, learning\ncan be very slow and unstable. This paper contributes towards tackling such\nchallenging domains, by proposing a new method, called Hybrid Reward\nArchitecture (HRA). HRA takes as input a decomposed reward function and learns\na separate value function for each component reward function. Because each\ncomponent typically only depends on a subset of all features, the corresponding\nvalue function can be approximated more easily by a low-dimensional\nrepresentation, enabling more effective learning. We demonstrate HRA on a\ntoy-problem and the Atari game Ms. Pac-Man, where HRA achieves above-human\nperformance.","url_abs":"http://arxiv.org/abs/1706.04208v2","url_pdf":"http://arxiv.org/pdf/1706.04208v2.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":"hybrid-reward-architecture-for-reinforcement","repo_url":"https://github.com/KhenNguyn/DoAn3-MachineLearning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.04208","atlas_url":"https://app.syntology.ai/?focus=1706.04208","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":"1706.04208"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.04208\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.04208"},"call":"get_concepts_for_paper(arxiv_id=\"1706.04208\")"}],"by_repo":[{"repo":"KhenNguyn/DoAn3-MachineLearning","kind":"listed","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":"ab657823e807a789b25f575b9d4a55adb22863e76943d40ebf759b4b0701f813","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}