{"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/feudal-networks-for-hierarchical","title":"FeUdal Networks for Hierarchical Reinforcement Learning","arxiv_id":"1703.01161","date":"2017-03-03","proceeding":"ICML 2017 8","authors":["Alexander Sasha Vezhnevets","Simon Osindero","Tom Schaul","Nicolas Heess","Max Jaderberg","David Silver","Koray Kavukcuoglu"],"abstract":"We introduce FeUdal Networks (FuNs): a novel architecture for hierarchical\nreinforcement learning. Our approach is inspired by the feudal reinforcement\nlearning proposal of Dayan and Hinton, and gains power and efficacy by\ndecoupling end-to-end learning across multiple levels -- allowing it to utilise\ndifferent resolutions of time. Our framework employs a Manager module and a\nWorker module. The Manager operates at a lower temporal resolution and sets\nabstract goals which are conveyed to and enacted by the Worker. The Worker\ngenerates primitive actions at every tick of the environment. The decoupled\nstructure of FuN conveys several benefits -- in addition to facilitating very\nlong timescale credit assignment it also encourages the emergence of\nsub-policies associated with different goals set by the Manager. These\nproperties allow FuN to dramatically outperform a strong baseline agent on\ntasks that involve long-term credit assignment or memorisation. We demonstrate\nthe performance of our proposed system on a range of tasks from the ATARI suite\nand also from a 3D DeepMind Lab environment.","url_abs":"http://arxiv.org/abs/1703.01161v2","url_pdf":"http://arxiv.org/pdf/1703.01161v2.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":"feudal-networks-for-hierarchical","repo_url":"https://github.com/4rChon/NL-FuN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"hierarchical-reinforcement-learning","task_name":"Hierarchical Reinforcement 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":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.01161","atlas_url":"https://app.syntology.ai/?focus=1703.01161","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":"1703.01161"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.01161\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.01161"},"call":"get_concepts_for_paper(arxiv_id=\"1703.01161\")"}],"by_repo":[{"repo":"4rChon/NL-FuN","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":"1093da85ed954aaf45655b0ef6799be16cd44580132f38ac4aade059f1c9b21b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}