{"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/hierarchical-reinforcement-learning-via","title":"Hierarchical Reinforcement Learning via Advantage-Weighted Information Maximization","arxiv_id":"1901.01365","date":"2019-01-05","proceeding":"ICLR 2019 5","authors":["Takayuki Osa","Voot Tangkaratt","Masashi Sugiyama"],"abstract":"Real-world tasks are often highly structured. Hierarchical reinforcement\nlearning (HRL) has attracted research interest as an approach for leveraging\nthe hierarchical structure of a given task in reinforcement learning (RL).\nHowever, identifying the hierarchical policy structure that enhances the\nperformance of RL is not a trivial task. In this paper, we propose an HRL\nmethod that learns a latent variable of a hierarchical policy using mutual\ninformation maximization. Our approach can be interpreted as a way to learn a\ndiscrete and latent representation of the state-action space. To learn option\npolicies that correspond to modes of the advantage function, we introduce\nadvantage-weighted importance sampling. In our HRL method, the gating policy\nlearns to select option policies based on an option-value function, and these\noption policies are optimized based on the deterministic policy gradient\nmethod. This framework is derived by leveraging the analogy between a\nmonolithic policy in standard RL and a hierarchical policy in HRL by using a\ndeterministic option policy. Experimental results indicate that our HRL\napproach can learn a diversity of options and that it can enhance the\nperformance of RL in continuous control tasks.","url_abs":"http://arxiv.org/abs/1901.01365v2","url_pdf":"http://arxiv.org/pdf/1901.01365v2.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":"hierarchical-reinforcement-learning-via","repo_url":"https://github.com/TakaOsa/adInfoHRL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"diversity","task_name":"Diversity"},{"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":"continuous-control","task_name":"continuous-control"},{"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":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"TakaOsa/adInfoHRL","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":"8ce1c4fe778eca2c25e877db27fc827ccad496a2d511067bf37511e1a1bdd9b2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}