{"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/learning-actionable-representations-with-goal","title":"Learning Actionable Representations with Goal-Conditioned Policies","arxiv_id":"1811.07819","date":"2018-11-19","proceeding":null,"authors":["Dibya Ghosh","Abhishek Gupta","Sergey Levine"],"abstract":"Representation learning is a central challenge across a range of machine\nlearning areas. In reinforcement learning, effective and functional\nrepresentations have the potential to tremendously accelerate learning progress\nand solve more challenging problems. Most prior work on representation learning\nhas focused on generative approaches, learning representations that capture all\nunderlying factors of variation in the observation space in a more disentangled\nor well-ordered manner. In this paper, we instead aim to learn functionally\nsalient representations: representations that are not necessarily complete in\nterms of capturing all factors of variation in the observation space, but\nrather aim to capture those factors of variation that are important for\ndecision making -- that are \"actionable.\" These representations are aware of\nthe dynamics of the environment, and capture only the elements of the\nobservation that are necessary for decision making rather than all factors of\nvariation, without explicit reconstruction of the observation. We show how\nthese representations can be useful to improve exploration for sparse reward\nproblems, to enable long horizon hierarchical reinforcement learning, and as a\nstate representation for learning policies for downstream tasks. We evaluate\nour method on a number of simulated environments, and compare it to prior\nmethods for representation learning, exploration, and hierarchical\nreinforcement learning.","url_abs":"http://arxiv.org/abs/1811.07819v2","url_pdf":"http://arxiv.org/pdf/1811.07819v2.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":"learning-actionable-representations-with-goal","repo_url":"https://github.com/elitalobo/Hierarchical-RL-Algorithms","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"},{"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":"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/1811.07819","atlas_url":"https://app.syntology.ai/?focus=1811.07819","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":"1811.07819"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.07819\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.07819"},"call":"get_concepts_for_paper(arxiv_id=\"1811.07819\")"}],"by_repo":[{"repo":"elitalobo/Hierarchical-RL-Algorithms","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1609.05140"],"harvested_for_calls":[{"arxiv_id":"1609.05140","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1609.05140"},"call":"get_harvested_code_for_paper(arxiv_id=\"1609.05140\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"4b2ee282aab1ea610178db353196f7fecfe923e91ea7a2e70853b12a932f1933","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}