{"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/adversarial-soft-advantage-fitting-imitation","title":"Adversarial Soft Advantage Fitting: Imitation Learning without Policy Optimization","arxiv_id":"2006.13258","date":"2020-06-23","proceeding":"NeurIPS 2020 12","authors":["Paul Barde","Julien Roy","Wonseok Jeon","Joelle Pineau","Christopher Pal","Derek Nowrouzezahrai"],"abstract":"Adversarial Imitation Learning alternates between learning a discriminator -- which tells apart expert's demonstrations from generated ones -- and a generator's policy to produce trajectories that can fool this discriminator. This alternated optimization is known to be delicate in practice since it compounds unstable adversarial training with brittle and sample-inefficient reinforcement learning. We propose to remove the burden of the policy optimization steps by leveraging a novel discriminator formulation. Specifically, our discriminator is explicitly conditioned on two policies: the one from the previous generator's iteration and a learnable policy. When optimized, this discriminator directly learns the optimal generator's policy. Consequently, our discriminator's update solves the generator's optimization problem for free: learning a policy that imitates the expert does not require an additional optimization loop. This formulation effectively cuts by half the implementation and computational burden of Adversarial Imitation Learning algorithms by removing the Reinforcement Learning phase altogether. We show on a variety of tasks that our simpler approach is competitive to prevalent Imitation Learning methods.","url_abs":"https://arxiv.org/abs/2006.13258v6","url_pdf":"https://arxiv.org/pdf/2006.13258v6.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":"adversarial-soft-advantage-fitting-imitation","repo_url":"https://github.com/ubisoft/ubisoft-la-forge-ASAF","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"adversarial-soft-advantage-fitting-imitation","repo_url":"https://github.com/leo27945875/ASAF-1","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"adversarial-soft-advantage-fitting-imitation","repo_url":"https://github.com/leo27945875/Adversarial-Soft-Advantage-Fitting-1","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"imitation-learning","task_name":"Imitation Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[{"method_slug":"adversarial-soft-advantage-fitting-asaf","method_name":"Adversarial Soft Advantage Fitting (ASAF)"},{"method_slug":"ail","method_name":"GAIL"}],"datasets_introduced":[],"methods_introduced":[{"slug":"asaf","name":"ASAF","full_name":"Adaptive Spline Activation Function"},{"slug":"adversarial-soft-advantage-fitting-asaf","name":"Adversarial Soft Advantage Fitting (ASAF)","full_name":"Adversarial Soft Advantage Fitting (ASAF)"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2006.13258","atlas_url":"https://app.syntology.ai/?focus=2006.13258","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":"2006.13258"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2006.13258\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2006.13258"},"call":"get_concepts_for_paper(arxiv_id=\"2006.13258\")"}],"by_repo":[{"repo":"ubisoft/ubisoft-la-forge-ASAF","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"leo27945875/ASAF-1","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"leo27945875/Adversarial-Soft-Advantage-Fitting-1","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":"509c483f436e0daa97b566a51e51a0855ab3817cc22b917eda2448e581e0b8c8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}