{"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/guided-cost-learning-deep-inverse-optimal","title":"Guided Cost Learning: Deep Inverse Optimal Control via Policy Optimization","arxiv_id":"1603.00448","date":"2016-03-01","proceeding":null,"authors":["Chelsea Finn","Sergey Levine","Pieter Abbeel"],"abstract":"Reinforcement learning can acquire complex behaviors from high-level\nspecifications. However, defining a cost function that can be optimized\neffectively and encodes the correct task is challenging in practice. We explore\nhow inverse optimal control (IOC) can be used to learn behaviors from\ndemonstrations, with applications to torque control of high-dimensional robotic\nsystems. Our method addresses two key challenges in inverse optimal control:\nfirst, the need for informative features and effective regularization to impose\nstructure on the cost, and second, the difficulty of learning the cost function\nunder unknown dynamics for high-dimensional continuous systems. To address the\nformer challenge, we present an algorithm capable of learning arbitrary\nnonlinear cost functions, such as neural networks, without meticulous feature\nengineering. To address the latter challenge, we formulate an efficient\nsample-based approximation for MaxEnt IOC. We evaluate our method on a series\nof simulated tasks and real-world robotic manipulation problems, demonstrating\nsubstantial improvement over prior methods both in terms of task complexity and\nsample efficiency.","url_abs":"http://arxiv.org/abs/1603.00448v3","url_pdf":"http://arxiv.org/pdf/1603.00448v3.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":"guided-cost-learning-deep-inverse-optimal","repo_url":"https://github.com/Alina-Samokhina/guided_cost_RL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"guided-cost-learning-deep-inverse-optimal","repo_url":"https://github.com/ninawie/guided-cost-learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"guided-cost-learning-deep-inverse-optimal","repo_url":"https://github.com/nishantkr18/guided-cost-learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"guided-cost-learning-deep-inverse-optimal","repo_url":"https://github.com/opendilab/DI-engine","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"feature-engineering","task_name":"Feature Engineering"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1603.00448","atlas_url":"https://app.syntology.ai/?focus=1603.00448","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":"1603.00448"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1603.00448\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1603.00448"},"call":"get_concepts_for_paper(arxiv_id=\"1603.00448\")"}],"by_repo":[{"repo":"Alina-Samokhina/guided_cost_RL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ninawie/guided-cost-learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"nishantkr18/guided-cost-learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"opendilab/DI-engine","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1707.01495","1901.02860","2106.01345","2304.12824"],"harvested_for_calls":[{"arxiv_id":"1707.01495","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1707.01495"},"call":"get_harvested_code_for_paper(arxiv_id=\"1707.01495\")"},{"arxiv_id":"1901.02860","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1901.02860"},"call":"get_harvested_code_for_paper(arxiv_id=\"1901.02860\")"},{"arxiv_id":"2106.01345","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.01345"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.01345\")"},{"arxiv_id":"2304.12824","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2304.12824"},"call":"get_harvested_code_for_paper(arxiv_id=\"2304.12824\")"}]}],"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":"bc19c50a4461b99b0c58265b7079b44667eec4c530b9e6735d3829900c94a978","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}