{"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/reinforcement-learning/papers/ran/11","list_of":"/task/reinforcement-learning","task":"Reinforcement 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":11,"pages_in_order":12,"rows_per_page":100,"rows":[1001,1100],"of":1175,"counts":{"archive_papers_tagged":13178,"with_a_code_link":4183,"where_syntology_ran_a_sample":1175,"not_listed_spam_title":0,"listed":13178,"listed_where_code_ran":1175,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":988,"every_run_a_failure_of_syntologys_instrument":187,"listed_with_a_run_with_no_instrument_failure":988,"listed_every_run_a_failure_of_syntologys_instrument":187,"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/reinforcement-learning/papers/ran/1","prev":"/task/reinforcement-learning/papers/ran/10","next":"/task/reinforcement-learning/papers/ran/12","papers":[{"url":"/paper/large-scale-study-of-curiosity-driven","slug":"large-scale-study-of-curiosity-driven","title":"Large-Scale Study of Curiosity-Driven Learning","date":"2018-08-13","arxiv_id":"1808.04355","repositories_listed":5,"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/large-scale-study-of-curiosity-driven#ran","syntology_url":"https://syntology.ai/paper/1808.04355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04355"}},"official":{"repos":["openai/large-scale-curiosity"],"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/recogym-a-reinforcement-learning-environment","slug":"recogym-a-reinforcement-learning-environment","title":"RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertising","date":"2018-08-02","arxiv_id":"1808.00720","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/recogym-a-reinforcement-learning-environment#ran","syntology_url":"https://syntology.ai/paper/1808.00720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.00720"}},"official":{"repos":["criteo-research/reco-gym"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/count-based-exploration-with-the-successor","slug":"count-based-exploration-with-the-successor","title":"Count-Based Exploration with the Successor Representation","date":"2018-07-31","arxiv_id":"1807.11622","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/count-based-exploration-with-the-successor#ran","syntology_url":"https://syntology.ai/paper/1807.11622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.11622"}},"official":{"repos":["mcmachado/count_based_exploration_sr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["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/learning-to-listen-read-and-follow-score","slug":"learning-to-listen-read-and-follow-score","title":"Learning to Listen, Read, and Follow: Score Following as a Reinforcement Learning Game","date":"2018-07-17","arxiv_id":"1807.06391","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-to-listen-read-and-follow-score#ran","syntology_url":"https://syntology.ai/paper/1807.06391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.06391"}},"official":{"repos":["CPJKU/score_following_game"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/remember-and-forget-for-experience-replay","slug":"remember-and-forget-for-experience-replay","title":"Remember and Forget for Experience Replay","date":"2018-07-16","arxiv_id":"1807.05827","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/remember-and-forget-for-experience-replay#ran","syntology_url":"https://syntology.ai/paper/1807.05827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05827"}},"official":{"repos":["cselab/smarties"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/representation-learning-with-contrastive","slug":"representation-learning-with-contrastive","title":"Representation Learning with Contrastive Predictive Coding","date":"2018-07-10","arxiv_id":"1807.03748","repositories_listed":28,"syntology":{"n":45,"n_ran":35,"n_constructed":21,"n_ran_checked":30,"n_instrument":5,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":29,"n_pointer_only":22,"phrase":"35 ran (of which 21 constructed an object rather than computing a result; 30 with no instrument failure: 1 honoured, 0 violated, 29 with no contract checked; 5 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/representation-learning-with-contrastive#ran","syntology_url":"https://syntology.ai/paper/1807.03748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03748"}},"official":null}},{"url":"/paper/algorithmic-framework-for-model-based-deep","slug":"algorithmic-framework-for-model-based-deep","title":"Algorithmic Framework for Model-based Deep Reinforcement Learning with Theoretical Guarantees","date":"2018-07-10","arxiv_id":"1807.03858","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":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/algorithmic-framework-for-model-based-deep#ran","syntology_url":"https://syntology.ai/paper/1807.03858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03858"}},"official":{"repos":["roosephu/slbo"],"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/learning-to-drive-in-a-day","slug":"learning-to-drive-in-a-day","title":"Learning to Drive in a Day","date":"2018-07-01","arxiv_id":"1807.00412","repositories_listed":8,"syntology":{"n":22,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/learning-to-drive-in-a-day#ran","syntology_url":"https://syntology.ai/paper/1807.00412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.00412"}},"official":null}},{"url":"/paper/textworld-a-learning-environment-for-text","slug":"textworld-a-learning-environment-for-text","title":"TextWorld: A Learning Environment for Text-based Games","date":"2018-06-29","arxiv_id":"1806.11532","repositories_listed":1,"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/textworld-a-learning-environment-for-text#ran","syntology_url":"https://syntology.ai/paper/1806.11532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.11532"}},"official":null}},{"url":"/paper/darts-differentiable-architecture-search","slug":"darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","arxiv_id":"1806.09055","repositories_listed":59,"syntology":{"n":156,"n_ran":74,"n_constructed":30,"n_ran_checked":60,"n_instrument":14,"n_unverified":82,"n_honours":9,"n_violates":1,"n_no_contract":50,"n_pointer_only":54,"phrase":"74 ran (of which 30 constructed an object rather than computing a result; 60 with no instrument failure: 9 honoured, 1 violated, 50 with no contract checked; 14 where Syntology's instrument failed) · 82 unverified","sample_list":"/paper/darts-differentiable-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1806.09055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09055"}},"official":{"repos":["quark0/darts"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/beyond-backprop-online-alternating","slug":"beyond-backprop-online-alternating","title":"Beyond Backprop: Online Alternating Minimization with Auxiliary Variables","date":"2018-06-24","arxiv_id":"1806.09077","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/beyond-backprop-online-alternating#ran","syntology_url":"https://syntology.ai/paper/1806.09077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09077"}},"official":{"repos":["IBM/online-alt-min"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sim-to-real-reinforcement-learning-for","slug":"sim-to-real-reinforcement-learning-for","title":"Sim-to-Real Reinforcement Learning for Deformable Object Manipulation","date":"2018-06-20","arxiv_id":"1806.07851","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/sim-to-real-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/1806.07851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07851"}},"official":{"repos":["JanMatas/Rainbow_ddpg"],"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/rudder-return-decomposition-for-delayed","slug":"rudder-return-decomposition-for-delayed","title":"RUDDER: Return Decomposition for Delayed Rewards","date":"2018-06-20","arxiv_id":"1806.07857","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rudder-return-decomposition-for-delayed#ran","syntology_url":"https://syntology.ai/paper/1806.07857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07857"}},"official":{"repos":["ml-jku/baselines-rudder","ml-jku/rudder"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/barc-backward-reachability-curriculum-for","slug":"barc-backward-reachability-curriculum-for","title":"BaRC: Backward Reachability Curriculum for Robotic Reinforcement Learning","date":"2018-06-16","arxiv_id":"1806.06161","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/barc-backward-reachability-curriculum-for#ran","syntology_url":"https://syntology.ai/paper/1806.06161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.06161"}},"official":{"repos":["StanfordASL/BaRC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-quantile-networks-for-distributional","slug":"implicit-quantile-networks-for-distributional","title":"Implicit Quantile Networks for Distributional Reinforcement Learning","date":"2018-06-14","arxiv_id":"1806.06923","repositories_listed":19,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/implicit-quantile-networks-for-distributional#ran","syntology_url":"https://syntology.ai/paper/1806.06923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.06923"}},"official":null}},{"url":"/paper/structured-variational-learning-of-bayesian","slug":"structured-variational-learning-of-bayesian","title":"Structured Variational Learning of Bayesian Neural Networks with Horseshoe Priors","date":"2018-06-13","arxiv_id":"1806.05975","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structured-variational-learning-of-bayesian#ran","syntology_url":"https://syntology.ai/paper/1806.05975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.05975"}},"official":null}},{"url":"/paper/bayesian-model-agnostic-meta-learning","slug":"bayesian-model-agnostic-meta-learning","title":"Bayesian Model-Agnostic Meta-Learning","date":"2018-06-11","arxiv_id":"1806.03836","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/bayesian-model-agnostic-meta-learning#ran","syntology_url":"https://syntology.ai/paper/1806.03836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03836"}},"official":null}},{"url":"/paper/the-potential-of-the-return-distribution-for","slug":"the-potential-of-the-return-distribution-for","title":"The Potential of the Return Distribution for Exploration in RL","date":"2018-06-11","arxiv_id":"1806.04242","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/the-potential-of-the-return-distribution-for#ran","syntology_url":"https://syntology.ai/paper/1806.04242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.04242"}},"official":{"repos":["tmoer/return_distribution_exploration"],"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/randomized-prior-functions-for-deep","slug":"randomized-prior-functions-for-deep","title":"Randomized Prior Functions for Deep Reinforcement Learning","date":"2018-06-08","arxiv_id":"1806.03335","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":2,"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/randomized-prior-functions-for-deep#ran","syntology_url":"https://syntology.ai/paper/1806.03335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03335"}},"official":null}},{"url":"/paper/graph-convolutional-policy-network-for-goal","slug":"graph-convolutional-policy-network-for-goal","title":"Graph Convolutional Policy Network for Goal-Directed Molecular Graph Generation","date":"2018-06-07","arxiv_id":"1806.02473","repositories_listed":2,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"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) · 7 unverified","sample_list":"/paper/graph-convolutional-policy-network-for-goal#ran","syntology_url":"https://syntology.ai/paper/1806.02473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02473"}},"official":{"repos":["bowenliu16/rl_graph_generation"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/path-level-network-transformation-for","slug":"path-level-network-transformation-for","title":"Path-Level Network Transformation for Efficient Architecture Search","date":"2018-06-07","arxiv_id":"1806.02639","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/path-level-network-transformation-for#ran","syntology_url":"https://syntology.ai/paper/1806.02639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02639"}},"official":{"repos":["han-cai/PathLevel-EAS"],"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/deep-variational-reinforcement-learning-for","slug":"deep-variational-reinforcement-learning-for","title":"Deep Variational Reinforcement Learning for POMDPs","date":"2018-06-06","arxiv_id":"1806.02426","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-variational-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/1806.02426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02426"}},"official":{"repos":["maximilianigl/DVRL"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-reinforcement-learning-for-general-video","slug":"deep-reinforcement-learning-for-general-video","title":"Deep Reinforcement Learning for General Video Game AI","date":"2018-06-06","arxiv_id":"1806.02448","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-reinforcement-learning-for-general-video#ran","syntology_url":"https://syntology.ai/paper/1806.02448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02448"}},"official":{"repos":["rubenrtorrado/GVGAI_GYM"],"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":["listed","official"]}}},{"url":"/paper/tafe-net-task-aware-feature-embeddings-for","slug":"tafe-net-task-aware-feature-embeddings-for","title":"Deep Mixture of Experts via Shallow Embedding","date":"2018-06-05","arxiv_id":"1806.01531","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"8 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tafe-net-task-aware-feature-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1806.01531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01531"}},"official":null}},{"url":"/paper/relational-deep-reinforcement-learning","slug":"relational-deep-reinforcement-learning","title":"Relational Deep Reinforcement Learning","date":"2018-06-05","arxiv_id":"1806.01830","repositories_listed":7,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"5 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; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/relational-deep-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1806.01830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01830"}},"official":null}},{"url":"/paper/challenges-in-high-dimensional-reinforcement","slug":"challenges-in-high-dimensional-reinforcement","title":"Challenges in High-dimensional Reinforcement Learning with Evolution Strategies","date":"2018-06-04","arxiv_id":"1806.01224","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/challenges-in-high-dimensional-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1806.01224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01224"}},"official":{"repos":["NiMlr/High-Dim-ES-RL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/molgan-an-implicit-generative-model-for-small","slug":"molgan-an-implicit-generative-model-for-small","title":"MolGAN: An implicit generative model for small molecular graphs","date":"2018-05-30","arxiv_id":"1805.11973","repositories_listed":11,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":10,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"7 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; 2 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/molgan-an-implicit-generative-model-for-small#ran","syntology_url":"https://syntology.ai/paper/1805.11973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11973"}},"official":{"repos":["nicola-decao/MolGAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/deep-reinforcement-learning-in-a-handful-of","slug":"deep-reinforcement-learning-in-a-handful-of","title":"Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Models","date":"2018-05-30","arxiv_id":"1805.12114","repositories_listed":9,"syntology":{"n":19,"n_ran":12,"n_constructed":5,"n_ran_checked":7,"n_instrument":5,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":17,"phrase":"12 ran (of which 5 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/deep-reinforcement-learning-in-a-handful-of#ran","syntology_url":"https://syntology.ai/paper/1805.12114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.12114"}},"official":{"repos":["kchua/handful-of-trials"],"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/playing-hard-exploration-games-by-watching","slug":"playing-hard-exploration-games-by-watching","title":"Playing hard exploration games by watching YouTube","date":"2018-05-29","arxiv_id":"1805.11592","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/playing-hard-exploration-games-by-watching#ran","syntology_url":"https://syntology.ai/paper/1805.11592","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11592"}},"official":null}},{"url":"/paper/reliability-and-learnability-of-human-bandit","slug":"reliability-and-learnability-of-human-bandit","title":"Reliability and Learnability of Human Bandit Feedback for Sequence-to-Sequence Reinforcement Learning","date":"2018-05-27","arxiv_id":"1805.10627","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/reliability-and-learnability-of-human-bandit#ran","syntology_url":"https://syntology.ai/paper/1805.10627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.10627"}},"official":null}},{"url":"/paper/deep-reinforcement-learning-for-sequence-to","slug":"deep-reinforcement-learning-for-sequence-to","title":"Deep Reinforcement Learning For Sequence to Sequence Models","date":"2018-05-24","arxiv_id":"1805.09461","repositories_listed":3,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":2,"phrase":"16 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-reinforcement-learning-for-sequence-to#ran","syntology_url":"https://syntology.ai/paper/1805.09461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09461"}},"official":{"repos":["yaserkl/RLSeq2Seq"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a0c-alpha-zero-in-continuous-action-space","slug":"a0c-alpha-zero-in-continuous-action-space","title":"A0C: Alpha Zero in Continuous Action Space","date":"2018-05-24","arxiv_id":"1805.09613","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a0c-alpha-zero-in-continuous-action-space#ran","syntology_url":"https://syntology.ai/paper/1805.09613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09613"}},"official":null}},{"url":"/paper/meta-gradient-reinforcement-learning","slug":"meta-gradient-reinforcement-learning","title":"Meta-Gradient Reinforcement Learning","date":"2018-05-24","arxiv_id":"1805.09801","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/meta-gradient-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1805.09801","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09801"}},"official":null}},{"url":"/paper/robust-distant-supervision-relation","slug":"robust-distant-supervision-relation","title":"Robust Distant Supervision Relation Extraction via Deep Reinforcement Learning","date":"2018-05-24","arxiv_id":"1805.09927","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/robust-distant-supervision-relation#ran","syntology_url":"https://syntology.ai/paper/1805.09927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09927"}},"official":null}},{"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/evolution-guided-policy-gradient-in","slug":"evolution-guided-policy-gradient-in","title":"Evolution-Guided Policy Gradient in Reinforcement Learning","date":"2018-05-21","arxiv_id":"1805.07917","repositories_listed":6,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/evolution-guided-policy-gradient-in#ran","syntology_url":"https://syntology.ai/paper/1805.07917","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07917"}},"official":{"repos":["ShawK91/erl_paper_nips18"],"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/where-do-you-think-youre-going-inferring","slug":"where-do-you-think-youre-going-inferring","title":"Where Do You Think You're Going?: Inferring Beliefs about Dynamics from Behavior","date":"2018-05-21","arxiv_id":"1805.08010","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":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/where-do-you-think-youre-going-inferring#ran","syntology_url":"https://syntology.ai/paper/1805.08010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08010"}},"official":{"repos":["rddy/isql"],"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/machine-teaching-for-inverse-reinforcement","slug":"machine-teaching-for-inverse-reinforcement","title":"Machine Teaching for Inverse Reinforcement Learning: Algorithms and Applications","date":"2018-05-20","arxiv_id":"1805.07687","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/machine-teaching-for-inverse-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1805.07687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07687"}},"official":{"repos":["dsbrown1331/machine-teaching-irl"],"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/solving-the-rubiks-cube-without-human","slug":"solving-the-rubiks-cube-without-human","title":"Solving the Rubik's Cube Without Human Knowledge","date":"2018-05-18","arxiv_id":"1805.07470","repositories_listed":9,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/solving-the-rubiks-cube-without-human#ran","syntology_url":"https://syntology.ai/paper/1805.07470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07470"}},"official":null}},{"url":"/paper/end-to-end-reinforcement-learning-for","slug":"end-to-end-reinforcement-learning-for","title":"End-to-End Reinforcement Learning for Automatic Taxonomy Induction","date":"2018-05-10","arxiv_id":"1805.04044","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/end-to-end-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/1805.04044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.04044"}},"official":{"repos":["morningmoni/TaxoRL"],"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/polite-dialogue-generation-without-parallel","slug":"polite-dialogue-generation-without-parallel","title":"Polite Dialogue Generation Without Parallel Data","date":"2018-05-08","arxiv_id":"1805.03162","repositories_listed":1,"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":0,"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/polite-dialogue-generation-without-parallel#ran","syntology_url":"https://syntology.ai/paper/1805.03162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.03162"}},"official":null}},{"url":"/paper/motion-planning-among-dynamic-decision-making","slug":"motion-planning-among-dynamic-decision-making","title":"Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning","date":"2018-05-04","arxiv_id":"1805.01956","repositories_listed":6,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/motion-planning-among-dynamic-decision-making#ran","syntology_url":"https://syntology.ai/paper/1805.01956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.01956"}},"official":{"repos":["mfe7/cadrl_ros"],"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/reinforcement-learning-and-control-as","slug":"reinforcement-learning-and-control-as","title":"Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Review","date":"2018-05-02","arxiv_id":"1805.00909","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/reinforcement-learning-and-control-as#ran","syntology_url":"https://syntology.ai/paper/1805.00909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.00909"}},"official":null}},{"url":"/paper/no-metrics-are-perfect-adversarial-reward","slug":"no-metrics-are-perfect-adversarial-reward","title":"No Metrics Are Perfect: Adversarial Reward Learning for Visual Storytelling","date":"2018-04-24","arxiv_id":"1804.09160","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/no-metrics-are-perfect-adversarial-reward#ran","syntology_url":"https://syntology.ai/paper/1804.09160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.09160"}},"official":{"repos":["littlekobe/AREL"],"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/emergence-of-linguistic-communication-from","slug":"emergence-of-linguistic-communication-from","title":"Emergence of Linguistic Communication from Referential Games with Symbolic and Pixel Input","date":"2018-04-11","arxiv_id":"1804.03984","repositories_listed":1,"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/emergence-of-linguistic-communication-from#ran","syntology_url":"https://syntology.ai/paper/1804.03984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.03984"}},"official":null}},{"url":"/paper/dora-the-explorer-directed-outreaching","slug":"dora-the-explorer-directed-outreaching","title":"DORA The Explorer: Directed Outreaching Reinforcement Action-Selection","date":"2018-04-11","arxiv_id":"1804.04012","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/dora-the-explorer-directed-outreaching#ran","syntology_url":"https://syntology.ai/paper/1804.04012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.04012"}},"official":{"repos":["borgr/DORA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-run-challenge-solutions-adapting","slug":"learning-to-run-challenge-solutions-adapting","title":"Learning to Run challenge solutions: Adapting reinforcement learning methods for neuromusculoskeletal environments","date":"2018-04-02","arxiv_id":"1804.00361","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/learning-to-run-challenge-solutions-adapting#ran","syntology_url":"https://syntology.ai/paper/1804.00361","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00361"}},"official":{"repos":["AdamStelmaszczyk/learning2run"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/qmix-monotonic-value-function-factorisation","slug":"qmix-monotonic-value-function-factorisation","title":"QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning","date":"2018-03-30","arxiv_id":"1803.11485","repositories_listed":18,"syntology":{"n":11,"n_ran":9,"n_constructed":7,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":6,"phrase":"9 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/qmix-monotonic-value-function-factorisation#ran","syntology_url":"https://syntology.ai/paper/1803.11485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.11485"}},"official":{"repos":["oxwhirl/pymarl"],"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-synergies-between-pushing-and","slug":"learning-synergies-between-pushing-and","title":"Learning Synergies between Pushing and Grasping with Self-supervised Deep Reinforcement Learning","date":"2018-03-27","arxiv_id":"1803.09956","repositories_listed":4,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/learning-synergies-between-pushing-and#ran","syntology_url":"https://syntology.ai/paper/1803.09956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.09956"}},"official":{"repos":["andyzeng/visual-pushing-grasping"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/world-models","slug":"world-models","title":"World Models","date":"2018-03-27","arxiv_id":"1803.10122","repositories_listed":22,"syntology":{"n":38,"n_ran":21,"n_constructed":0,"n_ran_checked":16,"n_instrument":5,"n_unverified":17,"n_honours":1,"n_violates":0,"n_no_contract":15,"n_pointer_only":3,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 1 honoured, 0 violated, 15 with no contract checked; 5 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/world-models#ran","syntology_url":"https://syntology.ai/paper/1803.10122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10122"}},"official":null}},{"url":"/paper/long-short-term-memory-and-learning-to-learn","slug":"long-short-term-memory-and-learning-to-learn","title":"Long short-term memory and learning-to-learn in networks of spiking neurons","date":"2018-03-26","arxiv_id":"1803.09574","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/long-short-term-memory-and-learning-to-learn#ran","syntology_url":"https://syntology.ai/paper/1803.09574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.09574"}},"official":null}},{"url":"/paper/simple-random-search-provides-a-competitive","slug":"simple-random-search-provides-a-competitive","title":"Simple random search provides a competitive approach to reinforcement learning","date":"2018-03-19","arxiv_id":"1803.07055","repositories_listed":26,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/simple-random-search-provides-a-competitive#ran","syntology_url":"https://syntology.ai/paper/1803.07055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07055"}},"official":{"repos":["modestyachts/ARS"],"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/flipout-efficient-pseudo-independent-weight","slug":"flipout-efficient-pseudo-independent-weight","title":"Flipout: Efficient Pseudo-Independent Weight Perturbations on Mini-Batches","date":"2018-03-12","arxiv_id":"1803.04386","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/flipout-efficient-pseudo-independent-weight#ran","syntology_url":"https://syntology.ai/paper/1803.04386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04386"}},"official":null}},{"url":"/paper/variance-networks-when-expectation-does-not","slug":"variance-networks-when-expectation-does-not","title":"Variance Networks: When Expectation Does Not Meet Your Expectations","date":"2018-03-10","arxiv_id":"1803.03764","repositories_listed":2,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/variance-networks-when-expectation-does-not#ran","syntology_url":"https://syntology.ai/paper/1803.03764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03764"}},"official":{"repos":["da-molchanov/variance-networks"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/accelerated-methods-for-deep-reinforcement","slug":"accelerated-methods-for-deep-reinforcement","title":"Accelerated Methods for Deep Reinforcement Learning","date":"2018-03-07","arxiv_id":"1803.02811","repositories_listed":8,"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/accelerated-methods-for-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1803.02811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02811"}},"official":null}},{"url":"/paper/accelerating-natural-gradient-with-higher","slug":"accelerating-natural-gradient-with-higher","title":"Accelerating Natural Gradient with Higher-Order Invariance","date":"2018-03-04","arxiv_id":"1803.01273","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/accelerating-natural-gradient-with-higher#ran","syntology_url":"https://syntology.ai/paper/1803.01273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01273"}},"official":{"repos":["ermongroup/higher_order_invariance"],"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/distributed-prioritized-experience-replay","slug":"distributed-prioritized-experience-replay","title":"Distributed Prioritized Experience Replay","date":"2018-03-02","arxiv_id":"1803.00933","repositories_listed":15,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"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) · 6 unverified","sample_list":"/paper/distributed-prioritized-experience-replay#ran","syntology_url":"https://syntology.ai/paper/1803.00933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.00933"}},"official":null}},{"url":"/paper/learning-by-playing-solving-sparse-reward","slug":"learning-by-playing-solving-sparse-reward","title":"Learning by Playing - Solving Sparse Reward Tasks from Scratch","date":"2018-02-28","arxiv_id":"1802.10567","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/learning-by-playing-solving-sparse-reward#ran","syntology_url":"https://syntology.ai/paper/1802.10567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.10567"}},"official":{"repos":["hu-po/pySACQ"],"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-mirage-of-action-dependent-baselines-in","slug":"the-mirage-of-action-dependent-baselines-in","title":"The Mirage of Action-Dependent Baselines in Reinforcement Learning","date":"2018-02-27","arxiv_id":"1802.10031","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-mirage-of-action-dependent-baselines-in#ran","syntology_url":"https://syntology.ai/paper/1802.10031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.10031"}},"official":null}},{"url":"/paper/addressing-function-approximation-error-in","slug":"addressing-function-approximation-error-in","title":"Addressing Function Approximation Error in Actor-Critic Methods","date":"2018-02-26","arxiv_id":"1802.09477","repositories_listed":67,"syntology":{"n":36,"n_ran":26,"n_constructed":0,"n_ran_checked":25,"n_instrument":1,"n_unverified":10,"n_honours":1,"n_violates":1,"n_no_contract":23,"n_pointer_only":21,"phrase":"26 ran (of which 0 constructed an object rather than computing a result; 25 with no instrument failure: 1 honoured, 1 violated, 23 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/addressing-function-approximation-error-in#ran","syntology_url":"https://syntology.ai/paper/1802.09477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.09477"}},"official":{"repos":["sfujim/TD3"],"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/reinforcement-learning-on-web-interfaces","slug":"reinforcement-learning-on-web-interfaces","title":"Reinforcement Learning on Web Interfaces Using Workflow-Guided Exploration","date":"2018-02-24","arxiv_id":"1802.08802","repositories_listed":5,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/reinforcement-learning-on-web-interfaces#ran","syntology_url":"https://syntology.ai/paper/1802.08802","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.08802"}},"official":{"repos":["stanfordnlp/wge","worksheets.codalab.org/worksheets/0x0f25031bd42f4aabbc17625fe1484066"],"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/diversity-is-all-you-need-learning-skills","slug":"diversity-is-all-you-need-learning-skills","title":"Diversity is All You Need: Learning Skills without a Reward Function","date":"2018-02-16","arxiv_id":"1802.06070","repositories_listed":4,"syntology":{"n":11,"n_ran":8,"n_constructed":5,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/diversity-is-all-you-need-learning-skills#ran","syntology_url":"https://syntology.ai/paper/1802.06070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.06070"}},"official":null}},{"url":"/paper/mean-field-multi-agent-reinforcement-learning","slug":"mean-field-multi-agent-reinforcement-learning","title":"Mean Field Multi-Agent Reinforcement Learning","date":"2018-02-15","arxiv_id":"1802.05438","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":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) · 1 unverified","sample_list":"/paper/mean-field-multi-agent-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1802.05438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05438"}},"official":{"repos":["mlii/mfrl"],"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/model-compression-via-distillation-and","slug":"model-compression-via-distillation-and","title":"Model compression via distillation and quantization","date":"2018-02-15","arxiv_id":"1802.05668","repositories_listed":5,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-compression-via-distillation-and#ran","syntology_url":"https://syntology.ai/paper/1802.05668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05668"}},"official":{"repos":["antspy/quantized_distillation"],"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/gep-pg-decoupling-exploration-and","slug":"gep-pg-decoupling-exploration-and","title":"GEP-PG: Decoupling Exploration and Exploitation in Deep Reinforcement Learning Algorithms","date":"2018-02-14","arxiv_id":"1802.05054","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":3,"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/gep-pg-decoupling-exploration-and#ran","syntology_url":"https://syntology.ai/paper/1802.05054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05054"}},"official":{"repos":["flowersteam/geppg"],"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/evolved-policy-gradients","slug":"evolved-policy-gradients","title":"Evolved Policy Gradients","date":"2018-02-13","arxiv_id":"1802.04821","repositories_listed":3,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evolved-policy-gradients#ran","syntology_url":"https://syntology.ai/paper/1802.04821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04821"}},"official":{"repos":["openai/EPG"],"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":["listed","official"]}}},{"url":"/paper/reinforcement-learning-for-solving-the","slug":"reinforcement-learning-for-solving-the","title":"Reinforcement Learning for Solving the Vehicle Routing Problem","date":"2018-02-12","arxiv_id":"1802.04240","repositories_listed":4,"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":3,"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/reinforcement-learning-for-solving-the#ran","syntology_url":"https://syntology.ai/paper/1802.04240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04240"}},"official":null}},{"url":"/paper/amc-automl-for-model-compression-and","slug":"amc-automl-for-model-compression-and","title":"AMC: AutoML for Model Compression and Acceleration on Mobile Devices","date":"2018-02-10","arxiv_id":"1802.03494","repositories_listed":12,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/amc-automl-for-model-compression-and#ran","syntology_url":"https://syntology.ai/paper/1802.03494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03494"}},"official":{"repos":["mit-han-lab/amc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/impala-scalable-distributed-deep-rl-with","slug":"impala-scalable-distributed-deep-rl-with","title":"IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures","date":"2018-02-05","arxiv_id":"1802.01561","repositories_listed":24,"syntology":{"n":34,"n_ran":16,"n_constructed":6,"n_ran_checked":10,"n_instrument":6,"n_unverified":18,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":3,"phrase":"16 ran (of which 6 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 6 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/impala-scalable-distributed-deep-rl-with#ran","syntology_url":"https://syntology.ai/paper/1802.01561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.01561"}},"official":{"repos":["deepmind/scalable_agent"],"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/safe-exploration-in-continuous-action-spaces","slug":"safe-exploration-in-continuous-action-spaces","title":"Safe Exploration in Continuous Action Spaces","date":"2018-01-26","arxiv_id":"1801.08757","repositories_listed":6,"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/safe-exploration-in-continuous-action-spaces#ran","syntology_url":"https://syntology.ai/paper/1801.08757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.08757"}},"official":null}},{"url":"/paper/soft-actor-critic-off-policy-maximum-entropy","slug":"soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","arxiv_id":"1801.01290","repositories_listed":86,"syntology":{"n":148,"n_ran":91,"n_constructed":61,"n_ran_checked":73,"n_instrument":18,"n_unverified":57,"n_honours":3,"n_violates":1,"n_no_contract":69,"n_pointer_only":66,"phrase":"91 ran (of which 61 constructed an object rather than computing a result; 73 with no instrument failure: 3 honoured, 1 violated, 69 with no contract checked; 18 where Syntology's instrument failed) · 57 unverified","sample_list":"/paper/soft-actor-critic-off-policy-maximum-entropy#ran","syntology_url":"https://syntology.ai/paper/1801.01290","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.01290"}},"official":{"repos":["haarnoja/sac"],"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/jointly-learning-to-construct-and-control","slug":"jointly-learning-to-construct-and-control","title":"Jointly Learning to Construct and Control Agents using Deep Reinforcement Learning","date":"2018-01-04","arxiv_id":"1801.01432","repositories_listed":3,"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":1,"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/jointly-learning-to-construct-and-control#ran","syntology_url":"https://syntology.ai/paper/1801.01432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.01432"}},"official":null}},{"url":"/paper/deep-reinforcement-learning-for-unsupervised","slug":"deep-reinforcement-learning-for-unsupervised","title":"Deep Reinforcement Learning for Unsupervised Video Summarization with Diversity-Representativeness Reward","date":"2017-12-29","arxiv_id":"1801.00054","repositories_listed":6,"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/deep-reinforcement-learning-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/1801.00054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.00054"}},"official":{"repos":["KaiyangZhou/vsumm-reinforce"],"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/pixelsnail-an-improved-autoregressive","slug":"pixelsnail-an-improved-autoregressive","title":"PixelSNAIL: An Improved Autoregressive Generative Model","date":"2017-12-28","arxiv_id":"1712.09763","repositories_listed":6,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"6 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pixelsnail-an-improved-autoregressive#ran","syntology_url":"https://syntology.ai/paper/1712.09763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.09763"}},"official":{"repos":["neocxi/pixelsnail-public"],"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/safe-policy-improvement-with-baseline","slug":"safe-policy-improvement-with-baseline","title":"Safe Policy Improvement with Baseline Bootstrapping","date":"2017-12-19","arxiv_id":"1712.06924","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/safe-policy-improvement-with-baseline#ran","syntology_url":"https://syntology.ai/paper/1712.06924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.06924"}},"official":{"repos":["RomainLaroche/SPIBB","rems75/SPIBB-DQN"],"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/improving-exploration-in-evolution-strategies","slug":"improving-exploration-in-evolution-strategies","title":"Improving Exploration in Evolution Strategies for Deep Reinforcement Learning via a Population of Novelty-Seeking Agents","date":"2017-12-18","arxiv_id":"1712.06560","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/improving-exploration-in-evolution-strategies#ran","syntology_url":"https://syntology.ai/paper/1712.06560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.06560"}},"official":{"repos":["uber-research/deep-neuroevolution"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/deep-neuroevolution-genetic-algorithms-are-a","slug":"deep-neuroevolution-genetic-algorithms-are-a","title":"Deep Neuroevolution: Genetic Algorithms Are a Competitive Alternative for Training Deep Neural Networks for Reinforcement Learning","date":"2017-12-18","arxiv_id":"1712.06567","repositories_listed":12,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":1,"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: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-neuroevolution-genetic-algorithms-are-a#ran","syntology_url":"https://syntology.ai/paper/1712.06567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.06567"}},"official":null}},{"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/a-low-cost-ethics-shaping-approach-for","slug":"a-low-cost-ethics-shaping-approach-for","title":"A Low-Cost Ethics Shaping Approach for Designing Reinforcement Learning Agents","date":"2017-12-12","arxiv_id":"1712.04172","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":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/a-low-cost-ethics-shaping-approach-for#ran","syntology_url":"https://syntology.ai/paper/1712.04172","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.04172"}},"official":null}},{"url":"/paper/mastering-chess-and-shogi-by-self-play-with-a","slug":"mastering-chess-and-shogi-by-self-play-with-a","title":"Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm","date":"2017-12-05","arxiv_id":"1712.01815","repositories_listed":62,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":4,"n_instrument":9,"n_unverified":4,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":9,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 9 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/mastering-chess-and-shogi-by-self-play-with-a#ran","syntology_url":"https://syntology.ai/paper/1712.01815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.01815"}},"official":null}},{"url":"/paper/progressive-neural-architecture-search","slug":"progressive-neural-architecture-search","title":"Progressive Neural Architecture Search","date":"2017-12-02","arxiv_id":"1712.00559","repositories_listed":18,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/progressive-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1712.00559","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.00559"}},"official":{"repos":["chenxi116/PNASNet.TF","tensorflow/models","chenxi116/PNASNet.pytorch"],"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":["listed","official"]}}},{"url":"/paper/deep-reinforcement-learning-for-sepsis","slug":"deep-reinforcement-learning-for-sepsis","title":"Deep Reinforcement Learning for Sepsis Treatment","date":"2017-11-27","arxiv_id":"1711.09602","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":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/deep-reinforcement-learning-for-sepsis#ran","syntology_url":"https://syntology.ai/paper/1711.09602","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.09602"}},"official":{"repos":["darkefyre/sepsisrl"],"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/ethical-challenges-in-data-driven-dialogue","slug":"ethical-challenges-in-data-driven-dialogue","title":"Ethical Challenges in Data-Driven Dialogue Systems","date":"2017-11-24","arxiv_id":"1711.09050","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":2,"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/ethical-challenges-in-data-driven-dialogue#ran","syntology_url":"https://syntology.ai/paper/1711.09050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.09050"}},"official":{"repos":["Breakend/EthicsInDialogue"],"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/hindsight-policy-gradients","slug":"hindsight-policy-gradients","title":"Hindsight policy gradients","date":"2017-11-16","arxiv_id":"1711.06006","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/hindsight-policy-gradients#ran","syntology_url":"https://syntology.ai/paper/1711.06006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.06006"}},"official":null}},{"url":"/paper/go-for-a-walk-and-arrive-at-the-answer","slug":"go-for-a-walk-and-arrive-at-the-answer","title":"Go for a Walk and Arrive at the Answer: Reasoning Over Paths in Knowledge Bases using Reinforcement Learning","date":"2017-11-15","arxiv_id":"1711.05851","repositories_listed":8,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/go-for-a-walk-and-arrive-at-the-answer#ran","syntology_url":"https://syntology.ai/paper/1711.05851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05851"}},"official":{"repos":["shehzaadzd/MINERVA"],"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/sqlnet-generating-structured-queries-from","slug":"sqlnet-generating-structured-queries-from","title":"SQLNet: Generating Structured Queries From Natural Language Without Reinforcement Learning","date":"2017-11-13","arxiv_id":"1711.04436","repositories_listed":13,"syntology":{"n":19,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/sqlnet-generating-structured-queries-from#ran","syntology_url":"https://syntology.ai/paper/1711.04436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04436"}},"official":null}},{"url":"/paper/learning-with-latent-language","slug":"learning-with-latent-language","title":"Learning with Latent Language","date":"2017-11-01","arxiv_id":"1711.00482","repositories_listed":1,"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":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) · 0 unverified","sample_list":"/paper/learning-with-latent-language#ran","syntology_url":"https://syntology.ai/paper/1711.00482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.00482"}},"official":{"repos":["jacobandreas/l3"],"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/treeqn-and-atreec-differentiable-tree","slug":"treeqn-and-atreec-differentiable-tree","title":"TreeQN and ATreeC: Differentiable Tree-Structured Models for Deep Reinforcement Learning","date":"2017-10-31","arxiv_id":"1710.11417","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/treeqn-and-atreec-differentiable-tree#ran","syntology_url":"https://syntology.ai/paper/1710.11417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11417"}},"official":{"repos":["oxwhirl/treeqn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/regret-minimization-for-partially-observable","slug":"regret-minimization-for-partially-observable","title":"Regret Minimization for Partially Observable Deep Reinforcement Learning","date":"2017-10-31","arxiv_id":"1710.11424","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/regret-minimization-for-partially-observable#ran","syntology_url":"https://syntology.ai/paper/1710.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11424"}},"official":null}},{"url":"/paper/backpropagation-through-the-void-optimizing","slug":"backpropagation-through-the-void-optimizing","title":"Backpropagation through the Void: Optimizing control variates for black-box gradient estimation","date":"2017-10-31","arxiv_id":"1711.00123","repositories_listed":7,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":3,"n_violates":1,"n_no_contract":3,"n_pointer_only":12,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/backpropagation-through-the-void-optimizing#ran","syntology_url":"https://syntology.ai/paper/1711.00123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.00123"}},"official":{"repos":["duvenaud/relax"],"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":["listed","official"]}}},{"url":"/paper/visualizing-and-understanding-atari-agents","slug":"visualizing-and-understanding-atari-agents","title":"Visualizing and Understanding Atari Agents","date":"2017-10-31","arxiv_id":"1711.00138","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":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/visualizing-and-understanding-atari-agents#ran","syntology_url":"https://syntology.ai/paper/1711.00138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.00138"}},"official":{"repos":["greydanus/visualize_atari"],"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/eigenoption-discovery-through-the-deep","slug":"eigenoption-discovery-through-the-deep","title":"Eigenoption Discovery through the Deep Successor Representation","date":"2017-10-30","arxiv_id":"1710.11089","repositories_listed":1,"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/eigenoption-discovery-through-the-deep#ran","syntology_url":"https://syntology.ai/paper/1710.11089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11089"}},"official":null}},{"url":"/paper/action-depedent-control-variates-for-policy","slug":"action-depedent-control-variates-for-policy","title":"Action-depedent Control Variates for Policy Optimization via Stein's Identity","date":"2017-10-30","arxiv_id":"1710.11198","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/action-depedent-control-variates-for-policy#ran","syntology_url":"https://syntology.ai/paper/1710.11198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11198"}},"official":null}},{"url":"/paper/learning-robust-rewards-with-adversarial","slug":"learning-robust-rewards-with-adversarial","title":"Learning Robust Rewards with Adversarial Inverse Reinforcement Learning","date":"2017-10-30","arxiv_id":"1710.11248","repositories_listed":7,"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":5,"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/learning-robust-rewards-with-adversarial#ran","syntology_url":"https://syntology.ai/paper/1710.11248","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11248"}},"official":null}},{"url":"/paper/distributional-reinforcement-learning-with-1","slug":"distributional-reinforcement-learning-with-1","title":"Distributional Reinforcement Learning with Quantile Regression","date":"2017-10-27","arxiv_id":"1710.10044","repositories_listed":17,"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/distributional-reinforcement-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/1710.10044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10044"}},"official":null}},{"url":"/paper/flow-architecture-and-benchmarking-for","slug":"flow-architecture-and-benchmarking-for","title":"Flow: A Modular Learning Framework for Mixed Autonomy Traffic","date":"2017-10-16","arxiv_id":"1710.05465","repositories_listed":16,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/flow-architecture-and-benchmarking-for#ran","syntology_url":"https://syntology.ai/paper/1710.05465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.05465"}},"official":{"repos":["cathywu/flow","flow-project/flow"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/searching-for-activation-functions","slug":"searching-for-activation-functions","title":"Searching for Activation Functions","date":"2017-10-16","arxiv_id":"1710.05941","repositories_listed":22,"syntology":{"n":20,"n_ran":13,"n_constructed":1,"n_ran_checked":8,"n_instrument":5,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":4,"phrase":"13 ran (of which 1 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/searching-for-activation-functions#ran","syntology_url":"https://syntology.ai/paper/1710.05941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.05941"}},"official":null}},{"url":"/paper/learning-to-generalize-meta-learning-for","slug":"learning-to-generalize-meta-learning-for","title":"Learning to Generalize: Meta-Learning for Domain Generalization","date":"2017-10-10","arxiv_id":"1710.03463","repositories_listed":5,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/learning-to-generalize-meta-learning-for#ran","syntology_url":"https://syntology.ai/paper/1710.03463","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.03463"}},"official":null}},{"url":"/paper/rainbow-combining-improvements-in-deep","slug":"rainbow-combining-improvements-in-deep","title":"Rainbow: Combining Improvements in Deep Reinforcement Learning","date":"2017-10-06","arxiv_id":"1710.02298","repositories_listed":34,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rainbow-combining-improvements-in-deep#ran","syntology_url":"https://syntology.ai/paper/1710.02298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.02298"}},"official":null}}],"record_sha256":"7a2d5b834a29f5fa73c67b7c2061a426ca81df09176505ec17395e8f66da8a2d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}