{"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/transfer-of-deep-reactive-policies-for-mdp","title":"Transfer of Deep Reactive Policies for MDP Planning","arxiv_id":"1810.11488","date":"2018-10-26","proceeding":"NeurIPS 2018 12","authors":["Aniket Bajpai","Sankalp Garg","Mausam"],"abstract":"Domain-independent probabilistic planners input an MDP description in a\nfactored representation language such as PPDDL or RDDL, and exploit the\nspecifics of the representation for faster planning. Traditional algorithms\noperate on each problem instance independently, and good methods for\ntransferring experience from policies of other instances of a domain to a new\ninstance do not exist. Recently, researchers have begun exploring the use of\ndeep reactive policies, trained via deep reinforcement learning (RL), for MDP\nplanning domains. One advantage of deep reactive policies is that they are more\namenable to transfer learning.\n  In this paper, we present the first domain-independent transfer algorithm for\nMDP planning domains expressed in an RDDL representation. Our architecture\nexploits the symbolic state configuration and transition function of the domain\n(available via RDDL) to learn a shared embedding space for states and\nstate-action pairs for all problem instances of a domain. We then learn an RL\nagent in the embedding space, making a near zero-shot transfer possible, i.e.,\nwithout much training on the new instance, and without using the domain\nsimulator at all. Experiments on three different benchmark domains underscore\nthe value of our transfer algorithm. Compared against planning from scratch,\nand a state-of-the-art RL transfer algorithm, our transfer solution has\nsignificantly superior learning curves.","url_abs":"http://arxiv.org/abs/1810.11488v1","url_pdf":"http://arxiv.org/pdf/1810.11488v1.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":"transfer-of-deep-reactive-policies-for-mdp","repo_url":"https://github.com/dair-iitd/torpido","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.11488","atlas_url":"https://app.syntology.ai/?focus=1810.11488","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":"1810.11488"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.11488\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.11488"},"call":"get_concepts_for_paper(arxiv_id=\"1810.11488\")"}],"by_repo":[{"repo":"dair-iitd/torpido","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":"56a25a18b52c79b109a07a599b9e3eb5ac71537d1f8c0b9e72e0a02fc1c0a68c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}