{"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/rail-risk-averse-imitation-learning","title":"RAIL: Risk-Averse Imitation Learning","arxiv_id":"1707.06658","date":"2017-07-20","proceeding":null,"authors":["Anirban Santara","Abhishek Naik","Balaraman Ravindran","Dipankar Das","Dheevatsa Mudigere","Sasikanth Avancha","Bharat Kaul"],"abstract":"Imitation learning algorithms learn viable policies by imitating an expert's\nbehavior when reward signals are not available. Generative Adversarial\nImitation Learning (GAIL) is a state-of-the-art algorithm for learning policies\nwhen the expert's behavior is available as a fixed set of trajectories. We\nevaluate in terms of the expert's cost function and observe that the\ndistribution of trajectory-costs is often more heavy-tailed for GAIL-agents\nthan the expert at a number of benchmark continuous-control tasks. Thus,\nhigh-cost trajectories, corresponding to tail-end events of catastrophic\nfailure, are more likely to be encountered by the GAIL-agents than the expert.\nThis makes the reliability of GAIL-agents questionable when it comes to\ndeployment in risk-sensitive applications like robotic surgery and autonomous\ndriving. In this work, we aim to minimize the occurrence of tail-end events by\nminimizing tail risk within the GAIL framework. We quantify tail risk by the\nConditional-Value-at-Risk (CVaR) of trajectories and develop the Risk-Averse\nImitation Learning (RAIL) algorithm. We observe that the policies learned with\nRAIL show lower tail-end risk than those of vanilla GAIL. Thus the proposed\nRAIL algorithm appears as a potent alternative to GAIL for improved reliability\nin risk-sensitive applications.","url_abs":"http://arxiv.org/abs/1707.06658v4","url_pdf":"http://arxiv.org/pdf/1707.06658v4.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":"rail-risk-averse-imitation-learning","repo_url":"https://github.com/Santara/RAIL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"autonomous-driving","task_name":"Autonomous Driving"},{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"imitation-learning","task_name":"Imitation Learning"},{"task_slug":"continuous-control","task_name":"continuous-control"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1707.06658","atlas_url":"https://app.syntology.ai/?focus=1707.06658","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":"1707.06658"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1707.06658\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1707.06658"},"call":"get_concepts_for_paper(arxiv_id=\"1707.06658\")"}],"by_repo":[{"repo":"Santara/RAIL","kind":"listed","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":"cd4b4a87a67bb867345ce5827717f8c33f7d729e0ff2245326e2da3ea8e06b0e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}