{"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/classification/papers/ran/7","list_of":"/task/classification","task":"General Classification","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":7,"pages_in_order":8,"rows_per_page":100,"rows":[601,700],"of":713,"counts":{"archive_papers_tagged":14581,"with_a_code_link":3945,"where_syntology_ran_a_sample":713,"not_listed_spam_title":0,"listed":14581,"listed_where_code_ran":713,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":560,"every_run_a_failure_of_syntologys_instrument":153,"listed_with_a_run_with_no_instrument_failure":560,"listed_every_run_a_failure_of_syntologys_instrument":153,"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/classification/papers/ran/1","prev":"/task/classification/papers/ran/6","next":"/task/classification/papers/ran/8","papers":[{"url":"/paper/multi-task-learning-using-uncertainty-to","slug":"multi-task-learning-using-uncertainty-to","title":"Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semantics","date":"2017-05-19","arxiv_id":"1705.07115","repositories_listed":19,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-task-learning-using-uncertainty-to#ran","syntology_url":"https://syntology.ai/paper/1705.07115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07115"}},"official":null}},{"url":"/paper/chestx-ray8-hospital-scale-chest-x-ray","slug":"chestx-ray8-hospital-scale-chest-x-ray","title":"ChestX-ray8: Hospital-scale Chest X-ray Database and Benchmarks on Weakly-Supervised Classification and Localization of Common Thorax Diseases","date":"2017-05-05","arxiv_id":"1705.02315","repositories_listed":26,"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/chestx-ray8-hospital-scale-chest-x-ray#ran","syntology_url":"https://syntology.ai/paper/1705.02315","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.02315"}},"official":null}},{"url":"/paper/learning-with-confident-examples-rank-pruning","slug":"learning-with-confident-examples-rank-pruning","title":"Learning with Confident Examples: Rank Pruning for Robust Classification with Noisy Labels","date":"2017-05-04","arxiv_id":"1705.01936","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-with-confident-examples-rank-pruning#ran","syntology_url":"https://syntology.ai/paper/1705.01936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.01936"}},"official":{"repos":["cgnorthcutt/rankpruning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/residual-attention-network-for-image","slug":"residual-attention-network-for-image","title":"Residual Attention Network for Image Classification","date":"2017-04-23","arxiv_id":"1704.06904","repositories_listed":19,"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/residual-attention-network-for-image#ran","syntology_url":"https://syntology.ai/paper/1704.06904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.06904"}},"official":null}},{"url":"/paper/multi-scale-dense-networks-for-resource","slug":"multi-scale-dense-networks-for-resource","title":"Multi-Scale Dense Networks for Resource Efficient Image Classification","date":"2017-03-29","arxiv_id":"1703.09844","repositories_listed":7,"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/multi-scale-dense-networks-for-resource#ran","syntology_url":"https://syntology.ai/paper/1703.09844","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.09844"}},"official":null}},{"url":"/paper/transfer-learning-for-music-classification","slug":"transfer-learning-for-music-classification","title":"Transfer learning for music classification and regression tasks","date":"2017-03-27","arxiv_id":"1703.09179","repositories_listed":3,"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/transfer-learning-for-music-classification#ran","syntology_url":"https://syntology.ai/paper/1703.09179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.09179"}},"official":{"repos":["keunwoochoi/transfer_learning_music"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/in-defense-of-the-triplet-loss-for-person-re","slug":"in-defense-of-the-triplet-loss-for-person-re","title":"In Defense of the Triplet Loss for Person Re-Identification","date":"2017-03-22","arxiv_id":"1703.07737","repositories_listed":31,"syntology":{"n":46,"n_ran":39,"n_constructed":0,"n_ran_checked":37,"n_instrument":2,"n_unverified":7,"n_honours":3,"n_violates":0,"n_no_contract":34,"n_pointer_only":2,"phrase":"39 ran (of which 0 constructed an object rather than computing a result; 37 with no instrument failure: 3 honoured, 0 violated, 34 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/in-defense-of-the-triplet-loss-for-person-re#ran","syntology_url":"https://syntology.ai/paper/1703.07737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.07737"}},"official":null}},{"url":"/paper/multitask-learning-and-benchmarking-with","slug":"multitask-learning-and-benchmarking-with","title":"Multitask learning and benchmarking with clinical time series data","date":"2017-03-22","arxiv_id":"1703.07771","repositories_listed":11,"syntology":{"n":40,"n_ran":25,"n_constructed":0,"n_ran_checked":21,"n_instrument":4,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":21,"n_pointer_only":5,"phrase":"25 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 4 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/multitask-learning-and-benchmarking-with#ran","syntology_url":"https://syntology.ai/paper/1703.07771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.07771"}},"official":{"repos":["yerevann/mimic3-benchmarks"],"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":["listed","official"]}}},{"url":"/paper/modeling-relational-data-with-graph","slug":"modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":18,"n_constructed":3,"n_ran_checked":13,"n_instrument":5,"n_unverified":14,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":15,"phrase":"18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/modeling-relational-data-with-graph#ran","syntology_url":"https://syntology.ai/paper/1703.06103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06103"}},"official":{"repos":["tkipf/relational-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/prototypical-networks-for-few-shot-learning","slug":"prototypical-networks-for-few-shot-learning","title":"Prototypical Networks for Few-shot Learning","date":"2017-03-15","arxiv_id":"1703.05175","repositories_listed":43,"syntology":{"n":64,"n_ran":50,"n_constructed":14,"n_ran_checked":29,"n_instrument":21,"n_unverified":14,"n_honours":5,"n_violates":0,"n_no_contract":24,"n_pointer_only":19,"phrase":"50 ran (of which 14 constructed an object rather than computing a result; 29 with no instrument failure: 5 honoured, 0 violated, 24 with no contract checked; 21 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/prototypical-networks-for-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/1703.05175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.05175"}},"official":{"repos":["jakesnell/prototypical-networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/continual-learning-through-synaptic","slug":"continual-learning-through-synaptic","title":"Continual Learning Through Synaptic Intelligence","date":"2017-03-13","arxiv_id":"1703.04200","repositories_listed":6,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/continual-learning-through-synaptic#ran","syntology_url":"https://syntology.ai/paper/1703.04200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04200"}},"official":{"repos":["ganguli-lab/pathint"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-structured-self-attentive-sentence","slug":"a-structured-self-attentive-sentence","title":"A Structured Self-attentive Sentence Embedding","date":"2017-03-09","arxiv_id":"1703.03130","repositories_listed":52,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"10 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-structured-self-attentive-sentence#ran","syntology_url":"https://syntology.ai/paper/1703.03130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.03130"}},"official":null}},{"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/machine-learning-on-sequential-data-using-a","slug":"machine-learning-on-sequential-data-using-a","title":"Machine Learning on Sequential Data Using a Recurrent Weighted Average","date":"2017-03-03","arxiv_id":"1703.01253","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 0 unverified","sample_list":"/paper/machine-learning-on-sequential-data-using-a#ran","syntology_url":"https://syntology.ai/paper/1703.01253","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01253"}},"official":{"repos":["jostmey/rwa"],"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/attentive-recurrent-comparators","slug":"attentive-recurrent-comparators","title":"Attentive Recurrent Comparators","date":"2017-03-02","arxiv_id":"1703.00767","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/attentive-recurrent-comparators#ran","syntology_url":"https://syntology.ai/paper/1703.00767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.00767"}},"official":null}},{"url":"/paper/borrowing-treasures-from-the-wealthy-deep","slug":"borrowing-treasures-from-the-wealthy-deep","title":"Borrowing Treasures from the Wealthy: Deep Transfer Learning through Selective Joint Fine-tuning","date":"2017-02-28","arxiv_id":"1702.08690","repositories_listed":1,"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/borrowing-treasures-from-the-wealthy-deep#ran","syntology_url":"https://syntology.ai/paper/1702.08690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.08690"}},"official":{"repos":["ZYYSzj/Selective-Joint-Fine-tuning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/boosted-generative-models","slug":"boosted-generative-models","title":"Boosted Generative Models","date":"2017-02-27","arxiv_id":"1702.08484","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/boosted-generative-models#ran","syntology_url":"https://syntology.ai/paper/1702.08484","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.08484"}},"official":{"repos":["ermongroup/bgm"],"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/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/emnist-an-extension-of-mnist-to-handwritten","slug":"emnist-an-extension-of-mnist-to-handwritten","title":"EMNIST: an extension of MNIST to handwritten letters","date":"2017-02-17","arxiv_id":"1702.05373","repositories_listed":31,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/emnist-an-extension-of-mnist-to-handwritten#ran","syntology_url":"https://syntology.ai/paper/1702.05373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.05373"}},"official":null}},{"url":"/paper/adversarial-discriminative-domain-adaptation","slug":"adversarial-discriminative-domain-adaptation","title":"Adversarial Discriminative Domain Adaptation","date":"2017-02-17","arxiv_id":"1702.05464","repositories_listed":20,"syntology":{"n":48,"n_ran":14,"n_constructed":5,"n_ran_checked":7,"n_instrument":7,"n_unverified":34,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"14 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; 7 where Syntology's instrument failed) · 34 unverified","sample_list":"/paper/adversarial-discriminative-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1702.05464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.05464"}},"official":null}},{"url":"/paper/gated-multimodal-units-for-information-fusion","slug":"gated-multimodal-units-for-information-fusion","title":"Gated Multimodal Units for Information Fusion","date":"2017-02-07","arxiv_id":"1702.01992","repositories_listed":9,"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/gated-multimodal-units-for-information-fusion#ran","syntology_url":"https://syntology.ai/paper/1702.01992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.01992"}},"official":{"repos":["johnarevalo/gmu-mmimdb"],"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/all-but-the-top-simple-and-effective","slug":"all-but-the-top-simple-and-effective","title":"All-but-the-Top: Simple and Effective Postprocessing for Word Representations","date":"2017-02-05","arxiv_id":"1702.01417","repositories_listed":4,"syntology":{"n":26,"n_ran":21,"n_constructed":0,"n_ran_checked":21,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":21,"n_pointer_only":2,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/all-but-the-top-simple-and-effective#ran","syntology_url":"https://syntology.ai/paper/1702.01417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.01417"}},"official":null}},{"url":"/paper/dirty-pixels-optimizing-image-classification","slug":"dirty-pixels-optimizing-image-classification","title":"Dirty Pixels: Towards End-to-End Image Processing and Perception","date":"2017-01-23","arxiv_id":"1701.06487","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/dirty-pixels-optimizing-image-classification#ran","syntology_url":"https://syntology.ai/paper/1701.06487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.06487"}},"official":{"repos":["princeton-computational-imaging/DirtyPixels"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/cost-effective-active-learning-for-deep-image","slug":"cost-effective-active-learning-for-deep-image","title":"Cost-Effective Active Learning for Deep Image Classification","date":"2017-01-13","arxiv_id":"1701.03551","repositories_listed":4,"syntology":{"n":13,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"7 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; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/cost-effective-active-learning-for-deep-image#ran","syntology_url":"https://syntology.ai/paper/1701.03551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.03551"}},"official":null}},{"url":"/paper/distinguishing-antonyms-and-synonyms-in-a","slug":"distinguishing-antonyms-and-synonyms-in-a","title":"Distinguishing Antonyms and Synonyms in a Pattern-based Neural Network","date":"2017-01-11","arxiv_id":"1701.02962","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/distinguishing-antonyms-and-synonyms-in-a#ran","syntology_url":"https://syntology.ai/paper/1701.02962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.02962"}},"official":{"repos":["nguyenkh/AntSynNET"],"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/salgan-visual-saliency-prediction-with","slug":"salgan-visual-saliency-prediction-with","title":"SalGAN: Visual Saliency Prediction with Generative Adversarial Networks","date":"2017-01-04","arxiv_id":"1701.01081","repositories_listed":4,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/salgan-visual-saliency-prediction-with#ran","syntology_url":"https://syntology.ai/paper/1701.01081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.01081"}},"official":{"repos":["imatge-upc/salgan"],"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/yolo9000-better-faster-stronger","slug":"yolo9000-better-faster-stronger","title":"YOLO9000: Better, Faster, Stronger","date":"2016-12-25","arxiv_id":"1612.08242","repositories_listed":231,"syntology":{"n":60,"n_ran":44,"n_constructed":0,"n_ran_checked":33,"n_instrument":11,"n_unverified":16,"n_honours":1,"n_violates":4,"n_no_contract":28,"n_pointer_only":23,"phrase":"44 ran (of which 0 constructed an object rather than computing a result; 33 with no instrument failure: 1 honoured, 4 violated, 28 with no contract checked; 11 where Syntology's instrument failed) · 16 unverified","sample_list":"/paper/yolo9000-better-faster-stronger#ran","syntology_url":"https://syntology.ai/paper/1612.08242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.08242"}},"official":null}},{"url":"/paper/multinet-real-time-joint-semantic-reasoning","slug":"multinet-real-time-joint-semantic-reasoning","title":"MultiNet: Real-time Joint Semantic Reasoning for Autonomous Driving","date":"2016-12-22","arxiv_id":"1612.07695","repositories_listed":15,"syntology":{"n":42,"n_ran":18,"n_constructed":0,"n_ran_checked":15,"n_instrument":3,"n_unverified":24,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":1,"phrase":"18 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; 3 where Syntology's instrument failed) · 24 unverified","sample_list":"/paper/multinet-real-time-joint-semantic-reasoning#ran","syntology_url":"https://syntology.ai/paper/1612.07695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.07695"}},"official":{"repos":["MarvinTeichmann/MultiNet"],"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":["listed","official"]}}},{"url":"/paper/fasttextzip-compressing-text-classification","slug":"fasttextzip-compressing-text-classification","title":"FastText.zip: Compressing text classification models","date":"2016-12-12","arxiv_id":"1612.03651","repositories_listed":44,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":13,"phrase":"11 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; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/fasttextzip-compressing-text-classification#ran","syntology_url":"https://syntology.ai/paper/1612.03651","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.03651"}},"official":{"repos":["facebookresearch/fastText"],"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/inverse-compositional-spatial-transformer","slug":"inverse-compositional-spatial-transformer","title":"Inverse Compositional Spatial Transformer Networks","date":"2016-12-12","arxiv_id":"1612.03897","repositories_listed":1,"syntology":{"n":21,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":11,"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) · 11 unverified","sample_list":"/paper/inverse-compositional-spatial-transformer#ran","syntology_url":"https://syntology.ai/paper/1612.03897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.03897"}},"official":{"repos":["chenhsuanlin/inverse-compositional-STN"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/spatially-adaptive-computation-time-for","slug":"spatially-adaptive-computation-time-for","title":"Spatially Adaptive Computation Time for Residual Networks","date":"2016-12-07","arxiv_id":"1612.02297","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/spatially-adaptive-computation-time-for#ran","syntology_url":"https://syntology.ai/paper/1612.02297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.02297"}},"official":{"repos":["mfigurnov/sact"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/overcoming-catastrophic-forgetting-in-neural","slug":"overcoming-catastrophic-forgetting-in-neural","title":"Overcoming catastrophic forgetting in neural networks","date":"2016-12-02","arxiv_id":"1612.00796","repositories_listed":29,"syntology":{"n":22,"n_ran":16,"n_constructed":8,"n_ran_checked":12,"n_instrument":4,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":10,"n_pointer_only":4,"phrase":"16 ran (of which 8 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/overcoming-catastrophic-forgetting-in-neural#ran","syntology_url":"https://syntology.ai/paper/1612.00796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.00796"}},"official":null}},{"url":"/paper/finn-a-framework-for-fast-scalable-binarized","slug":"finn-a-framework-for-fast-scalable-binarized","title":"FINN: A Framework for Fast, Scalable Binarized Neural Network Inference","date":"2016-12-01","arxiv_id":"1612.07119","repositories_listed":3,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/finn-a-framework-for-fast-scalable-binarized#ran","syntology_url":"https://syntology.ai/paper/1612.07119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.07119"}},"official":null}},{"url":"/paper/fully-convolutional-instance-aware-semantic","slug":"fully-convolutional-instance-aware-semantic","title":"Fully Convolutional Instance-aware Semantic Segmentation","date":"2016-11-23","arxiv_id":"1611.07709","repositories_listed":3,"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":4,"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/fully-convolutional-instance-aware-semantic#ran","syntology_url":"https://syntology.ai/paper/1611.07709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07709"}},"official":{"repos":["daijifeng001/TA-FCN"],"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/time-series-classification-from-scratch-with","slug":"time-series-classification-from-scratch-with","title":"Time Series Classification from Scratch with Deep Neural Networks: A Strong Baseline","date":"2016-11-20","arxiv_id":"1611.06455","repositories_listed":12,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/time-series-classification-from-scratch-with#ran","syntology_url":"https://syntology.ai/paper/1611.06455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.06455"}},"official":{"repos":["cauchyturing/UCR_Time_Series_Classification_Deep_Learning_Baseline"],"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/aggregated-residual-transformations-for-deep","slug":"aggregated-residual-transformations-for-deep","title":"Aggregated Residual Transformations for Deep Neural Networks","date":"2016-11-16","arxiv_id":"1611.05431","repositories_listed":61,"syntology":{"n":80,"n_ran":51,"n_constructed":7,"n_ran_checked":31,"n_instrument":20,"n_unverified":29,"n_honours":0,"n_violates":0,"n_no_contract":31,"n_pointer_only":13,"phrase":"51 ran (of which 7 constructed an object rather than computing a result; 31 with no instrument failure: 0 honoured, 0 violated, 31 with no contract checked; 20 where Syntology's instrument failed) · 29 unverified","sample_list":"/paper/aggregated-residual-transformations-for-deep#ran","syntology_url":"https://syntology.ai/paper/1611.05431","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.05431"}},"official":{"repos":["facebookresearch/ResNeXt"],"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/incremental-sequence-learning","slug":"incremental-sequence-learning","title":"Incremental Sequence Learning","date":"2016-11-09","arxiv_id":"1611.03068","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/incremental-sequence-learning#ran","syntology_url":"https://syntology.ai/paper/1611.03068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.03068"}},"official":{"repos":["edwin-de-jong/incremental-sequence-learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/log-time-and-log-space-extreme-classification","slug":"log-time-and-log-space-extreme-classification","title":"Log-time and Log-space Extreme Classification","date":"2016-11-07","arxiv_id":"1611.01964","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/log-time-and-log-space-extreme-classification#ran","syntology_url":"https://syntology.ai/paper/1611.01964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01964"}},"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/lipnet-end-to-end-sentence-level-lipreading","slug":"lipnet-end-to-end-sentence-level-lipreading","title":"LipNet: End-to-End Sentence-level Lipreading","date":"2016-11-05","arxiv_id":"1611.01599","repositories_listed":13,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/lipnet-end-to-end-sentence-level-lipreading#ran","syntology_url":"https://syntology.ai/paper/1611.01599","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01599"}},"official":{"repos":["rizkiarm/LipNet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/categorical-reparameterization-with-gumbel","slug":"categorical-reparameterization-with-gumbel","title":"Categorical Reparameterization with Gumbel-Softmax","date":"2016-11-03","arxiv_id":"1611.01144","repositories_listed":20,"syntology":{"n":14,"n_ran":12,"n_constructed":2,"n_ran_checked":4,"n_instrument":8,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"12 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 8 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/categorical-reparameterization-with-gumbel#ran","syntology_url":"https://syntology.ai/paper/1611.01144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01144"}},"official":null}},{"url":"/paper/membership-inference-attacks-against-machine","slug":"membership-inference-attacks-against-machine","title":"Membership Inference Attacks against Machine Learning Models","date":"2016-10-18","arxiv_id":"1610.05820","repositories_listed":11,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/membership-inference-attacks-against-machine#ran","syntology_url":"https://syntology.ai/paper/1610.05820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.05820"}},"official":{"repos":["csong27/membership-inference"],"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":["found_in_text","listed"]}}},{"url":"/paper/minimax-filter-learning-to-preserve-privacy","slug":"minimax-filter-learning-to-preserve-privacy","title":"Minimax Filter: Learning to Preserve Privacy from Inference Attacks","date":"2016-10-12","arxiv_id":"1610.03577","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/minimax-filter-learning-to-preserve-privacy#ran","syntology_url":"https://syntology.ai/paper/1610.03577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.03577"}},"official":{"repos":["jihunhamm/MinimaxFilter"],"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":["official"]}}},{"url":"/paper/deep-pyramidal-residual-networks","slug":"deep-pyramidal-residual-networks","title":"Deep Pyramidal Residual Networks","date":"2016-10-10","arxiv_id":"1610.02915","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/deep-pyramidal-residual-networks#ran","syntology_url":"https://syntology.ai/paper/1610.02915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.02915"}},"official":{"repos":["jhkim89/PyramidNet"],"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/temporal-ensembling-for-semi-supervised","slug":"temporal-ensembling-for-semi-supervised","title":"Temporal Ensembling for Semi-Supervised Learning","date":"2016-10-07","arxiv_id":"1610.02242","repositories_listed":7,"syntology":{"n":7,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/temporal-ensembling-for-semi-supervised#ran","syntology_url":"https://syntology.ai/paper/1610.02242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.02242"}},"official":{"repos":["smlaine2/tempens"],"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/equality-of-opportunity-in-supervised","slug":"equality-of-opportunity-in-supervised","title":"Equality of Opportunity in Supervised Learning","date":"2016-10-07","arxiv_id":"1610.02413","repositories_listed":7,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":2,"n_honours":1,"n_violates":2,"n_no_contract":1,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/equality-of-opportunity-in-supervised#ran","syntology_url":"https://syntology.ai/paper/1610.02413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.02413"}},"official":null}},{"url":"/paper/cnn-architectures-for-large-scale-audio","slug":"cnn-architectures-for-large-scale-audio","title":"CNN Architectures for Large-Scale Audio Classification","date":"2016-09-29","arxiv_id":"1609.09430","repositories_listed":16,"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/cnn-architectures-for-large-scale-audio#ran","syntology_url":"https://syntology.ai/paper/1609.09430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.09430"}},"official":null}},{"url":"/paper/youtube-8m-a-large-scale-video-classification","slug":"youtube-8m-a-large-scale-video-classification","title":"YouTube-8M: A Large-Scale Video Classification Benchmark","date":"2016-09-27","arxiv_id":"1609.08675","repositories_listed":7,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/youtube-8m-a-large-scale-video-classification#ran","syntology_url":"https://syntology.ai/paper/1609.08675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.08675"}},"official":null}},{"url":"/paper/sampling-generative-networks","slug":"sampling-generative-networks","title":"Sampling Generative Networks","date":"2016-09-14","arxiv_id":"1609.04468","repositories_listed":13,"syntology":{"n":15,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sampling-generative-networks#ran","syntology_url":"https://syntology.ai/paper/1609.04468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.04468"}},"official":{"repos":["dribnet/plat"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":39,"n_constructed":13,"n_ran_checked":34,"n_instrument":5,"n_unverified":19,"n_honours":0,"n_violates":1,"n_no_contract":33,"n_pointer_only":23,"phrase":"39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}},"official":{"repos":["tkipf/pygcn"],"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/dismec-distributed-sparse-machines-for","slug":"dismec-distributed-sparse-machines-for","title":"DiSMEC - Distributed Sparse Machines for Extreme Multi-label Classification","date":"2016-09-08","arxiv_id":"1609.02521","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/dismec-distributed-sparse-machines-for#ran","syntology_url":"https://syntology.ai/paper/1609.02521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02521"}},"official":null}},{"url":"/paper/generative-and-discriminative-voxel-modeling","slug":"generative-and-discriminative-voxel-modeling","title":"Generative and Discriminative Voxel Modeling with Convolutional Neural Networks","date":"2016-08-15","arxiv_id":"1608.04236","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/generative-and-discriminative-voxel-modeling#ran","syntology_url":"https://syntology.ai/paper/1608.04236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.04236"}},"official":{"repos":["ajbrock/Generative-and-Discriminative-Voxel-Modeling"],"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/bag-of-tricks-for-efficient-text","slug":"bag-of-tricks-for-efficient-text","title":"Bag of Tricks for Efficient Text Classification","date":"2016-07-06","arxiv_id":"1607.01759","repositories_listed":65,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 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; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/bag-of-tricks-for-efficient-text#ran","syntology_url":"https://syntology.ai/paper/1607.01759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.01759"}},"official":{"repos":["facebookresearch/fastText"],"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/deep-recurrent-neural-networks-for-supernovae","slug":"deep-recurrent-neural-networks-for-supernovae","title":"Deep Recurrent Neural Networks for Supernovae Classification","date":"2016-06-23","arxiv_id":"1606.07442","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/deep-recurrent-neural-networks-for-supernovae#ran","syntology_url":"https://syntology.ai/paper/1606.07442","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07442"}},"official":{"repos":["adammoss/supernovae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tagger-deep-unsupervised-perceptual-grouping","slug":"tagger-deep-unsupervised-perceptual-grouping","title":"Tagger: Deep Unsupervised Perceptual Grouping","date":"2016-06-21","arxiv_id":"1606.06724","repositories_listed":2,"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/tagger-deep-unsupervised-perceptual-grouping#ran","syntology_url":"https://syntology.ai/paper/1606.06724","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.06724"}},"official":{"repos":["CuriousAI/tagger"],"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":["official"]}}},{"url":"/paper/a-scalable-end-to-end-gaussian-process","slug":"a-scalable-end-to-end-gaussian-process","title":"A scalable end-to-end Gaussian process adapter for irregularly sampled time series classification","date":"2016-06-14","arxiv_id":"1606.04443","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/a-scalable-end-to-end-gaussian-process#ran","syntology_url":"https://syntology.ai/paper/1606.04443","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.04443"}},"official":null}},{"url":"/paper/adversarial-deep-averaging-networks-for-cross","slug":"adversarial-deep-averaging-networks-for-cross","title":"Adversarial Deep Averaging Networks for Cross-Lingual Sentiment Classification","date":"2016-06-06","arxiv_id":"1606.01614","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/adversarial-deep-averaging-networks-for-cross#ran","syntology_url":"https://syntology.ai/paper/1606.01614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01614"}},"official":{"repos":["ccsasuke/adan"],"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/very-deep-convolutional-networks-for-text","slug":"very-deep-convolutional-networks-for-text","title":"Very Deep Convolutional Networks for Text Classification","date":"2016-06-06","arxiv_id":"1606.01781","repositories_listed":24,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/very-deep-convolutional-networks-for-text#ran","syntology_url":"https://syntology.ai/paper/1606.01781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01781"}},"official":null}},{"url":"/paper/aspect-level-sentiment-classification-with-1","slug":"aspect-level-sentiment-classification-with-1","title":"Aspect Level Sentiment Classification with Deep Memory Network","date":"2016-05-28","arxiv_id":"1605.08900","repositories_listed":8,"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/aspect-level-sentiment-classification-with-1#ran","syntology_url":"https://syntology.ai/paper/1605.08900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.08900"}},"official":null}},{"url":"/paper/supervised-learning-with-quantum-inspired","slug":"supervised-learning-with-quantum-inspired","title":"Supervised Learning with Quantum-Inspired Tensor Networks","date":"2016-05-18","arxiv_id":"1605.05775","repositories_listed":4,"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":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) · 2 unverified","sample_list":"/paper/supervised-learning-with-quantum-inspired#ran","syntology_url":"https://syntology.ai/paper/1605.05775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.05775"}},"official":{"repos":["emstoudenmire/TNML"],"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/crafting-adversarial-input-sequences-for","slug":"crafting-adversarial-input-sequences-for","title":"Crafting Adversarial Input Sequences for Recurrent Neural Networks","date":"2016-04-28","arxiv_id":"1604.08275","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/crafting-adversarial-input-sequences-for#ran","syntology_url":"https://syntology.ai/paper/1604.08275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.08275"}},"official":null}},{"url":"/paper/recurrent-batch-normalization","slug":"recurrent-batch-normalization","title":"Recurrent Batch Normalization","date":"2016-03-30","arxiv_id":"1603.09025","repositories_listed":3,"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/recurrent-batch-normalization#ran","syntology_url":"https://syntology.ai/paper/1603.09025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.09025"}},"official":null}},{"url":"/paper/revisiting-semi-supervised-learning-with","slug":"revisiting-semi-supervised-learning-with","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","date":"2016-03-29","arxiv_id":"1603.08861","repositories_listed":26,"syntology":{"n":28,"n_ran":15,"n_constructed":4,"n_ran_checked":13,"n_instrument":2,"n_unverified":13,"n_honours":3,"n_violates":2,"n_no_contract":8,"n_pointer_only":11,"phrase":"15 ran (of which 4 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 2 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/revisiting-semi-supervised-learning-with#ran","syntology_url":"https://syntology.ai/paper/1603.08861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.08861"}},"official":null}},{"url":"/paper/xnor-net-imagenet-classification-using-binary","slug":"xnor-net-imagenet-classification-using-binary","title":"XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networks","date":"2016-03-16","arxiv_id":"1603.05279","repositories_listed":20,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":9,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"16 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; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/xnor-net-imagenet-classification-using-binary#ran","syntology_url":"https://syntology.ai/paper/1603.05279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.05279"}},"official":null}},{"url":"/paper/xgboost-a-scalable-tree-boosting-system","slug":"xgboost-a-scalable-tree-boosting-system","title":"XGBoost: A Scalable Tree Boosting System","date":"2016-03-09","arxiv_id":"1603.02754","repositories_listed":28,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/xgboost-a-scalable-tree-boosting-system#ran","syntology_url":"https://syntology.ai/paper/1603.02754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.02754"}},"official":{"repos":["dmlc/xgboost"],"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/inception-v4-inception-resnet-and-the-impact","slug":"inception-v4-inception-resnet-and-the-impact","title":"Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learning","date":"2016-02-23","arxiv_id":"1602.07261","repositories_listed":87,"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/inception-v4-inception-resnet-and-the-impact#ran","syntology_url":"https://syntology.ai/paper/1602.07261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.07261"}},"official":null}},{"url":"/paper/from-softmax-to-sparsemax-a-sparse-model-of","slug":"from-softmax-to-sparsemax-a-sparse-model-of","title":"From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classification","date":"2016-02-05","arxiv_id":"1602.02068","repositories_listed":11,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":4,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 4 honoured, 2 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/from-softmax-to-sparsemax-a-sparse-model-of#ran","syntology_url":"https://syntology.ai/paper/1602.02068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.02068"}},"official":null}},{"url":"/paper/effective-lstms-for-target-dependent","slug":"effective-lstms-for-target-dependent","title":"Effective LSTMs for Target-Dependent Sentiment Classification","date":"2015-12-03","arxiv_id":"1512.01100","repositories_listed":10,"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/effective-lstms-for-target-dependent#ran","syntology_url":"https://syntology.ai/paper/1512.01100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.01100"}},"official":null}},{"url":"/paper/mxnet-a-flexible-and-efficient-machine","slug":"mxnet-a-flexible-and-efficient-machine","title":"MXNet: A Flexible and Efficient Machine Learning Library for Heterogeneous Distributed Systems","date":"2015-12-03","arxiv_id":"1512.01274","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mxnet-a-flexible-and-efficient-machine#ran","syntology_url":"https://syntology.ai/paper/1512.01274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.01274"}},"official":null}},{"url":"/paper/multi-scale-context-aggregation-by-dilated","slug":"multi-scale-context-aggregation-by-dilated","title":"Multi-Scale Context Aggregation by Dilated Convolutions","date":"2015-11-23","arxiv_id":"1511.07122","repositories_listed":9,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/multi-scale-context-aggregation-by-dilated#ran","syntology_url":"https://syntology.ai/paper/1511.07122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.07122"}},"official":{"repos":["fyu/dilation"],"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/fast-and-accurate-deep-network-learning-by","slug":"fast-and-accurate-deep-network-learning-by","title":"Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)","date":"2015-11-23","arxiv_id":"1511.07289","repositories_listed":16,"syntology":{"n":7,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 ran (of which 1 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) · 2 unverified","sample_list":"/paper/fast-and-accurate-deep-network-learning-by#ran","syntology_url":"https://syntology.ai/paper/1511.07289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.07289"}},"official":null}},{"url":"/paper/adversarial-autoencoders","slug":"adversarial-autoencoders","title":"Adversarial Autoencoders","date":"2015-11-18","arxiv_id":"1511.05644","repositories_listed":29,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":3,"n_honours":3,"n_violates":1,"n_no_contract":1,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1511.05644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05644"}},"official":null}},{"url":"/paper/metric-learning-with-adaptive-density","slug":"metric-learning-with-adaptive-density","title":"Metric Learning with Adaptive Density Discrimination","date":"2015-11-18","arxiv_id":"1511.05939","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/metric-learning-with-adaptive-density#ran","syntology_url":"https://syntology.ai/paper/1511.05939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05939"}},"official":null}},{"url":"/paper/accurate-image-super-resolution-using-very","slug":"accurate-image-super-resolution-using-very","title":"Accurate Image Super-Resolution Using Very Deep Convolutional Networks","date":"2015-11-14","arxiv_id":"1511.04587","repositories_listed":8,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/accurate-image-super-resolution-using-very#ran","syntology_url":"https://syntology.ai/paper/1511.04587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.04587"}},"official":null}},{"url":"/paper/how-far-can-we-go-without-convolution","slug":"how-far-can-we-go-without-convolution","title":"How far can we go without convolution: Improving fully-connected networks","date":"2015-11-09","arxiv_id":"1511.02580","repositories_listed":5,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/how-far-can-we-go-without-convolution#ran","syntology_url":"https://syntology.ai/paper/1511.02580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.02580"}},"official":{"repos":["hantek/zlinnet"],"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/weakly-supervised-deep-detection-networks","slug":"weakly-supervised-deep-detection-networks","title":"Weakly Supervised Deep Detection Networks","date":"2015-11-09","arxiv_id":"1511.02853","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/weakly-supervised-deep-detection-networks#ran","syntology_url":"https://syntology.ai/paper/1511.02853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.02853"}},"official":{"repos":["hbilen/WSDDN"],"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/diffusion-convolutional-neural-networks","slug":"diffusion-convolutional-neural-networks","title":"Diffusion-Convolutional Neural Networks","date":"2015-11-06","arxiv_id":"1511.02136","repositories_listed":3,"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/diffusion-convolutional-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1511.02136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.02136"}},"official":null}},{"url":"/paper/segnet-a-deep-convolutional-encoder-decoder","slug":"segnet-a-deep-convolutional-encoder-decoder","title":"SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation","date":"2015-11-02","arxiv_id":"1511.00561","repositories_listed":74,"syntology":{"n":44,"n_ran":22,"n_constructed":0,"n_ran_checked":14,"n_instrument":8,"n_unverified":22,"n_honours":1,"n_violates":0,"n_no_contract":13,"n_pointer_only":11,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 0 violated, 13 with no contract checked; 8 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/segnet-a-deep-convolutional-encoder-decoder#ran","syntology_url":"https://syntology.ai/paper/1511.00561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.00561"}},"official":null}},{"url":"/paper/a-sensitivity-analysis-of-and-practitioners","slug":"a-sensitivity-analysis-of-and-practitioners","title":"A Sensitivity Analysis of (and Practitioners' Guide to) Convolutional Neural Networks for Sentence Classification","date":"2015-10-13","arxiv_id":"1510.03820","repositories_listed":19,"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/a-sensitivity-analysis-of-and-practitioners#ran","syntology_url":"https://syntology.ai/paper/1510.03820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1510.03820"}},"official":null}},{"url":"/paper/character-level-convolutional-networks-for","slug":"character-level-convolutional-networks-for","title":"Character-level Convolutional Networks for Text Classification","date":"2015-09-04","arxiv_id":"1509.01626","repositories_listed":30,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":13,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":5,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/character-level-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1509.01626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.01626"}},"official":null}},{"url":"/paper/neural-nilm-deep-neural-networks-applied-to","slug":"neural-nilm-deep-neural-networks-applied-to","title":"Neural NILM: Deep Neural Networks Applied to Energy Disaggregation","date":"2015-07-23","arxiv_id":"1507.06594","repositories_listed":4,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/neural-nilm-deep-neural-networks-applied-to#ran","syntology_url":"https://syntology.ai/paper/1507.06594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1507.06594"}},"official":{"repos":["JackKelly/neuralnilm_prototype"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/ask-me-anything-dynamic-memory-networks-for","slug":"ask-me-anything-dynamic-memory-networks-for","title":"Ask Me Anything: Dynamic Memory Networks for Natural Language Processing","date":"2015-06-24","arxiv_id":"1506.07285","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ask-me-anything-dynamic-memory-networks-for#ran","syntology_url":"https://syntology.ai/paper/1506.07285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.07285"}},"official":null}},{"url":"/paper/deep-convolutional-networks-on-graph","slug":"deep-convolutional-networks-on-graph","title":"Deep Convolutional Networks on Graph-Structured Data","date":"2015-06-16","arxiv_id":"1506.05163","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/deep-convolutional-networks-on-graph#ran","syntology_url":"https://syntology.ai/paper/1506.05163","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.05163"}},"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/domain-adversarial-training-of-neural","slug":"domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","arxiv_id":"1505.07818","repositories_listed":37,"syntology":{"n":52,"n_ran":35,"n_constructed":11,"n_ran_checked":18,"n_instrument":17,"n_unverified":17,"n_honours":1,"n_violates":0,"n_no_contract":17,"n_pointer_only":22,"phrase":"35 ran (of which 11 constructed an object rather than computing a result; 18 with no instrument failure: 1 honoured, 0 violated, 17 with no contract checked; 17 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/domain-adversarial-training-of-neural#ran","syntology_url":"https://syntology.ai/paper/1505.07818","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1505.07818"}},"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/classifying-relations-by-ranking-with","slug":"classifying-relations-by-ranking-with","title":"Classifying Relations by Ranking with Convolutional Neural Networks","date":"2015-04-24","arxiv_id":"1504.06580","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/classifying-relations-by-ranking-with#ran","syntology_url":"https://syntology.ai/paper/1504.06580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1504.06580"}},"official":null}},{"url":"/paper/beyond-short-snippets-deep-networks-for-video","slug":"beyond-short-snippets-deep-networks-for-video","title":"Beyond Short Snippets: Deep Networks for Video Classification","date":"2015-03-31","arxiv_id":"1503.08909","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/beyond-short-snippets-deep-networks-for-video#ran","syntology_url":"https://syntology.ai/paper/1503.08909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.08909"}},"official":null}},{"url":"/paper/contrastive-pessimistic-likelihood-estimation","slug":"contrastive-pessimistic-likelihood-estimation","title":"Contrastive Pessimistic Likelihood Estimation for Semi-Supervised Classification","date":"2015-03-01","arxiv_id":"1503.00269","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/contrastive-pessimistic-likelihood-estimation#ran","syntology_url":"https://syntology.ai/paper/1503.00269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.00269"}},"official":null}},{"url":"/paper/improved-semantic-representations-from-tree","slug":"improved-semantic-representations-from-tree","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","date":"2015-02-28","arxiv_id":"1503.00075","repositories_listed":16,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":6,"n_instrument":6,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"12 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; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/improved-semantic-representations-from-tree#ran","syntology_url":"https://syntology.ai/paper/1503.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.00075"}},"official":{"repos":["stanfordnlp/treelstm"],"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/batch-normalization-accelerating-deep-network","slug":"batch-normalization-accelerating-deep-network","title":"Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift","date":"2015-02-11","arxiv_id":"1502.03167","repositories_listed":70,"syntology":{"n":21,"n_ran":19,"n_constructed":5,"n_ran_checked":14,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":5,"phrase":"19 ran (of which 5 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/batch-normalization-accelerating-deep-network#ran","syntology_url":"https://syntology.ai/paper/1502.03167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.03167"}},"official":null}},{"url":"/paper/delving-deep-into-rectifiers-surpassing-human","slug":"delving-deep-into-rectifiers-surpassing-human","title":"Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification","date":"2015-02-06","arxiv_id":"1502.01852","repositories_listed":15,"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/delving-deep-into-rectifiers-surpassing-human#ran","syntology_url":"https://syntology.ai/paper/1502.01852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.01852"}},"official":null}},{"url":"/paper/deep-metric-learning-using-triplet-network","slug":"deep-metric-learning-using-triplet-network","title":"Deep metric learning using Triplet network","date":"2014-12-20","arxiv_id":"1412.6622","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/deep-metric-learning-using-triplet-network#ran","syntology_url":"https://syntology.ai/paper/1412.6622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.6622"}},"official":null}},{"url":"/paper/speeding-up-convolutional-neural-networks","slug":"speeding-up-convolutional-neural-networks","title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","date":"2014-12-19","arxiv_id":"1412.6553","repositories_listed":10,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"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) · 7 unverified","sample_list":"/paper/speeding-up-convolutional-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1412.6553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.6553"}},"official":null}},{"url":"/paper/real-time-grasp-detection-using-convolutional","slug":"real-time-grasp-detection-using-convolutional","title":"Real-Time Grasp Detection Using Convolutional Neural Networks","date":"2014-12-09","arxiv_id":"1412.3128","repositories_listed":3,"syntology":{"n":18,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/real-time-grasp-detection-using-convolutional#ran","syntology_url":"https://syntology.ai/paper/1412.3128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.3128"}},"official":null}},{"url":"/paper/scalable-variational-gaussian-process","slug":"scalable-variational-gaussian-process","title":"Scalable Variational Gaussian Process Classification","date":"2014-11-07","arxiv_id":"1411.2005","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/scalable-variational-gaussian-process#ran","syntology_url":"https://syntology.ai/paper/1411.2005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1411.2005"}},"official":null}},{"url":"/paper/bayesian-regression-and-bitcoin","slug":"bayesian-regression-and-bitcoin","title":"Bayesian regression and Bitcoin","date":"2014-10-06","arxiv_id":"1410.1231","repositories_listed":15,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":3,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":8,"phrase":"10 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; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bayesian-regression-and-bitcoin#ran","syntology_url":"https://syntology.ai/paper/1410.1231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1410.1231"}},"official":null}},{"url":"/paper/deeply-supervised-nets","slug":"deeply-supervised-nets","title":"Deeply-Supervised Nets","date":"2014-09-18","arxiv_id":"1409.5185","repositories_listed":1,"syntology":{"n":21,"n_ran":20,"n_constructed":0,"n_ran_checked":20,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":20,"n_pointer_only":0,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 0 honoured, 0 violated, 20 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deeply-supervised-nets#ran","syntology_url":"https://syntology.ai/paper/1409.5185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.5185"}},"official":null}},{"url":"/paper/going-deeper-with-convolutions","slug":"going-deeper-with-convolutions","title":"Going Deeper with Convolutions","date":"2014-09-17","arxiv_id":"1409.4842","repositories_listed":83,"syntology":{"n":42,"n_ran":34,"n_constructed":19,"n_ran_checked":30,"n_instrument":4,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":30,"n_pointer_only":21,"phrase":"34 ran (of which 19 constructed an object rather than computing a result; 30 with no instrument failure: 0 honoured, 0 violated, 30 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/going-deeper-with-convolutions#ran","syntology_url":"https://syntology.ai/paper/1409.4842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.4842"}},"official":{"repos":["worksheets.codalab.org/worksheets/0xbcd424d2bf544c4786efcc0063759b1a"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"c9ef081aa9730b71cbfe5d53bc5a9d30e4f5e6b646428f7c7b3c88686aa9f68c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}