{"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/12","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":12,"pages_in_order":12,"rows_per_page":100,"rows":[1101,1175],"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/11","next":null,"papers":[{"url":"/paper/detecting-adversarial-attacks-on-neural","slug":"detecting-adversarial-attacks-on-neural","title":"Detecting Adversarial Attacks on Neural Network Policies with Visual Foresight","date":"2017-10-02","arxiv_id":"1710.00814","repositories_listed":2,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"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) · 4 unverified","sample_list":"/paper/detecting-adversarial-attacks-on-neural#ran","syntology_url":"https://syntology.ai/paper/1710.00814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.00814"}},"official":{"repos":["yenchenlin/rl-attack-detection"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-deep-reinforcement-learning","slug":"self-supervised-deep-reinforcement-learning","title":"Self-supervised Deep Reinforcement Learning with Generalized Computation Graphs for Robot Navigation","date":"2017-09-29","arxiv_id":"1709.10489","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/self-supervised-deep-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1709.10489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.10489"}},"official":{"repos":["gkahn13/gcg"],"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/overcoming-exploration-in-reinforcement","slug":"overcoming-exploration-in-reinforcement","title":"Overcoming Exploration in Reinforcement Learning with Demonstrations","date":"2017-09-28","arxiv_id":"1709.10089","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/overcoming-exploration-in-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1709.10089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.10089"}},"official":null}},{"url":"/paper/long-text-generation-via-adversarial-training","slug":"long-text-generation-via-adversarial-training","title":"Long Text Generation via Adversarial Training with Leaked Information","date":"2017-09-24","arxiv_id":"1709.08624","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/long-text-generation-via-adversarial-training#ran","syntology_url":"https://syntology.ai/paper/1709.08624","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.08624"}},"official":{"repos":["CR-Gjx/LeakGAN"],"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/guided-deep-reinforcement-learning-for-swarm","slug":"guided-deep-reinforcement-learning-for-swarm","title":"Guided Deep Reinforcement Learning for Swarm Systems","date":"2017-09-18","arxiv_id":"1709.06011","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/guided-deep-reinforcement-learning-for-swarm#ran","syntology_url":"https://syntology.ai/paper/1709.06011","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.06011"}},"official":null}},{"url":"/paper/learning-with-opponent-learning-awareness","slug":"learning-with-opponent-learning-awareness","title":"Learning with Opponent-Learning Awareness","date":"2017-09-13","arxiv_id":"1709.04326","repositories_listed":6,"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/learning-with-opponent-learning-awareness#ran","syntology_url":"https://syntology.ai/paper/1709.04326","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.04326"}},"official":{"repos":["alshedivat/lola"],"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/scalable-trust-region-method-for-deep","slug":"scalable-trust-region-method-for-deep","title":"Scalable trust-region method for deep reinforcement learning using Kronecker-factored approximation","date":"2017-08-17","arxiv_id":"1708.05144","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":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/scalable-trust-region-method-for-deep#ran","syntology_url":"https://syntology.ai/paper/1708.05144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.05144"}},"official":{"repos":["openai/baselines"],"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/starcraft-ii-a-new-challenge-for","slug":"starcraft-ii-a-new-challenge-for","title":"StarCraft II: A New Challenge for Reinforcement Learning","date":"2017-08-16","arxiv_id":"1708.04782","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/starcraft-ii-a-new-challenge-for#ran","syntology_url":"https://syntology.ai/paper/1708.04782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.04782"}},"official":{"repos":["deepmind/pysc2"],"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":["listed","unlocated"]}}},{"url":"/paper/neural-network-dynamics-for-model-based-deep","slug":"neural-network-dynamics-for-model-based-deep","title":"Neural Network Dynamics for Model-Based Deep Reinforcement Learning with Model-Free Fine-Tuning","date":"2017-08-08","arxiv_id":"1708.02596","repositories_listed":9,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-network-dynamics-for-model-based-deep#ran","syntology_url":"https://syntology.ai/paper/1708.02596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.02596"}},"official":null}},{"url":"/paper/proximal-policy-optimization-algorithms","slug":"proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","arxiv_id":"1707.06347","repositories_listed":188,"syntology":{"n":176,"n_ran":99,"n_constructed":53,"n_ran_checked":71,"n_instrument":28,"n_unverified":77,"n_honours":7,"n_violates":2,"n_no_contract":62,"n_pointer_only":94,"phrase":"99 ran (of which 53 constructed an object rather than computing a result; 71 with no instrument failure: 7 honoured, 2 violated, 62 with no contract checked; 28 where Syntology's instrument failed) · 77 unverified","sample_list":"/paper/proximal-policy-optimization-algorithms#ran","syntology_url":"https://syntology.ai/paper/1707.06347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.06347"}},"official":null}},{"url":"/paper/imagination-augmented-agents-for-deep","slug":"imagination-augmented-agents-for-deep","title":"Imagination-Augmented Agents for Deep Reinforcement Learning","date":"2017-07-19","arxiv_id":"1707.06203","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/imagination-augmented-agents-for-deep#ran","syntology_url":"https://syntology.ai/paper/1707.06203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.06203"}},"official":null}},{"url":"/paper/hindsight-experience-replay","slug":"hindsight-experience-replay","title":"Hindsight Experience Replay","date":"2017-07-05","arxiv_id":"1707.01495","repositories_listed":28,"syntology":{"n":16,"n_ran":16,"n_constructed":10,"n_ran_checked":11,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":9,"phrase":"16 ran (of which 10 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hindsight-experience-replay#ran","syntology_url":"https://syntology.ai/paper/1707.01495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.01495"}},"official":null}},{"url":"/paper/efficient-probabilistic-performance-bounds","slug":"efficient-probabilistic-performance-bounds","title":"Efficient Probabilistic Performance Bounds for Inverse Reinforcement Learning","date":"2017-07-03","arxiv_id":"1707.00724","repositories_listed":3,"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":3,"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/efficient-probabilistic-performance-bounds#ran","syntology_url":"https://syntology.ai/paper/1707.00724","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.00724"}},"official":{"repos":["dsbrown1331/aaai-2018-code"],"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/noisy-networks-for-exploration","slug":"noisy-networks-for-exploration","title":"Noisy Networks for Exploration","date":"2017-06-30","arxiv_id":"1706.10295","repositories_listed":15,"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/noisy-networks-for-exploration#ran","syntology_url":"https://syntology.ai/paper/1706.10295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.10295"}},"official":null}},{"url":"/paper/deep-reinforcement-learning-from-human","slug":"deep-reinforcement-learning-from-human","title":"Deep reinforcement learning from human preferences","date":"2017-06-12","arxiv_id":"1706.03741","repositories_listed":7,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-reinforcement-learning-from-human#ran","syntology_url":"https://syntology.ai/paper/1706.03741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03741"}},"official":null}},{"url":"/paper/multi-agent-actor-critic-for-mixed","slug":"multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","arxiv_id":"1706.02275","repositories_listed":86,"syntology":{"n":143,"n_ran":75,"n_constructed":54,"n_ran_checked":68,"n_instrument":7,"n_unverified":68,"n_honours":2,"n_violates":0,"n_no_contract":66,"n_pointer_only":99,"phrase":"75 ran (of which 54 constructed an object rather than computing a result; 68 with no instrument failure: 2 honoured, 0 violated, 66 with no contract checked; 7 where Syntology's instrument failed) · 68 unverified","sample_list":"/paper/multi-agent-actor-critic-for-mixed#ran","syntology_url":"https://syntology.ai/paper/1706.02275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02275"}},"official":{"repos":["openai/multiagent-particle-envs"],"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":["listed","unlocated"]}}},{"url":"/paper/parameter-space-noise-for-exploration","slug":"parameter-space-noise-for-exploration","title":"Parameter Space Noise for Exploration","date":"2017-06-06","arxiv_id":"1706.01905","repositories_listed":10,"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":5,"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/parameter-space-noise-for-exploration#ran","syntology_url":"https://syntology.ai/paper/1706.01905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.01905"}},"official":null}},{"url":"/paper/constrained-policy-optimization","slug":"constrained-policy-optimization","title":"Constrained Policy Optimization","date":"2017-05-30","arxiv_id":"1705.10528","repositories_listed":10,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/constrained-policy-optimization#ran","syntology_url":"https://syntology.ai/paper/1705.10528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.10528"}},"official":null}},{"url":"/paper/counterfactual-multi-agent-policy-gradients","slug":"counterfactual-multi-agent-policy-gradients","title":"Counterfactual Multi-Agent Policy Gradients","date":"2017-05-24","arxiv_id":"1705.08926","repositories_listed":7,"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/counterfactual-multi-agent-policy-gradients#ran","syntology_url":"https://syntology.ai/paper/1705.08926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.08926"}},"official":null}},{"url":"/paper/concrete-dropout","slug":"concrete-dropout","title":"Concrete Dropout","date":"2017-05-22","arxiv_id":"1705.07832","repositories_listed":5,"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":0,"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/concrete-dropout#ran","syntology_url":"https://syntology.ai/paper/1705.07832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07832"}},"official":null}},{"url":"/paper/learning-combinatorial-optimization","slug":"learning-combinatorial-optimization","title":"Learning Combinatorial Optimization Algorithms over Graphs","date":"2017-04-05","arxiv_id":"1704.01665","repositories_listed":8,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-combinatorial-optimization#ran","syntology_url":"https://syntology.ai/paper/1704.01665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01665"}},"official":{"repos":["Hanjun-Dai/graph_comb_opt"],"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-cooperative-visual-dialog-agents","slug":"learning-cooperative-visual-dialog-agents","title":"Learning Cooperative Visual Dialog Agents with Deep Reinforcement Learning","date":"2017-03-20","arxiv_id":"1703.06585","repositories_listed":7,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-cooperative-visual-dialog-agents#ran","syntology_url":"https://syntology.ai/paper/1703.06585","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06585"}},"official":null}},{"url":"/paper/evolution-strategies-as-a-scalable","slug":"evolution-strategies-as-a-scalable","title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning","date":"2017-03-10","arxiv_id":"1703.03864","repositories_listed":23,"syntology":{"n":29,"n_ran":16,"n_constructed":0,"n_ran_checked":11,"n_instrument":5,"n_unverified":13,"n_honours":0,"n_violates":1,"n_no_contract":10,"n_pointer_only":2,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 1 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/evolution-strategies-as-a-scalable#ran","syntology_url":"https://syntology.ai/paper/1703.03864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.03864"}},"official":{"repos":["openai/evolution-strategies-starter"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/model-agnostic-meta-learning-for-fast","slug":"model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","arxiv_id":"1703.03400","repositories_listed":85,"syntology":{"n":154,"n_ran":103,"n_constructed":35,"n_ran_checked":72,"n_instrument":31,"n_unverified":51,"n_honours":6,"n_violates":1,"n_no_contract":65,"n_pointer_only":57,"phrase":"103 ran (of which 35 constructed an object rather than computing a result; 72 with no instrument failure: 6 honoured, 1 violated, 65 with no contract checked; 31 where Syntology's instrument failed) · 51 unverified","sample_list":"/paper/model-agnostic-meta-learning-for-fast#ran","syntology_url":"https://syntology.ai/paper/1703.03400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.03400"}},"official":{"repos":["cbfinn/maml","cbfinn/maml_rl"],"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","unlocated"]}}},{"url":"/paper/robust-adversarial-reinforcement-learning","slug":"robust-adversarial-reinforcement-learning","title":"Robust Adversarial Reinforcement Learning","date":"2017-03-08","arxiv_id":"1703.02702","repositories_listed":7,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/robust-adversarial-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1703.02702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.02702"}},"official":null}},{"url":"/paper/neural-episodic-control","slug":"neural-episodic-control","title":"Neural Episodic Control","date":"2017-03-06","arxiv_id":"1703.01988","repositories_listed":4,"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/neural-episodic-control#ran","syntology_url":"https://syntology.ai/paper/1703.01988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01988"}},"official":null}},{"url":"/paper/end-to-end-task-completion-neural-dialogue","slug":"end-to-end-task-completion-neural-dialogue","title":"End-to-End Task-Completion Neural Dialogue Systems","date":"2017-03-03","arxiv_id":"1703.01008","repositories_listed":13,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"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) · 4 unverified","sample_list":"/paper/end-to-end-task-completion-neural-dialogue#ran","syntology_url":"https://syntology.ai/paper/1703.01008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01008"}},"official":{"repos":["MiuLab/TC-Bot"],"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/count-based-exploration-with-neural-density","slug":"count-based-exploration-with-neural-density","title":"Count-Based Exploration with Neural Density Models","date":"2017-03-03","arxiv_id":"1703.01310","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/count-based-exploration-with-neural-density#ran","syntology_url":"https://syntology.ai/paper/1703.01310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01310"}},"official":null}},{"url":"/paper/active-one-shot-learning","slug":"active-one-shot-learning","title":"Active One-shot Learning","date":"2017-02-21","arxiv_id":"1702.06559","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/active-one-shot-learning#ran","syntology_url":"https://syntology.ai/paper/1702.06559","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.06559"}},"official":{"repos":["markpwoodward/active_osl"],"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/hybrid-code-networks-practical-and-efficient","slug":"hybrid-code-networks-practical-and-efficient","title":"Hybrid Code Networks: practical and efficient end-to-end dialog control with supervised and reinforcement learning","date":"2017-02-10","arxiv_id":"1702.03274","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hybrid-code-networks-practical-and-efficient#ran","syntology_url":"https://syntology.ai/paper/1702.03274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.03274"}},"official":null}},{"url":"/paper/pathnet-evolution-channels-gradient-descent","slug":"pathnet-evolution-channels-gradient-descent","title":"PathNet: Evolution Channels Gradient Descent in Super Neural Networks","date":"2017-01-30","arxiv_id":"1701.08734","repositories_listed":1,"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/pathnet-evolution-channels-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/1701.08734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.08734"}},"official":null}},{"url":"/paper/adversarial-learning-for-neural-dialogue","slug":"adversarial-learning-for-neural-dialogue","title":"Adversarial Learning for Neural Dialogue Generation","date":"2017-01-23","arxiv_id":"1701.06547","repositories_listed":8,"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":2,"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/adversarial-learning-for-neural-dialogue#ran","syntology_url":"https://syntology.ai/paper/1701.06547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.06547"}},"official":null}},{"url":"/paper/cryptocurrency-portfolio-management-with-deep","slug":"cryptocurrency-portfolio-management-with-deep","title":"Cryptocurrency Portfolio Management with Deep Reinforcement Learning","date":"2016-12-05","arxiv_id":"1612.01277","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cryptocurrency-portfolio-management-with-deep#ran","syntology_url":"https://syntology.ai/paper/1612.01277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.01277"}},"official":{"repos":["ZhengyaoJiang/PGPortfolio"],"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":["listed","official"]}}},{"url":"/paper/self-critical-sequence-training-for-image","slug":"self-critical-sequence-training-for-image","title":"Self-critical Sequence Training for Image Captioning","date":"2016-12-02","arxiv_id":"1612.00563","repositories_listed":31,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":5,"n_instrument":7,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":3,"phrase":"12 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; 7 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-critical-sequence-training-for-image#ran","syntology_url":"https://syntology.ai/paper/1612.00563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.00563"}},"official":null}},{"url":"/paper/neural-combinatorial-optimization-with","slug":"neural-combinatorial-optimization-with","title":"Neural Combinatorial Optimization with Reinforcement Learning","date":"2016-11-29","arxiv_id":"1611.09940","repositories_listed":10,"syntology":{"n":20,"n_ran":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":7,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/neural-combinatorial-optimization-with#ran","syntology_url":"https://syntology.ai/paper/1611.09940","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.09940"}},"official":null}},{"url":"/paper/learning-to-reinforcement-learn","slug":"learning-to-reinforcement-learn","title":"Learning to reinforcement learn","date":"2016-11-17","arxiv_id":"1611.05763","repositories_listed":9,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":13,"phrase":"8 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; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/learning-to-reinforcement-learn#ran","syntology_url":"https://syntology.ai/paper/1611.05763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.05763"}},"official":null}},{"url":"/paper/a-connection-between-generative-adversarial","slug":"a-connection-between-generative-adversarial","title":"A Connection between Generative Adversarial Networks, Inverse Reinforcement Learning, and Energy-Based Models","date":"2016-11-11","arxiv_id":"1611.03852","repositories_listed":3,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-connection-between-generative-adversarial#ran","syntology_url":"https://syntology.ai/paper/1611.03852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.03852"}},"official":null}},{"url":"/paper/rl2-fast-reinforcement-learning-via-slow","slug":"rl2-fast-reinforcement-learning-via-slow","title":"RL$^2$: Fast Reinforcement Learning via Slow Reinforcement Learning","date":"2016-11-09","arxiv_id":"1611.02779","repositories_listed":19,"syntology":{"n":21,"n_ran":11,"n_constructed":6,"n_ran_checked":8,"n_instrument":3,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"11 ran (of which 6 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/rl2-fast-reinforcement-learning-via-slow#ran","syntology_url":"https://syntology.ai/paper/1611.02779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.02779"}},"official":null}},{"url":"/paper/designing-neural-network-architectures-using","slug":"designing-neural-network-architectures-using","title":"Designing Neural Network Architectures using Reinforcement Learning","date":"2016-11-07","arxiv_id":"1611.02167","repositories_listed":5,"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/designing-neural-network-architectures-using#ran","syntology_url":"https://syntology.ai/paper/1611.02167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.02167"}},"official":null}},{"url":"/paper/modular-multitask-reinforcement-learning-with","slug":"modular-multitask-reinforcement-learning-with","title":"Modular Multitask Reinforcement Learning with Policy Sketches","date":"2016-11-06","arxiv_id":"1611.01796","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modular-multitask-reinforcement-learning-with#ran","syntology_url":"https://syntology.ai/paper/1611.01796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01796"}},"official":{"repos":["jacobandreas/psketch"],"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/neural-architecture-search-with-reinforcement","slug":"neural-architecture-search-with-reinforcement","title":"Neural Architecture Search with Reinforcement Learning","date":"2016-11-05","arxiv_id":"1611.01578","repositories_listed":12,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-architecture-search-with-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1611.01578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01578"}},"official":{"repos":["tensorflow/models"],"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/grad-cam-visual-explanations-from-deep","slug":"grad-cam-visual-explanations-from-deep","title":"Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localization","date":"2016-10-07","arxiv_id":"1610.02391","repositories_listed":126,"syntology":{"n":141,"n_ran":90,"n_constructed":32,"n_ran_checked":65,"n_instrument":25,"n_unverified":51,"n_honours":5,"n_violates":4,"n_no_contract":56,"n_pointer_only":69,"phrase":"90 ran (of which 32 constructed an object rather than computing a result; 65 with no instrument failure: 5 honoured, 4 violated, 56 with no contract checked; 25 where Syntology's instrument failed) · 51 unverified","sample_list":"/paper/grad-cam-visual-explanations-from-deep#ran","syntology_url":"https://syntology.ai/paper/1610.02391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.02391"}},"official":{"repos":["ramprs/grad-cam"],"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/input-convex-neural-networks","slug":"input-convex-neural-networks","title":"Input Convex Neural Networks","date":"2016-09-22","arxiv_id":"1609.07152","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/input-convex-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1609.07152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.07152"}},"official":{"repos":["locuslab/icnn"],"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/seqgan-sequence-generative-adversarial-nets","slug":"seqgan-sequence-generative-adversarial-nets","title":"SeqGAN: Sequence Generative Adversarial Nets with Policy Gradient","date":"2016-09-18","arxiv_id":"1609.05473","repositories_listed":23,"syntology":{"n":21,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":7,"n_honours":7,"n_violates":1,"n_no_contract":4,"n_pointer_only":13,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 7 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/seqgan-sequence-generative-adversarial-nets#ran","syntology_url":"https://syntology.ai/paper/1609.05473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.05473"}},"official":{"repos":["LantaoYu/SeqGAN"],"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-option-critic-architecture","slug":"the-option-critic-architecture","title":"The Option-Critic Architecture","date":"2016-09-16","arxiv_id":"1609.05140","repositories_listed":10,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-option-critic-architecture#ran","syntology_url":"https://syntology.ai/paper/1609.05140","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.05140"}},"official":null}},{"url":"/paper/progressive-neural-networks","slug":"progressive-neural-networks","title":"Progressive Neural Networks","date":"2016-06-15","arxiv_id":"1606.04671","repositories_listed":12,"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":3,"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/progressive-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1606.04671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.04671"}},"official":null}},{"url":"/paper/generative-adversarial-imitation-learning","slug":"generative-adversarial-imitation-learning","title":"Generative Adversarial Imitation Learning","date":"2016-06-10","arxiv_id":"1606.03476","repositories_listed":18,"syntology":{"n":36,"n_ran":24,"n_constructed":6,"n_ran_checked":22,"n_instrument":2,"n_unverified":12,"n_honours":2,"n_violates":1,"n_no_contract":19,"n_pointer_only":15,"phrase":"24 ran (of which 6 constructed an object rather than computing a result; 22 with no instrument failure: 2 honoured, 1 violated, 19 with no contract checked; 2 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/generative-adversarial-imitation-learning#ran","syntology_url":"https://syntology.ai/paper/1606.03476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.03476"}},"official":null}},{"url":"/paper/deep-successor-reinforcement-learning","slug":"deep-successor-reinforcement-learning","title":"Deep Successor Reinforcement Learning","date":"2016-06-08","arxiv_id":"1606.02396","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/deep-successor-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1606.02396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.02396"}},"official":{"repos":["Ardavans/DSR"],"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/openai-gym","slug":"openai-gym","title":"OpenAI Gym","date":"2016-06-05","arxiv_id":"1606.01540","repositories_listed":45,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/openai-gym#ran","syntology_url":"https://syntology.ai/paper/1606.01540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01540"}},"official":null}},{"url":"/paper/vime-variational-information-maximizing","slug":"vime-variational-information-maximizing","title":"VIME: Variational Information Maximizing Exploration","date":"2016-05-31","arxiv_id":"1605.09674","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/vime-variational-information-maximizing#ran","syntology_url":"https://syntology.ai/paper/1605.09674","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.09674"}},"official":null}},{"url":"/paper/vizdoom-a-doom-based-ai-research-platform-for","slug":"vizdoom-a-doom-based-ai-research-platform-for","title":"ViZDoom: A Doom-based AI Research Platform for Visual Reinforcement Learning","date":"2016-05-06","arxiv_id":"1605.02097","repositories_listed":10,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/vizdoom-a-doom-based-ai-research-platform-for#ran","syntology_url":"https://syntology.ai/paper/1605.02097","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.02097"}},"official":{"repos":["mwydmuch/ViZDoom"],"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/benchmarking-deep-reinforcement-learning-for","slug":"benchmarking-deep-reinforcement-learning-for","title":"Benchmarking Deep Reinforcement Learning for Continuous Control","date":"2016-04-22","arxiv_id":"1604.06778","repositories_listed":15,"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/benchmarking-deep-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/1604.06778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.06778"}},"official":{"repos":["rllab/rllab"],"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/continuous-deep-q-learning-with-model-based","slug":"continuous-deep-q-learning-with-model-based","title":"Continuous Deep Q-Learning with Model-based Acceleration","date":"2016-03-02","arxiv_id":"1603.00748","repositories_listed":8,"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/continuous-deep-q-learning-with-model-based#ran","syntology_url":"https://syntology.ai/paper/1603.00748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.00748"}},"official":null}},{"url":"/paper/weight-normalization-a-simple","slug":"weight-normalization-a-simple","title":"Weight Normalization: A Simple Reparameterization to Accelerate Training of Deep Neural Networks","date":"2016-02-25","arxiv_id":"1602.07868","repositories_listed":9,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 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; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/weight-normalization-a-simple#ran","syntology_url":"https://syntology.ai/paper/1602.07868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.07868"}},"official":{"repos":["TimSalimans/weight_norm"],"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-exploration-via-bootstrapped-dqn","slug":"deep-exploration-via-bootstrapped-dqn","title":"Deep Exploration via Bootstrapped DQN","date":"2016-02-15","arxiv_id":"1602.04621","repositories_listed":6,"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/deep-exploration-via-bootstrapped-dqn#ran","syntology_url":"https://syntology.ai/paper/1602.04621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.04621"}},"official":null}},{"url":"/paper/value-iteration-networks","slug":"value-iteration-networks","title":"Value Iteration Networks","date":"2016-02-09","arxiv_id":"1602.02867","repositories_listed":8,"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/value-iteration-networks#ran","syntology_url":"https://syntology.ai/paper/1602.02867","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.02867"}},"official":{"repos":["avivt/VIN"],"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/asynchronous-methods-for-deep-reinforcement","slug":"asynchronous-methods-for-deep-reinforcement","title":"Asynchronous Methods for Deep Reinforcement Learning","date":"2016-02-04","arxiv_id":"1602.01783","repositories_listed":70,"syntology":{"n":95,"n_ran":60,"n_constructed":20,"n_ran_checked":51,"n_instrument":9,"n_unverified":35,"n_honours":2,"n_violates":1,"n_no_contract":48,"n_pointer_only":20,"phrase":"60 ran (of which 20 constructed an object rather than computing a result; 51 with no instrument failure: 2 honoured, 1 violated, 48 with no contract checked; 9 where Syntology's instrument failed) · 35 unverified","sample_list":"/paper/asynchronous-methods-for-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1602.01783","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.01783"}},"official":null}},{"url":"/paper/learning-to-compose-neural-networks-for","slug":"learning-to-compose-neural-networks-for","title":"Learning to Compose Neural Networks for Question Answering","date":"2016-01-07","arxiv_id":"1601.01705","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/learning-to-compose-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/1601.01705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1601.01705"}},"official":{"repos":["jacobandreas/nmn2"],"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/dueling-network-architectures-for-deep","slug":"dueling-network-architectures-for-deep","title":"Dueling Network Architectures for Deep Reinforcement Learning","date":"2015-11-20","arxiv_id":"1511.06581","repositories_listed":73,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":3,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/dueling-network-architectures-for-deep#ran","syntology_url":"https://syntology.ai/paper/1511.06581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06581"}},"official":null}},{"url":"/paper/prioritized-experience-replay","slug":"prioritized-experience-replay","title":"Prioritized Experience Replay","date":"2015-11-18","arxiv_id":"1511.05952","repositories_listed":77,"syntology":{"n":111,"n_ran":80,"n_constructed":62,"n_ran_checked":72,"n_instrument":8,"n_unverified":31,"n_honours":4,"n_violates":0,"n_no_contract":68,"n_pointer_only":43,"phrase":"80 ran (of which 62 constructed an object rather than computing a result; 72 with no instrument failure: 4 honoured, 0 violated, 68 with no contract checked; 8 where Syntology's instrument failed) · 31 unverified","sample_list":"/paper/prioritized-experience-replay#ran","syntology_url":"https://syntology.ai/paper/1511.05952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05952"}},"official":null}},{"url":"/paper/deep-reinforcement-learning-in-parameterized","slug":"deep-reinforcement-learning-in-parameterized","title":"Deep Reinforcement Learning in Parameterized Action Space","date":"2015-11-13","arxiv_id":"1511.04143","repositories_listed":7,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-reinforcement-learning-in-parameterized#ran","syntology_url":"https://syntology.ai/paper/1511.04143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.04143"}},"official":{"repos":["mhauskn/dqn-hfo"],"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-reinforcement-learning-with-double-q","slug":"deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","arxiv_id":"1509.06461","repositories_listed":97,"syntology":{"n":106,"n_ran":56,"n_constructed":38,"n_ran_checked":55,"n_instrument":1,"n_unverified":50,"n_honours":0,"n_violates":0,"n_no_contract":55,"n_pointer_only":57,"phrase":"56 ran (of which 38 constructed an object rather than computing a result; 55 with no instrument failure: 0 honoured, 0 violated, 55 with no contract checked; 1 where Syntology's instrument failed) · 50 unverified","sample_list":"/paper/deep-reinforcement-learning-with-double-q#ran","syntology_url":"https://syntology.ai/paper/1509.06461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.06461"}},"official":null}},{"url":"/paper/continuous-control-with-deep-reinforcement","slug":"continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","arxiv_id":"1509.02971","repositories_listed":161,"syntology":{"n":306,"n_ran":163,"n_constructed":126,"n_ran_checked":152,"n_instrument":11,"n_unverified":143,"n_honours":3,"n_violates":0,"n_no_contract":149,"n_pointer_only":163,"phrase":"163 ran (of which 126 constructed an object rather than computing a result; 152 with no instrument failure: 3 honoured, 0 violated, 149 with no contract checked; 11 where Syntology's instrument failed) · 143 unverified","sample_list":"/paper/continuous-control-with-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1509.02971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.02971"}},"official":null}},{"url":"/paper/reinforcement-learning-with-parameterized","slug":"reinforcement-learning-with-parameterized","title":"Reinforcement Learning with Parameterized Actions","date":"2015-09-05","arxiv_id":"1509.01644","repositories_listed":3,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reinforcement-learning-with-parameterized#ran","syntology_url":"https://syntology.ai/paper/1509.01644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.01644"}},"official":null}},{"url":"/paper/maximum-entropy-deep-inverse-reinforcement","slug":"maximum-entropy-deep-inverse-reinforcement","title":"Maximum Entropy Deep Inverse Reinforcement Learning","date":"2015-07-17","arxiv_id":"1507.04888","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/maximum-entropy-deep-inverse-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1507.04888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1507.04888"}},"official":null}},{"url":"/paper/high-dimensional-continuous-control-using","slug":"high-dimensional-continuous-control-using","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","date":"2015-06-08","arxiv_id":"1506.02438","repositories_listed":17,"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/high-dimensional-continuous-control-using#ran","syntology_url":"https://syntology.ai/paper/1506.02438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.02438"}},"official":null}},{"url":"/paper/dropout-as-a-bayesian-approximation","slug":"dropout-as-a-bayesian-approximation","title":"Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learning","date":"2015-06-06","arxiv_id":"1506.02142","repositories_listed":29,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":2,"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: 0 honoured, 2 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dropout-as-a-bayesian-approximation#ran","syntology_url":"https://syntology.ai/paper/1506.02142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.02142"}},"official":null}},{"url":"/paper/weight-uncertainty-in-neural-networks","slug":"weight-uncertainty-in-neural-networks","title":"Weight Uncertainty in Neural Networks","date":"2015-05-20","arxiv_id":"1505.05424","repositories_listed":38,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":5,"n_instrument":7,"n_unverified":3,"n_honours":4,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 1 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/weight-uncertainty-in-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1505.05424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1505.05424"}},"official":null}},{"url":"/paper/multiple-object-recognition-with-visual","slug":"multiple-object-recognition-with-visual","title":"Multiple Object Recognition with Visual Attention","date":"2014-12-24","arxiv_id":"1412.7755","repositories_listed":5,"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":3,"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/multiple-object-recognition-with-visual#ran","syntology_url":"https://syntology.ai/paper/1412.7755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.7755"}},"official":null}},{"url":"/paper/recurrent-models-of-visual-attention","slug":"recurrent-models-of-visual-attention","title":"Recurrent Models of Visual Attention","date":"2014-06-24","arxiv_id":"1406.6247","repositories_listed":20,"syntology":{"n":24,"n_ran":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":3,"n_honours":4,"n_violates":2,"n_no_contract":14,"n_pointer_only":2,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 4 honoured, 2 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/recurrent-models-of-visual-attention#ran","syntology_url":"https://syntology.ai/paper/1406.6247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.6247"}},"official":null}},{"url":"/paper/playing-atari-with-deep-reinforcement","slug":"playing-atari-with-deep-reinforcement","title":"Playing Atari with Deep Reinforcement Learning","date":"2013-12-19","arxiv_id":"1312.5602","repositories_listed":112,"syntology":{"n":117,"n_ran":64,"n_constructed":24,"n_ran_checked":46,"n_instrument":18,"n_unverified":53,"n_honours":5,"n_violates":0,"n_no_contract":41,"n_pointer_only":56,"phrase":"64 ran (of which 24 constructed an object rather than computing a result; 46 with no instrument failure: 5 honoured, 0 violated, 41 with no contract checked; 18 where Syntology's instrument failed) · 53 unverified","sample_list":"/paper/playing-atari-with-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1312.5602","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1312.5602"}},"official":null}},{"url":"/paper/the-arcade-learning-environment-an-evaluation","slug":"the-arcade-learning-environment-an-evaluation","title":"The Arcade Learning Environment: An Evaluation Platform for General Agents","date":"2012-07-19","arxiv_id":"1207.4708","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-arcade-learning-environment-an-evaluation#ran","syntology_url":"https://syntology.ai/paper/1207.4708","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1207.4708"}},"official":null}},{"url":"/paper/off-policy-actor-critic","slug":"off-policy-actor-critic","title":"Off-Policy Actor-Critic","date":"2012-05-22","arxiv_id":"1205.4839","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/off-policy-actor-critic#ran","syntology_url":"https://syntology.ai/paper/1205.4839","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1205.4839"}},"official":null}},{"url":"/paper/a-tutorial-on-bayesian-optimization-of","slug":"a-tutorial-on-bayesian-optimization-of","title":"A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning","date":"2010-12-12","arxiv_id":"1012.2599","repositories_listed":15,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/a-tutorial-on-bayesian-optimization-of#ran","syntology_url":"https://syntology.ai/paper/1012.2599","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1012.2599"}},"official":null}},{"url":"/paper/quantum-reinforcement-learning","slug":"quantum-reinforcement-learning","title":"Quantum reinforcement learning","date":"2008-10-21","arxiv_id":"0810.3828","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quantum-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/0810.3828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"0810.3828"}},"official":null}}],"record_sha256":"039132fac3b0a27af113c05afa1987275ae6136a9f1b34e513f8b2c3ac051d83","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}