{"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":"/task/imitation-learning","name":"Imitation Learning","slug":"imitation-learning","description_markdown":"**Imitation Learning** is a framework for learning a behavior policy from demonstrations. Usually, demonstrations are presented in the form of state-action trajectories, with each pair indicating the action to take at the state being visited. In order to learn the behavior policy, the demonstrated actions are usually utilized in two ways. The first, known as Behavior Cloning (BC), treats the action as the target label for each state, and then learns a generalized mapping from states to actions in a supervised manner. Another way, known as Inverse Reinforcement Learning (IRL), views the demonstrated actions as a sequence of decisions, and aims at finding a reward/cost function under which the demonstrated decisions are optimal. \r\n\r\nFinally, a newer methodology, Inverse Q-Learning aims at directly learning Q-functions from expert data, implicitly representing rewards, under which the optimal policy can be given as a Boltzmann distribution similar to soft Q-learning\r\n\r\n<span class=\"description-source\">Source: [Learning to Imitate ](https://ai.stanford.edu/blog/learning-to-imitate)</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":2122,"papers_with_code":691,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":21,"subtasks":1,"parent_tasks":1},"benchmarks":[],"datasets":[{"url":"/dataset/carla","name":"CARLA","full_name":"Car Learning to Act","num_papers_in_archive":1345},{"url":"/dataset/airsim","name":"AirSim","full_name":"","num_papers_in_archive":285},{"url":"/dataset/ai2-thor","name":"AI2-THOR","full_name":"AI2-THOR","num_papers_in_archive":243},{"url":"/dataset/rlbench","name":"RLBench","full_name":"","num_papers_in_archive":167},{"url":"/dataset/torcs","name":"TORCS","full_name":"The Open Racing Car Simulator","num_papers_in_archive":96},{"url":"/dataset/interaction-dataset","name":"INTERACTION Dataset","full_name":"","num_papers_in_archive":81},{"url":"/dataset/maniskill2","name":"ManiSkill2","full_name":"","num_papers_in_archive":40},{"url":"/dataset/codraw","name":"CoDraw","full_name":null,"num_papers_in_archive":14},{"url":"/dataset/chalet","name":"CHALET","full_name":"Cornell House Agent Learning Environment","num_papers_in_archive":10},{"url":"/dataset/cubicasa5k","name":"CubiCasa5K","full_name":null,"num_papers_in_archive":10},{"url":"/dataset/atari-head","name":"Atari-HEAD","full_name":null,"num_papers_in_archive":9},{"url":"/dataset/atari-grand-challenge","name":"Atari Grand Challenge","full_name":"","num_papers_in_archive":7},{"url":"/dataset/simitate","name":"Simitate","full_name":null,"num_papers_in_archive":5},{"url":"/dataset/minerl","name":"MineRL","full_name":"MineRL","num_papers_in_archive":3},{"url":"/dataset/motion-policy-networks","name":"Motion Policy Networks","full_name":"","num_papers_in_archive":3},{"url":"/dataset/il-datasets","name":"IL-Datasets","full_name":"Imitation Datasets","num_papers_in_archive":2},{"url":"/dataset/stardata","name":"StarData","full_name":"StarData","num_papers_in_archive":2},{"url":"/dataset/deformpam-dataset","name":"DeformPAM-Dataset","full_name":"Dataset of DeformPAM","num_papers_in_archive":1},{"url":"/dataset/reactive-diffusion-policy-dataset","name":"Reactive Diffusion Policy-Dataset","full_name":"Dataset of Reactive Diffusion Policy","num_papers_in_archive":1},{"url":"/dataset/rllab-framework","name":"RLLab Framework","full_name":"","num_papers_in_archive":1},{"url":"/dataset/texygen-platform","name":"Texygen Platform","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/behavioural-cloning","name":"Behavioural cloning"}],"parent_tasks":[{"url":"/task/decision-making","name":"Decision Making"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":22,"rows_per_page":100,"shown":100,"of":2122,"of_with_code":691,"tagged_in_all":2122,"counts":{"archive_papers_tagged":2122,"with_a_code_link":691,"where_syntology_ran_a_sample":234,"not_listed_spam_title":0,"listed":2122,"listed_where_code_ran":234,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":186,"every_run_a_failure_of_syntologys_instrument":48,"listed_with_a_run_with_no_instrument_failure":186,"listed_every_run_a_failure_of_syntologys_instrument":48,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/generative-adversarial-imitation-learning","slug":"generative-adversarial-imitation-learning","title":"Generative Adversarial Imitation Learning","date":"2016-06-10","arxiv_id":"1606.03476","repositories_listed":18,"syntology":{"n":36,"n_ran":24,"n_constructed":6,"n_ran_checked":22,"n_instrument":2,"n_unverified":12,"n_honours":2,"n_violates":1,"n_no_contract":19,"n_pointer_only":15,"phrase":"24 ran (of which 6 constructed an object rather than computing a result; 22 with no instrument failure: 2 honoured, 1 violated, 19 with no contract checked; 2 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/generative-adversarial-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/1606.03476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.03476"}},"official":null}},{"url":"/paper/end-to-end-driving-via-conditional-imitation","slug":"end-to-end-driving-via-conditional-imitation","title":"End-to-end Driving via Conditional Imitation Learning","date":"2017-10-06","arxiv_id":"1710.02410","repositories_listed":7,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/end-to-end-driving-via-conditional-imitation#ran","syntology_url":"https://syntology.ai/paper/1710.02410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.02410"}},"official":{"repos":["carla-simulator/imitation-learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/exact-combinatorial-optimization-with-graph","slug":"exact-combinatorial-optimization-with-graph","title":"Exact Combinatorial Optimization with Graph Convolutional Neural Networks","date":"2019-06-04","arxiv_id":"1906.01629","repositories_listed":6,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/exact-combinatorial-optimization-with-graph#ran","syntology_url":"https://syntology.ai/paper/1906.01629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01629"}},"official":{"repos":["ds4dm/learn2branch"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/behavioral-cloning-from-observation","slug":"behavioral-cloning-from-observation","title":"Behavioral Cloning from Observation","date":"2018-05-04","arxiv_id":"1805.01954","repositories_listed":6,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/behavioral-cloning-from-observation#ran","syntology_url":"https://syntology.ai/paper/1805.01954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.01954"}},"official":null}},{"url":"/paper/deep-q-learning-from-demonstrations","slug":"deep-q-learning-from-demonstrations","title":"Deep Q-learning from Demonstrations","date":"2017-04-12","arxiv_id":"1704.03732","repositories_listed":6,"syntology":null},{"url":"/paper/iq-learn-inverse-soft-q-learning-for","slug":"iq-learn-inverse-soft-q-learning-for","title":"IQ-Learn: Inverse soft-Q Learning for Imitation","date":"2021-06-23","arxiv_id":"2106.12142","repositories_listed":5,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/iq-learn-inverse-soft-q-learning-for#ran","syntology_url":"https://syntology.ai/paper/2106.12142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12142"}},"official":{"repos":["Div99/IQ-Learn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/sqil-imitation-learning-via-regularized","slug":"sqil-imitation-learning-via-regularized","title":"SQIL: Imitation Learning via Reinforcement Learning with Sparse Rewards","date":"2019-05-27","arxiv_id":"1905.11108","repositories_listed":5,"syntology":null},{"url":"/paper/variational-discriminator-bottleneck","slug":"variational-discriminator-bottleneck","title":"Variational Discriminator Bottleneck: Improving Imitation Learning, Inverse RL, and GANs by Constraining Information Flow","date":"2018-10-01","arxiv_id":"1810.00821","repositories_listed":5,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/variational-discriminator-bottleneck#ran","syntology_url":"https://syntology.ai/paper/1810.00821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00821"}},"official":null}},{"url":"/paper/comparing-the-efficacy-of-fine-tuning-and","slug":"comparing-the-efficacy-of-fine-tuning-and","title":"Comparing the Efficacy of Fine-Tuning and Meta-Learning for Few-Shot Policy Imitation","date":"2023-06-23","arxiv_id":"2306.13554","repositories_listed":4,"syntology":null},{"url":"/paper/orca-progressive-learning-from-complex","slug":"orca-progressive-learning-from-complex","title":"Orca: Progressive Learning from Complex Explanation Traces of GPT-4","date":"2023-06-05","arxiv_id":"2306.02707","repositories_listed":4,"syntology":null},{"url":"/paper/a-gan-like-approach-for-physics-based","slug":"a-gan-like-approach-for-physics-based","title":"A GAN-Like Approach for Physics-Based Imitation Learning and Interactive Character Control","date":"2021-05-21","arxiv_id":"2105.10066","repositories_listed":4,"syntology":null},{"url":"/paper/amp-adversarial-motion-priors-for-stylized","slug":"amp-adversarial-motion-priors-for-stylized","title":"AMP: Adversarial Motion Priors for Stylized Physics-Based Character Control","date":"2021-04-05","arxiv_id":"2104.02180","repositories_listed":4,"syntology":null},{"url":"/paper/proof-artifact-co-training-for-theorem","slug":"proof-artifact-co-training-for-theorem","title":"Proof Artifact Co-training for Theorem Proving with Language Models","date":"2021-02-11","arxiv_id":"2102.06203","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/proof-artifact-co-training-for-theorem#ran","syntology_url":"https://syntology.ai/paper/2102.06203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06203"}},"official":{"repos":["jasonrute/lean-proof-recording-public","jasonrute/lean_proof_recording","jesse-michael-han/lean-step-public"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/chauffeurnet-learning-to-drive-by-imitating","slug":"chauffeurnet-learning-to-drive-by-imitating","title":"ChauffeurNet: Learning to Drive by Imitating the Best and Synthesizing the Worst","date":"2018-12-07","arxiv_id":"1812.03079","repositories_listed":4,"syntology":null},{"url":"/paper/self-imitation-learning","slug":"self-imitation-learning","title":"Self-Imitation Learning","date":"2018-06-14","arxiv_id":"1806.05635","repositories_listed":4,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/self-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.05635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.05635"}},"official":{"repos":["junhyukoh/self-imitation-learning"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/infogail-interpretable-imitation-learning","slug":"infogail-interpretable-imitation-learning","title":"InfoGAIL: Interpretable Imitation Learning from Visual Demonstrations","date":"2017-03-26","arxiv_id":"1703.08840","repositories_listed":4,"syntology":null},{"url":"/paper/openvla-an-open-source-vision-language-action","slug":"openvla-an-open-source-vision-language-action","title":"OpenVLA: An Open-Source Vision-Language-Action Model","date":"2024-06-13","arxiv_id":"2406.09246","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/openvla-an-open-source-vision-language-action#ran","syntology_url":"https://syntology.ai/paper/2406.09246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09246"}},"official":null}},{"url":"/paper/webshop-towards-scalable-real-world-web","slug":"webshop-towards-scalable-real-world-web","title":"WebShop: Towards Scalable Real-World Web Interaction with Grounded Language Agents","date":"2022-07-04","arxiv_id":"2207.01206","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/webshop-towards-scalable-real-world-web#ran","syntology_url":"https://syntology.ai/paper/2207.01206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01206"}},"official":{"repos":["princeton-nlp/WebShop"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transfuser-imitation-with-transformer-based","slug":"transfuser-imitation-with-transformer-based","title":"TransFuser: Imitation with Transformer-Based Sensor Fusion for Autonomous Driving","date":"2022-05-31","arxiv_id":"2205.15997","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transfuser-imitation-with-transformer-based#ran","syntology_url":"https://syntology.ai/paper/2205.15997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15997"}},"official":{"repos":["autonomousvision/transfuser"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/end-to-end-urban-driving-by-imitating-a","slug":"end-to-end-urban-driving-by-imitating-a","title":"End-to-End Urban Driving by Imitating a Reinforcement Learning Coach","date":"2021-08-18","arxiv_id":"2108.08265","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-urban-driving-by-imitating-a#ran","syntology_url":"https://syntology.ai/paper/2108.08265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.08265"}},"official":{"repos":["zhejz/carla-roach"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/of-moments-and-matching-trade-offs-and","slug":"of-moments-and-matching-trade-offs-and","title":"Of Moments and Matching: A Game-Theoretic Framework for Closing the Imitation Gap","date":"2021-03-04","arxiv_id":"2103.03236","repositories_listed":3,"syntology":null},{"url":"/paper/babyai-1-1","slug":"babyai-1-1","title":"BabyAI 1.1","date":"2020-07-24","arxiv_id":"2007.12770","repositories_listed":3,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/babyai-1-1#ran","syntology_url":"https://syntology.ai/paper/2007.12770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12770"}},"official":{"repos":["mila-iqia/babyai"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/adversarial-soft-advantage-fitting-imitation","slug":"adversarial-soft-advantage-fitting-imitation","title":"Adversarial Soft Advantage Fitting: Imitation Learning without Policy Optimization","date":"2020-06-23","arxiv_id":"2006.13258","repositories_listed":3,"syntology":null},{"url":"/paper/imitation-learning-via-off-policy-1","slug":"imitation-learning-via-off-policy-1","title":"Imitation Learning via Off-Policy Distribution Matching","date":"2019-12-10","arxiv_id":"1912.05032","repositories_listed":3,"syntology":null},{"url":"/paper/a-divergence-minimization-perspective-on","slug":"a-divergence-minimization-perspective-on","title":"A Divergence Minimization Perspective on Imitation Learning Methods","date":"2019-11-06","arxiv_id":"1911.02256","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-divergence-minimization-perspective-on#ran","syntology_url":"https://syntology.ai/paper/1911.02256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02256"}},"official":{"repos":["KamyarGh/rl_swiss"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simitate-a-hybrid-imitation-learning","slug":"simitate-a-hybrid-imitation-learning","title":"Simitate: A Hybrid Imitation Learning Benchmark","date":"2019-05-15","arxiv_id":"1905.06002","repositories_listed":3,"syntology":null},{"url":"/paper/extrapolating-beyond-suboptimal","slug":"extrapolating-beyond-suboptimal","title":"Extrapolating Beyond Suboptimal Demonstrations via Inverse Reinforcement Learning from Observations","date":"2019-04-12","arxiv_id":"1904.06387","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/extrapolating-beyond-suboptimal#ran","syntology_url":"https://syntology.ai/paper/1904.06387","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06387"}},"official":{"repos":["hiwonjoon/ICML2019-TREX"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/go-explore-a-new-approach-for-hard","slug":"go-explore-a-new-approach-for-hard","title":"Go-Explore: a New Approach for Hard-Exploration Problems","date":"2019-01-30","arxiv_id":"1901.10995","repositories_listed":3,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/go-explore-a-new-approach-for-hard#ran","syntology_url":"https://syntology.ai/paper/1901.10995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10995"}},"official":null}},{"url":"/paper/compositional-imitation-learning-explaining","slug":"compositional-imitation-learning-explaining","title":"CompILE: Compositional Imitation Learning and Execution","date":"2018-12-04","arxiv_id":"1812.01483","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/compositional-imitation-learning-explaining#ran","syntology_url":"https://syntology.ai/paper/1812.01483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01483"}},"official":{"repos":["tkipf/compile"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/task-embedded-control-networks-for-few-shot","slug":"task-embedded-control-networks-for-few-shot","title":"Task-Embedded Control Networks for Few-Shot Imitation Learning","date":"2018-10-08","arxiv_id":"1810.03237","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/task-embedded-control-networks-for-few-shot#ran","syntology_url":"https://syntology.ai/paper/1810.03237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.03237"}},"official":{"repos":["stepjam/TecNets"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/discriminator-actor-critic-addressing-sample","slug":"discriminator-actor-critic-addressing-sample","title":"Discriminator-Actor-Critic: Addressing Sample Inefficiency and Reward Bias in Adversarial Imitation Learning","date":"2018-09-09","arxiv_id":"1809.02925","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":4,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 4 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/discriminator-actor-critic-addressing-sample#ran","syntology_url":"https://syntology.ai/paper/1809.02925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.02925"}},"official":null}},{"url":"/paper/sample-efficient-imitation-learning-via","slug":"sample-efficient-imitation-learning-via","title":"Sample-Efficient Imitation Learning via Generative Adversarial Nets","date":"2018-09-06","arxiv_id":"1809.02064","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sample-efficient-imitation-learning-via#ran","syntology_url":"https://syntology.ai/paper/1809.02064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.02064"}},"official":{"repos":["lionelblonde/sam-tf"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/bipedal-walking-robot-using-deep","slug":"bipedal-walking-robot-using-deep","title":"Bipedal Walking Robot using Deep Deterministic Policy Gradient","date":"2018-07-16","arxiv_id":"1807.05924","repositories_listed":3,"syntology":null},{"url":"/paper/transfer-learning-for-related-reinforcement","slug":"transfer-learning-for-related-reinforcement","title":"Transfer Learning for Related Reinforcement Learning Tasks via Image-to-Image Translation","date":"2018-05-31","arxiv_id":"1806.07377","repositories_listed":3,"syntology":null},{"url":"/paper/deep-imitation-learning-for-complex","slug":"deep-imitation-learning-for-complex","title":"Deep Imitation Learning for Complex Manipulation Tasks from Virtual Reality Teleoperation","date":"2017-10-12","arxiv_id":"1710.04615","repositories_listed":3,"syntology":null},{"url":"/paper/one-shot-visual-imitation-learning-via-meta","slug":"one-shot-visual-imitation-learning-via-meta","title":"One-Shot Visual Imitation Learning via Meta-Learning","date":"2017-09-14","arxiv_id":"1709.04905","repositories_listed":3,"syntology":null},{"url":"/paper/a-connection-between-generative-adversarial","slug":"a-connection-between-generative-adversarial","title":"A Connection between Generative Adversarial Networks, Inverse Reinforcement Learning, and Energy-Based Models","date":"2016-11-11","arxiv_id":"1611.03852","repositories_listed":3,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-connection-between-generative-adversarial#ran","syntology_url":"https://syntology.ai/paper/1611.03852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.03852"}},"official":null}},{"url":"/paper/the-arcade-learning-environment-an-evaluation","slug":"the-arcade-learning-environment-an-evaluation","title":"The Arcade Learning Environment: An Evaluation Platform for General Agents","date":"2012-07-19","arxiv_id":"1207.4708","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-arcade-learning-environment-an-evaluation#ran","syntology_url":"https://syntology.ai/paper/1207.4708","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1207.4708"}},"official":null}},{"url":"/paper/a-reduction-of-imitation-learning-and","slug":"a-reduction-of-imitation-learning-and","title":"A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning","date":"2010-11-02","arxiv_id":"1011.0686","repositories_listed":3,"syntology":null},{"url":"/paper/bootstrapped-model-predictive-control","slug":"bootstrapped-model-predictive-control","title":"Bootstrapped Model Predictive Control","date":"2025-03-24","arxiv_id":"2503.18871","repositories_listed":2,"syntology":null},{"url":"/paper/explorative-imitation-learning-a-path","slug":"explorative-imitation-learning-a-path","title":"Explorative Imitation Learning: A Path Signature Approach for Continuous Environments","date":"2024-07-05","arxiv_id":"2407.04856","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/explorative-imitation-learning-a-path#ran","syntology_url":"https://syntology.ai/paper/2407.04856","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.04856"}},"official":{"repos":["NathanGavenski/CILO"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/an-imitative-reinforcement-learning-framework","slug":"an-imitative-reinforcement-learning-framework","title":"An Imitative Reinforcement Learning Framework for Autonomous Dogfight","date":"2024-06-17","arxiv_id":"2406.11562","repositories_listed":2,"syntology":null},{"url":"/paper/hierarchical-decision-mamba","slug":"hierarchical-decision-mamba","title":"Decision Mamba Architectures","date":"2024-05-13","arxiv_id":"2405.07943","repositories_listed":2,"syntology":null},{"url":"/paper/behavior-generation-with-latent-actions","slug":"behavior-generation-with-latent-actions","title":"Behavior Generation with Latent Actions","date":"2024-03-05","arxiv_id":"2403.03181","repositories_listed":2,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":6,"n_honours":2,"n_violates":3,"n_no_contract":1,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 3 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/behavior-generation-with-latent-actions#ran","syntology_url":"https://syntology.ai/paper/2403.03181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03181"}},"official":{"repos":["jayLEE0301/vq_bet_official"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/kinematic-aware-prompting-for-generalizable","slug":"kinematic-aware-prompting-for-generalizable","title":"Kinematic-aware Prompting for Generalizable Articulated Object Manipulation with LLMs","date":"2023-11-06","arxiv_id":"2311.02847","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kinematic-aware-prompting-for-generalizable#ran","syntology_url":"https://syntology.ai/paper/2311.02847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02847"}},"official":{"repos":["gewu-lab/llm_articulated_object_manipulation","xwinks/llm_articulated_object_manipulation"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/locomujoco-a-comprehensive-imitation-learning","slug":"locomujoco-a-comprehensive-imitation-learning","title":"LocoMuJoCo: A Comprehensive Imitation Learning Benchmark for Locomotion","date":"2023-11-04","arxiv_id":"2311.02496","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/locomujoco-a-comprehensive-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/2311.02496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02496"}},"official":{"repos":["robfiras/loco-mujoco"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/invariant-causal-imitation-learning-for-1","slug":"invariant-causal-imitation-learning-for-1","title":"Invariant Causal Imitation Learning for Generalizable Policies","date":"2023-11-02","arxiv_id":"2311.01489","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/invariant-causal-imitation-learning-for-1#ran","syntology_url":"https://syntology.ai/paper/2311.01489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.01489"}},"official":{"repos":["ioanabica/invariant-causal-imitation-learning","vanderschaarlab/mlforhealthlabpub"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mimicgen-a-data-generation-system-for","slug":"mimicgen-a-data-generation-system-for","title":"MimicGen: A Data Generation System for Scalable Robot Learning using Human Demonstrations","date":"2023-10-26","arxiv_id":"2310.17596","repositories_listed":2,"syntology":null},{"url":"/paper/reinforcement-learning-in-the-era-of-llms","slug":"reinforcement-learning-in-the-era-of-llms","title":"Reinforcement Learning in the Era of LLMs: What is Essential? What is needed? An RL Perspective on RLHF, Prompting, and Beyond","date":"2023-10-09","arxiv_id":"2310.06147","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reinforcement-learning-in-the-era-of-llms#ran","syntology_url":"https://syntology.ai/paper/2310.06147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06147"}},"official":null}},{"url":"/paper/a-bayesian-approach-to-robust-inverse","slug":"a-bayesian-approach-to-robust-inverse","title":"A Bayesian Approach to Robust Inverse Reinforcement Learning","date":"2023-09-15","arxiv_id":"2309.08571","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-bayesian-approach-to-robust-inverse#ran","syntology_url":"https://syntology.ai/paper/2309.08571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.08571"}},"official":{"repos":["ran-weii/bmirl_tf"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/crossway-diffusion-improving-diffusion-based","slug":"crossway-diffusion-improving-diffusion-based","title":"Crossway Diffusion: Improving Diffusion-based Visuomotor Policy via Self-supervised Learning","date":"2023-07-04","arxiv_id":"2307.01849","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/crossway-diffusion-improving-diffusion-based#ran","syntology_url":"https://syntology.ai/paper/2307.01849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.01849"}},"official":{"repos":["lostxine/crossway_diffusion"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/preference-grounded-token-level-guidance-for-1","slug":"preference-grounded-token-level-guidance-for-1","title":"Preference-grounded Token-level Guidance for Language Model Fine-tuning","date":"2023-06-01","arxiv_id":"2306.00398","repositories_listed":2,"syntology":{"n":18,"n_ran":8,"n_constructed":1,"n_ran_checked":2,"n_instrument":6,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"8 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/preference-grounded-token-level-guidance-for-1#ran","syntology_url":"https://syntology.ai/paper/2306.00398","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00398"}},"official":{"repos":["shentao-yang/preference_grounded_guidance"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-coupled-flow-approach-to-imitation-learning","slug":"a-coupled-flow-approach-to-imitation-learning","title":"A Coupled Flow Approach to Imitation Learning","date":"2023-04-29","arxiv_id":"2305.00303","repositories_listed":2,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-coupled-flow-approach-to-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/2305.00303","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.00303"}},"official":{"repos":["gfreund123/cfil"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community"]}}},{"url":"/paper/learning-to-extrapolate-a-transductive","slug":"learning-to-extrapolate-a-transductive","title":"Learning to Extrapolate: A Transductive Approach","date":"2023-04-27","arxiv_id":"2304.14329","repositories_listed":2,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":16,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":1,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-to-extrapolate-a-transductive#ran","syntology_url":"https://syntology.ai/paper/2304.14329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.14329"}},"official":{"repos":["avivne/bilinear-transduction"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/self-supervised-adversarial-imitation","slug":"self-supervised-adversarial-imitation","title":"Self-Supervised Adversarial Imitation Learning","date":"2023-04-21","arxiv_id":"2304.10914","repositories_listed":2,"syntology":null},{"url":"/paper/language-driven-representation-learning-for","slug":"language-driven-representation-learning-for","title":"Language-Driven Representation Learning for Robotics","date":"2023-02-24","arxiv_id":"2302.12766","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/language-driven-representation-learning-for#ran","syntology_url":"https://syntology.ai/paper/2302.12766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12766"}},"official":{"repos":["siddk/voltron-evaluation","siddk/voltron-robotics"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-expertise-through","slug":"understanding-expertise-through","title":"When Demonstrations Meet Generative World Models: A Maximum Likelihood Framework for Offline Inverse Reinforcement Learning","date":"2023-02-15","arxiv_id":"2302.07457","repositories_listed":2,"syntology":null},{"url":"/paper/imitation-clean-imitation-learning","slug":"imitation-clean-imitation-learning","title":"imitation: Clean Imitation Learning Implementations","date":"2022-11-22","arxiv_id":"2211.11972","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/imitation-clean-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/2211.11972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.11972"}},"official":{"repos":["HumanCompatibleAI/imitation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/protox-explaining-a-reinforcement-learning","slug":"protox-explaining-a-reinforcement-learning","title":"ProtoX: Explaining a Reinforcement Learning Agent via Prototyping","date":"2022-11-06","arxiv_id":"2211.03162","repositories_listed":2,"syntology":null},{"url":"/paper/defix-detecting-and-fixing-failure-scenarios","slug":"defix-detecting-and-fixing-failure-scenarios","title":"DeFIX: Detecting and Fixing Failure Scenarios with Reinforcement Learning in Imitation Learning Based Autonomous Driving","date":"2022-10-29","arxiv_id":"2210.16567","repositories_listed":2,"syntology":null},{"url":"/paper/plant-explainable-planning-transformers-via","slug":"plant-explainable-planning-transformers-via","title":"PlanT: Explainable Planning Transformers via Object-Level Representations","date":"2022-10-25","arxiv_id":"2210.14222","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/plant-explainable-planning-transformers-via#ran","syntology_url":"https://syntology.ai/paper/2210.14222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.14222"}},"official":{"repos":["autonomousvision/plant"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/iterative-document-level-information","slug":"iterative-document-level-information","title":"Iterative Document-level Information Extraction via Imitation Learning","date":"2022-10-12","arxiv_id":"2210.06600","repositories_listed":2,"syntology":null},{"url":"/paper/vima-general-robot-manipulation-with","slug":"vima-general-robot-manipulation-with","title":"VIMA: General Robot Manipulation with Multimodal Prompts","date":"2022-10-06","arxiv_id":"2210.03094","repositories_listed":2,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/vima-general-robot-manipulation-with#ran","syntology_url":"https://syntology.ai/paper/2210.03094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03094"}},"official":{"repos":["vimalabs/VIMABench"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/proximal-point-imitation-learning","slug":"proximal-point-imitation-learning","title":"Proximal Point Imitation Learning","date":"2022-09-22","arxiv_id":"2209.10968","repositories_listed":2,"syntology":null},{"url":"/paper/levenshtein-ocr","slug":"levenshtein-ocr","title":"Levenshtein OCR","date":"2022-09-08","arxiv_id":"2209.03594","repositories_listed":2,"syntology":null},{"url":"/paper/discriminator-weighted-offline-imitation-1","slug":"discriminator-weighted-offline-imitation-1","title":"Discriminator-Weighted Offline Imitation Learning from Suboptimal Demonstrations","date":"2022-07-20","arxiv_id":"2207.10050","repositories_listed":2,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":13,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/discriminator-weighted-offline-imitation-1#ran","syntology_url":"https://syntology.ai/paper/2207.10050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10050"}},"official":{"repos":["ryanxhr/dwbc"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/video-pretraining-vpt-learning-to-act-by","slug":"video-pretraining-vpt-learning-to-act-by","title":"Video PreTraining (VPT): Learning to Act by Watching Unlabeled Online Videos","date":"2022-06-23","arxiv_id":"2206.11795","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/video-pretraining-vpt-learning-to-act-by#ran","syntology_url":"https://syntology.ai/paper/2206.11795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11795"}},"official":{"repos":["openai/Video-Pre-Training"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-investigation-of-representation","slug":"an-empirical-investigation-of-representation","title":"An Empirical Investigation of Representation Learning for Imitation","date":"2022-05-16","arxiv_id":"2205.07886","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-empirical-investigation-of-representation#ran","syntology_url":"https://syntology.ai/paper/2205.07886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.07886"}},"official":{"repos":["humancompatibleai/eirli","humancompatibleai/il-representations"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/what-matters-in-language-conditioned-robotic","slug":"what-matters-in-language-conditioned-robotic","title":"What Matters in Language Conditioned Robotic Imitation Learning over Unstructured Data","date":"2022-04-13","arxiv_id":"2204.06252","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/what-matters-in-language-conditioned-robotic#ran","syntology_url":"https://syntology.ai/paper/2204.06252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.06252"}},"official":{"repos":["mees/hulc"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-category-level-generalizable-object","slug":"learning-category-level-generalizable-object","title":"Learning Category-Level Generalizable Object Manipulation Policy via Generative Adversarial Self-Imitation Learning from Demonstrations","date":"2022-03-04","arxiv_id":"2203.02107","repositories_listed":2,"syntology":null},{"url":"/paper/plan-your-target-and-learn-your-skills","slug":"plan-your-target-and-learn-your-skills","title":"Plan Your Target and Learn Your Skills: Transferable State-Only Imitation Learning via Decoupled Policy Optimization","date":"2022-03-04","arxiv_id":"2203.02214","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/plan-your-target-and-learn-your-skills#ran","syntology_url":"https://syntology.ai/paper/2203.02214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02214"}},"official":{"repos":["apexrl/DePO","apexrl/depo_ngsim"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lobsdice-offline-imitation-learning-from","slug":"lobsdice-offline-imitation-learning-from","title":"LobsDICE: Offline Learning from Observation via Stationary Distribution Correction Estimation","date":"2022-02-28","arxiv_id":"2202.13536","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/lobsdice-offline-imitation-learning-from#ran","syntology_url":"https://syntology.ai/paper/2202.13536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.13536"}},"official":{"repos":["geon-hyeong/imitation-dice"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/smodice-versatile-offline-imitation-learning","slug":"smodice-versatile-offline-imitation-learning","title":"Versatile Offline Imitation from Observations and Examples via Regularized State-Occupancy Matching","date":"2022-02-04","arxiv_id":"2202.02433","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":4,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"6 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/smodice-versatile-offline-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/2202.02433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02433"}},"official":{"repos":["jasonma2016/smodice"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/webgpt-browser-assisted-question-answering","slug":"webgpt-browser-assisted-question-answering","title":"WebGPT: Browser-assisted question-answering with human feedback","date":"2021-12-17","arxiv_id":"2112.09332","repositories_listed":2,"syntology":null},{"url":"/paper/confidence-aware-imitation-learning-from","slug":"confidence-aware-imitation-learning-from","title":"Confidence-Aware Imitation Learning from Demonstrations with Varying Optimality","date":"2021-10-27","arxiv_id":"2110.14754","repositories_listed":2,"syntology":null},{"url":"/paper/deep-homography-estimation-in-dynamic","slug":"deep-homography-estimation-in-dynamic","title":"Deep Homography Estimation in Dynamic Surgical Scenes for Laparoscopic Camera Motion Extraction","date":"2021-09-30","arxiv_id":"2109.15098","repositories_listed":2,"syntology":null},{"url":"/paper/towards-real-world-navigation-with-deep","slug":"towards-real-world-navigation-with-deep","title":"Towards real-world navigation with deep differentiable planners","date":"2021-08-08","arxiv_id":"2108.05713","repositories_listed":2,"syntology":null},{"url":"/paper/reinforcement-learning-as-one-big-sequence","slug":"reinforcement-learning-as-one-big-sequence","title":"Offline Reinforcement Learning as One Big Sequence Modeling Problem","date":"2021-06-03","arxiv_id":"2106.02039","repositories_listed":2,"syntology":{"n":28,"n_ran":23,"n_constructed":0,"n_ran_checked":21,"n_instrument":2,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":20,"n_pointer_only":1,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 1 honoured, 0 violated, 20 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/reinforcement-learning-as-one-big-sequence#ran","syntology_url":"https://syntology.ai/paper/2106.02039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02039"}},"official":{"repos":["JannerM/trajectory-transformer"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multi-modal-fusion-transformer-for-end-to-end","slug":"multi-modal-fusion-transformer-for-end-to-end","title":"Multi-Modal Fusion Transformer for End-to-End Autonomous Driving","date":"2021-04-19","arxiv_id":"2104.09224","repositories_listed":2,"syntology":{"n":15,"n_ran":9,"n_constructed":7,"n_ran_checked":8,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/multi-modal-fusion-transformer-for-end-to-end#ran","syntology_url":"https://syntology.ai/paper/2104.09224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09224"}},"official":{"repos":["autonomousvision/transfuser"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/counter-strike-deathmatch-with-large-scale","slug":"counter-strike-deathmatch-with-large-scale","title":"Counter-Strike Deathmatch with Large-Scale Behavioural Cloning","date":"2021-04-09","arxiv_id":"2104.04258","repositories_listed":2,"syntology":null},{"url":"/paper/reagent-point-cloud-registration-using","slug":"reagent-point-cloud-registration-using","title":"ReAgent: Point Cloud Registration using Imitation and Reinforcement Learning","date":"2021-03-28","arxiv_id":"2103.15231","repositories_listed":2,"syntology":null},{"url":"/paper/online-baum-welch-algorithm-for-hierarchical","slug":"online-baum-welch-algorithm-for-hierarchical","title":"Online Baum-Welch algorithm for Hierarchical Imitation Learning","date":"2021-03-22","arxiv_id":"2103.12197","repositories_listed":2,"syntology":null},{"url":"/paper/end-to-end-egospheric-spatial-memory","slug":"end-to-end-egospheric-spatial-memory","title":"End-to-End Egospheric Spatial Memory","date":"2021-02-15","arxiv_id":"2102.07764","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-bayesian-inverse-reinforcement-1","slug":"scalable-bayesian-inverse-reinforcement-1","title":"Scalable Bayesian Inverse Reinforcement Learning","date":"2021-02-12","arxiv_id":"2102.06483","repositories_listed":2,"syntology":{"n":4,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 4 unverified","sample_list":"/paper/scalable-bayesian-inverse-reinforcement-1#ran","syntology_url":"https://syntology.ai/paper/2102.06483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06483"}},"official":{"repos":["XanderJC/scalable-birl","vanderschaarlab/mlforhealthlabpub"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"url":"/paper/augmenting-policy-learning-with-routines","slug":"augmenting-policy-learning-with-routines","title":"Augmenting Policy Learning with Routines Discovered from a Single Demonstration","date":"2020-12-23","arxiv_id":"2012.12469","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/augmenting-policy-learning-with-routines#ran","syntology_url":"https://syntology.ai/paper/2012.12469","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.12469"}},"official":{"repos":["sjtuytc/-AAAI21-RoutineAugmentedPolicyLearning-RAPL-","sjtuytc/AAAI21-RoutineAugmentedPolicyLearning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/igibson-a-simulation-environment-for","slug":"igibson-a-simulation-environment-for","title":"IGibson 1.0: a Simulation Environment for Interactive Tasks in Large Realistic Scenes","date":"2020-12-05","arxiv_id":"2012.02924","repositories_listed":2,"syntology":null},{"url":"/paper/derail-diagnostic-environments-for-reward-and","slug":"derail-diagnostic-environments-for-reward-and","title":"DERAIL: Diagnostic Environments for Reward And Imitation Learning","date":"2020-12-02","arxiv_id":"2012.01365","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/derail-diagnostic-environments-for-reward-and#ran","syntology_url":"https://syntology.ai/paper/2012.01365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.01365"}},"official":{"repos":["HumanCompatibleAI/derail","HumanCompatibleAI/seals"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-behavioral-cloning-for-autonomous","slug":"robust-behavioral-cloning-for-autonomous","title":"Robust Behavioral Cloning for Autonomous Vehicles using End-to-End Imitation Learning","date":"2020-10-09","arxiv_id":"2010.04767","repositories_listed":2,"syntology":null},{"url":"/paper/autoregressive-knowledge-distillation-through","slug":"autoregressive-knowledge-distillation-through","title":"Autoregressive Knowledge Distillation through Imitation Learning","date":"2020-09-15","arxiv_id":"2009.07253","repositories_listed":2,"syntology":null},{"url":"/paper/imitating-unknown-policies-via-exploration","slug":"imitating-unknown-policies-via-exploration","title":"Imitating Unknown Policies via Exploration","date":"2020-08-13","arxiv_id":"2008.05660","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/imitating-unknown-policies-via-exploration#ran","syntology_url":"https://syntology.ai/paper/2008.05660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05660"}},"official":{"repos":["NathanGavenski/IUPE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalization-guarantees-for-multi-modal","slug":"generalization-guarantees-for-multi-modal","title":"Generalization Guarantees for Imitation Learning","date":"2020-08-05","arxiv_id":"2008.01913","repositories_listed":2,"syntology":null},{"url":"/paper/guiding-deep-molecular-optimization-with","slug":"guiding-deep-molecular-optimization-with","title":"Guiding Deep Molecular Optimization with Genetic Exploration","date":"2020-07-04","arxiv_id":"2007.04897","repositories_listed":2,"syntology":null},{"url":"/paper/primal-wasserstein-imitation-learning","slug":"primal-wasserstein-imitation-learning","title":"Primal Wasserstein Imitation Learning","date":"2020-06-08","arxiv_id":"2006.04678","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/primal-wasserstein-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/2006.04678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04678"}},"official":{"repos":["google-research/google-research"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/disagreement-regularized-imitation-learning","slug":"disagreement-regularized-imitation-learning","title":"Disagreement-Regularized Imitation Learning","date":"2020-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/augmented-behavioral-cloning-from-observation","slug":"augmented-behavioral-cloning-from-observation","title":"Augmented Behavioral Cloning from Observation","date":"2020-04-28","arxiv_id":"2004.13529","repositories_listed":2,"syntology":null},{"url":"/paper/constrained-physics-informed-deep-learning","slug":"constrained-physics-informed-deep-learning","title":"Learning Constrained Adaptive Differentiable Predictive Control Policies With Guarantees","date":"2020-04-23","arxiv_id":"2004.11184","repositories_listed":2,"syntology":null},{"url":"/paper/modeling-3d-shapes-by-reinforcement-learning","slug":"modeling-3d-shapes-by-reinforcement-learning","title":"Modeling 3D Shapes by Reinforcement Learning","date":"2020-03-27","arxiv_id":"2003.12397","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modeling-3d-shapes-by-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/2003.12397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12397"}},"official":null}},{"url":"/paper/using-counterfactual-reasoning-and","slug":"using-counterfactual-reasoning-and","title":"Counterfactual Policy Evaluation for Decision-Making in Autonomous Driving","date":"2020-03-20","arxiv_id":"2003.11919","repositories_listed":2,"syntology":null},{"url":"/paper/loss-annealed-gail-for-sample-efficient-and","slug":"loss-annealed-gail-for-sample-efficient-and","title":"Augmenting GAIL with BC for sample efficient imitation learning","date":"2020-01-21","arxiv_id":"2001.07798","repositories_listed":2,"syntology":null},{"url":"/paper/side-tuning-network-adaptation-via-additive-1","slug":"side-tuning-network-adaptation-via-additive-1","title":"Side-Tuning: A Baseline for Network Adaptation via Additive Side Networks","date":"2019-12-31","arxiv_id":"1912.13503","repositories_listed":2,"syntology":null}],"syntology_records":52,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":234,"papers_where_code_ran_first_page":"/task/imitation-learning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":22,"url":"/task/imitation-learning/papers/2","json":"/task/imitation-learning/papers/2.json","rows":100},{"order":"archive","page":3,"of":22,"url":"/task/imitation-learning/papers/3","json":"/task/imitation-learning/papers/3.json","rows":100},{"order":"archive","page":4,"of":22,"url":"/task/imitation-learning/papers/4","json":"/task/imitation-learning/papers/4.json","rows":100},{"order":"archive","page":5,"of":22,"url":"/task/imitation-learning/papers/5","json":"/task/imitation-learning/papers/5.json","rows":100},{"order":"archive","page":6,"of":22,"url":"/task/imitation-learning/papers/6","json":"/task/imitation-learning/papers/6.json","rows":100},{"order":"archive","page":7,"of":22,"url":"/task/imitation-learning/papers/7","json":"/task/imitation-learning/papers/7.json","rows":100},{"order":"archive","page":8,"of":22,"url":"/task/imitation-learning/papers/8","json":"/task/imitation-learning/papers/8.json","rows":100},{"order":"archive","page":9,"of":22,"url":"/task/imitation-learning/papers/9","json":"/task/imitation-learning/papers/9.json","rows":100},{"order":"archive","page":10,"of":22,"url":"/task/imitation-learning/papers/10","json":"/task/imitation-learning/papers/10.json","rows":100},{"order":"archive","page":11,"of":22,"url":"/task/imitation-learning/papers/11","json":"/task/imitation-learning/papers/11.json","rows":100},{"order":"archive","page":12,"of":22,"url":"/task/imitation-learning/papers/12","json":"/task/imitation-learning/papers/12.json","rows":100},{"order":"archive","page":13,"of":22,"url":"/task/imitation-learning/papers/13","json":"/task/imitation-learning/papers/13.json","rows":100},{"order":"archive","page":14,"of":22,"url":"/task/imitation-learning/papers/14","json":"/task/imitation-learning/papers/14.json","rows":100},{"order":"archive","page":15,"of":22,"url":"/task/imitation-learning/papers/15","json":"/task/imitation-learning/papers/15.json","rows":100},{"order":"archive","page":16,"of":22,"url":"/task/imitation-learning/papers/16","json":"/task/imitation-learning/papers/16.json","rows":100},{"order":"archive","page":17,"of":22,"url":"/task/imitation-learning/papers/17","json":"/task/imitation-learning/papers/17.json","rows":100},{"order":"archive","page":18,"of":22,"url":"/task/imitation-learning/papers/18","json":"/task/imitation-learning/papers/18.json","rows":100},{"order":"archive","page":19,"of":22,"url":"/task/imitation-learning/papers/19","json":"/task/imitation-learning/papers/19.json","rows":100},{"order":"archive","page":20,"of":22,"url":"/task/imitation-learning/papers/20","json":"/task/imitation-learning/papers/20.json","rows":100},{"order":"archive","page":21,"of":22,"url":"/task/imitation-learning/papers/21","json":"/task/imitation-learning/papers/21.json","rows":100},{"order":"archive","page":22,"of":22,"url":"/task/imitation-learning/papers/22","json":"/task/imitation-learning/papers/22.json","rows":22},{"order":"ran","page":1,"of":3,"url":"/task/imitation-learning/papers/ran/1","json":"/task/imitation-learning/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":3,"url":"/task/imitation-learning/papers/ran/2","json":"/task/imitation-learning/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":3,"url":"/task/imitation-learning/papers/ran/3","json":"/task/imitation-learning/papers/ran/3.json","rows":34}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"81b3f5dd2ba1b321e9e00295be628dc2b6a1d7e674db60a5351dcd319684c88d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}