{"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/chain-of-thought-imitation-with-procedure","title":"Chain of Thought Imitation with Procedure Cloning","arxiv_id":"2205.10816","date":"2022-05-22","proceeding":null,"authors":["Mengjiao Yang","Dale Schuurmans","Pieter Abbeel","Ofir Nachum"],"abstract":"Imitation learning aims to extract high-performance policies from logged demonstrations of expert behavior. It is common to frame imitation learning as a supervised learning problem in which one fits a function approximator to the input-output mapping exhibited by the logged demonstrations (input observations to output actions). While the framing of imitation learning as a supervised input-output learning problem allows for applicability in a wide variety of settings, it is also an overly simplistic view of the problem in situations where the expert demonstrations provide much richer insight into expert behavior. For example, applications such as path navigation, robot manipulation, and strategy games acquire expert demonstrations via planning, search, or some other multi-step algorithm, revealing not just the output action to be imitated but also the procedure for how to determine this action. While these intermediate computations may use tools not available to the agent during inference (e.g., environment simulators), they are nevertheless informative as a way to explain an expert's mapping of state to actions. To properly leverage expert procedure information without relying on the privileged tools the expert may have used to perform the procedure, we propose procedure cloning, which applies supervised sequence prediction to imitate the series of expert computations. This way, procedure cloning learns not only what to do (i.e., the output action), but how and why to do it (i.e., the procedure). Through empirical analysis on navigation, simulated robotic manipulation, and game-playing environments, we show that imitating the intermediate computations of an expert's behavior enables procedure cloning to learn policies exhibiting significant generalization to unseen environment configurations, including those configurations for which running the expert's procedure directly is infeasible.","url_abs":"https://arxiv.org/abs/2205.10816v1","url_pdf":"https://arxiv.org/pdf/2205.10816v1.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":"chain-of-thought-imitation-with-procedure","repo_url":"https://github.com/google-research/google-research","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"imitation-learning","task_name":"Imitation Learning"},{"task_slug":"robot-manipulation","task_name":"Robot Manipulation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2205.10816","atlas_url":"https://app.syntology.ai/?focus=2205.10816","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":"2205.10816"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2205.10816\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2205.10816"},"call":"get_concepts_for_paper(arxiv_id=\"2205.10816\")"}],"by_repo":[{"repo":"google-research/google-research","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":24,"harvested_for":["1802.03268","2003.12022","2004.13912","2006.04678","2006.15055","2007.07314","2009.14794","2104.04657","2105.01237","2106.03314","2106.03760","2106.11905","2107.05768","2110.11346","2111.06888","2201.08896","2202.00512","2209.14881","2210.15458","2303.00732","2305.07011","2305.16381","2310.18893","2405.05349"],"harvested_for_calls":[{"arxiv_id":"1802.03268","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.03268"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.03268\")"},{"arxiv_id":"2003.12022","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.12022"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.12022\")"},{"arxiv_id":"2004.13912","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2004.13912"},"call":"get_harvested_code_for_paper(arxiv_id=\"2004.13912\")"},{"arxiv_id":"2006.04678","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.04678"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.04678\")"},{"arxiv_id":"2006.15055","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.15055"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.15055\")"},{"arxiv_id":"2007.07314","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.07314"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.07314\")"},{"arxiv_id":"2009.14794","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2009.14794"},"call":"get_harvested_code_for_paper(arxiv_id=\"2009.14794\")"},{"arxiv_id":"2104.04657","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.04657"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.04657\")"},{"arxiv_id":"2105.01237","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.01237"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.01237\")"},{"arxiv_id":"2106.03314","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03314"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03314\")"},{"arxiv_id":"2106.03760","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03760"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03760\")"},{"arxiv_id":"2106.11905","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.11905"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.11905\")"},{"arxiv_id":"2107.05768","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.05768"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.05768\")"},{"arxiv_id":"2110.11346","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.11346"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.11346\")"},{"arxiv_id":"2111.06888","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.06888"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.06888\")"},{"arxiv_id":"2201.08896","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.08896"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.08896\")"},{"arxiv_id":"2202.00512","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.00512"},"call":"get_harvested_code_for_paper(arxiv_id=\"2202.00512\")"},{"arxiv_id":"2209.14881","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2209.14881"},"call":"get_harvested_code_for_paper(arxiv_id=\"2209.14881\")"},{"arxiv_id":"2210.15458","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.15458"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.15458\")"},{"arxiv_id":"2303.00732","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2303.00732"},"call":"get_harvested_code_for_paper(arxiv_id=\"2303.00732\")"},{"arxiv_id":"2305.07011","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.07011"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.07011\")"},{"arxiv_id":"2305.16381","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.16381"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.16381\")"},{"arxiv_id":"2310.18893","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.18893"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.18893\")"},{"arxiv_id":"2405.05349","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.05349"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.05349\")"}]}],"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":"7af378e3cfec255a334a053f424af734eeebe89ab9814a8dfdf6bcfe34c6541e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}