{"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/papers/ran/3","list_of":"/task/imitation-learning","task":"Imitation Learning","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":3,"pages_in_order":3,"rows_per_page":100,"rows":[201,234],"of":234,"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":191,"every_run_a_failure_of_syntologys_instrument":43,"listed_with_a_run_with_no_instrument_failure":191,"listed_every_run_a_failure_of_syntologys_instrument":43,"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"},"first_page":"/task/imitation-learning/papers/ran/1","prev":"/task/imitation-learning/papers/ran/2","next":null,"papers":[{"url":"/paper/optimal-power-flow-using-graph-neural","slug":"optimal-power-flow-using-graph-neural","title":"Optimal Power Flow Using Graph Neural Networks","date":"2019-10-21","arxiv_id":"1910.09658","repositories_listed":2,"syntology":{"n":20,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/optimal-power-flow-using-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1910.09658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09658"}},"official":null}},{"url":"/paper/mpc-net-a-first-principles-guided-policy","slug":"mpc-net-a-first-principles-guided-policy","title":"MPC-Net: A First Principles Guided Policy Search","date":"2019-09-11","arxiv_id":"1909.05197","repositories_listed":1,"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/mpc-net-a-first-principles-guided-policy#ran","syntology_url":"https://syntology.ai/paper/1909.05197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.05197"}},"official":{"repos":["leggedrobotics/MPC-Net"],"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/an-empirical-comparison-on-imitation-learning","slug":"an-empirical-comparison-on-imitation-learning","title":"An Empirical Comparison on Imitation Learning and Reinforcement Learning for Paraphrase Generation","date":"2019-08-28","arxiv_id":"1908.10835","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-empirical-comparison-on-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/1908.10835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10835"}},"official":{"repos":["ddddwy/Reinforce-Paraphrase-Generation"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/goal-conditioned-imitation-learning","slug":"goal-conditioned-imitation-learning","title":"Goal-conditioned Imitation Learning","date":"2019-06-13","arxiv_id":"1906.05838","repositories_listed":1,"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":1,"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/goal-conditioned-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/1906.05838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05838"}},"official":{"repos":["dingyiming0427/goalgail"],"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/causal-confusion-in-imitation-learning","slug":"causal-confusion-in-imitation-learning","title":"Causal Confusion in Imitation Learning","date":"2019-05-28","arxiv_id":"1905.11979","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":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/causal-confusion-in-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/1905.11979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11979"}},"official":null}},{"url":"/paper/random-expert-distillation-imitation-learning","slug":"random-expert-distillation-imitation-learning","title":"Random Expert Distillation: Imitation Learning via Expert Policy Support Estimation","date":"2019-05-16","arxiv_id":"1905.06750","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":10,"phrase":"5 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/random-expert-distillation-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/1905.06750","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06750"}},"official":{"repos":["RuohanW/RED"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-the-limitations-of-behavior-cloning","slug":"exploring-the-limitations-of-behavior-cloning","title":"Exploring the Limitations of Behavior Cloning for Autonomous Driving","date":"2019-04-18","arxiv_id":"1904.08980","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/exploring-the-limitations-of-behavior-cloning#ran","syntology_url":"https://syntology.ai/paper/1904.08980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08980"}},"official":{"repos":["felipecode/coiltraine"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/hybrid-reinforcement-learning-with-expert","slug":"hybrid-reinforcement-learning-with-expert","title":"Hybrid Reinforcement Learning with Expert State Sequences","date":"2019-03-11","arxiv_id":"1903.04110","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"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, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hybrid-reinforcement-learning-with-expert#ran","syntology_url":"https://syntology.ai/paper/1903.04110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.04110"}},"official":{"repos":["XiaoxiaoGuo/tensor4rl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/artificial-intelligence-for-prosthetics","slug":"artificial-intelligence-for-prosthetics","title":"Artificial Intelligence for Prosthetics - challenge solutions","date":"2019-02-07","arxiv_id":"1902.02441","repositories_listed":1,"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/artificial-intelligence-for-prosthetics#ran","syntology_url":"https://syntology.ai/paper/1902.02441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.02441"}},"official":{"repos":["iasawseen/MultiServerRL"],"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/naomi-non-autoregressive-multiresolution","slug":"naomi-non-autoregressive-multiresolution","title":"NAOMI: Non-Autoregressive Multiresolution Sequence Imputation","date":"2019-01-30","arxiv_id":"1901.10946","repositories_listed":1,"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":1,"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/naomi-non-autoregressive-multiresolution#ran","syntology_url":"https://syntology.ai/paper/1901.10946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10946"}},"official":{"repos":["felixykliu/NAOMI"],"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/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/neural-modular-control-for-embodied-question","slug":"neural-modular-control-for-embodied-question","title":"Neural Modular Control for Embodied Question Answering","date":"2018-10-26","arxiv_id":"1810.11181","repositories_listed":2,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/neural-modular-control-for-embodied-question#ran","syntology_url":"https://syntology.ai/paper/1810.11181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11181"}},"official":null}},{"url":"/paper/efficiently-combining-human-demonstrations","slug":"efficiently-combining-human-demonstrations","title":"Efficiently Combining Human Demonstrations and Interventions for Safe Training of Autonomous Systems in Real-Time","date":"2018-10-26","arxiv_id":"1810.11545","repositories_listed":1,"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/efficiently-combining-human-demonstrations#ran","syntology_url":"https://syntology.ai/paper/1810.11545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11545"}},"official":null}},{"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/task-oriented-hand-motion-retargeting-for","slug":"task-oriented-hand-motion-retargeting-for","title":"Task-Oriented Hand Motion Retargeting for Dexterous Manipulation Imitation","date":"2018-10-03","arxiv_id":"1810.01845","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/task-oriented-hand-motion-retargeting-for#ran","syntology_url":"https://syntology.ai/paper/1810.01845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.01845"}},"official":{"repos":["DaphneAntotsiou/task-oriented-hand-retargeting"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/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/multi-agent-generative-adversarial-imitation","slug":"multi-agent-generative-adversarial-imitation","title":"Multi-Agent Generative Adversarial Imitation Learning","date":"2018-07-26","arxiv_id":"1807.09936","repositories_listed":1,"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/multi-agent-generative-adversarial-imitation#ran","syntology_url":"https://syntology.ai/paper/1807.09936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.09936"}},"official":null}},{"url":"/paper/conditional-affordance-learning-for-driving","slug":"conditional-affordance-learning-for-driving","title":"Conditional Affordance Learning for Driving in Urban Environments","date":"2018-06-18","arxiv_id":"1806.06498","repositories_listed":1,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 1 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/conditional-affordance-learning-for-driving#ran","syntology_url":"https://syntology.ai/paper/1806.06498","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.06498"}},"official":{"repos":["xl-sr/CAL"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/multi-task-maximum-entropy-inverse","slug":"multi-task-maximum-entropy-inverse","title":"Multi-task Maximum Entropy Inverse Reinforcement Learning","date":"2018-05-22","arxiv_id":"1805.08882","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/multi-task-maximum-entropy-inverse#ran","syntology_url":"https://syntology.ai/paper/1805.08882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08882"}},"official":{"repos":["HumanCompatibleAI/population-irl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/imitating-latent-policies-from-observation","slug":"imitating-latent-policies-from-observation","title":"Imitating Latent Policies from Observation","date":"2018-05-21","arxiv_id":"1805.07914","repositories_listed":2,"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/imitating-latent-policies-from-observation#ran","syntology_url":"https://syntology.ai/paper/1805.07914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07914"}},"official":{"repos":["ashedwards/ILPO"],"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/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/generating-multi-agent-trajectories-using","slug":"generating-multi-agent-trajectories-using","title":"Generating Multi-Agent Trajectories using Programmatic Weak Supervision","date":"2018-03-20","arxiv_id":"1803.07612","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/generating-multi-agent-trajectories-using#ran","syntology_url":"https://syntology.ai/paper/1803.07612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07612"}},"official":{"repos":["ezhan94/gen-MA-BC","ezhan94/multiagent-programmatic-supervision"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ai2-thor-an-interactive-3d-environment-for","slug":"ai2-thor-an-interactive-3d-environment-for","title":"AI2-THOR: An Interactive 3D Environment for Visual AI","date":"2017-12-14","arxiv_id":"1712.05474","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ai2-thor-an-interactive-3d-environment-for#ran","syntology_url":"https://syntology.ai/paper/1712.05474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.05474"}},"official":{"repos":["allenai/ai2thor"],"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/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/dart-noise-injection-for-robust-imitation","slug":"dart-noise-injection-for-robust-imitation","title":"DART: Noise Injection for Robust Imitation Learning","date":"2017-03-27","arxiv_id":"1703.09327","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"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, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/dart-noise-injection-for-robust-imitation#ran","syntology_url":"https://syntology.ai/paper/1703.09327","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.09327"}},"official":{"repos":["BerkeleyAutomation/DART"],"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/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/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/smooth-imitation-learning-for-online-sequence","slug":"smooth-imitation-learning-for-online-sequence","title":"Smooth Imitation Learning for Online Sequence Prediction","date":"2016-06-03","arxiv_id":"1606.00968","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/smooth-imitation-learning-for-online-sequence#ran","syntology_url":"https://syntology.ai/paper/1606.00968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.00968"}},"official":{"repos":["hoangminhle/SIMILE"],"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/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}}],"record_sha256":"d675c10601f184c35abf43318f853a40bd8658abfd79bd0f69e014a0bcacb0fb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}