{"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/2","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":146,"rows_per_page":100,"rows":[101,200],"of":14581,"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","prev":"/task/classification","next":"/task/classification/papers/3","papers":[{"url":"/paper/learning-representations-from-eeg-with-deep","slug":"learning-representations-from-eeg-with-deep","title":"Learning Representations from EEG with Deep Recurrent-Convolutional Neural Networks","date":"2015-11-19","arxiv_id":"1511.06448","repositories_listed":11,"syntology":null},{"url":"/paper/2103-15691","slug":"2103-15691","title":"ViViT: A Video Vision Transformer","date":"2021-03-29","arxiv_id":"2103.15691","repositories_listed":10,"syntology":{"n":21,"n_ran":14,"n_constructed":10,"n_ran_checked":13,"n_instrument":1,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"14 ran (of which 10 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/2103-15691#ran","syntology_url":"https://syntology.ai/paper/2103.15691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.15691"}},"official":{"repos":["google-research/scenic"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/would-mega-scale-datasets-further-enhance","slug":"would-mega-scale-datasets-further-enhance","title":"Would Mega-scale Datasets Further Enhance Spatiotemporal 3D CNNs?","date":"2020-04-10","arxiv_id":"2004.04968","repositories_listed":10,"syntology":{"n":22,"n_ran":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"16 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; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/would-mega-scale-datasets-further-enhance#ran","syntology_url":"https://syntology.ai/paper/2004.04968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04968"}},"official":{"repos":["kenshohara/3D-ResNets-PyTorch"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-new-meta-baseline-for-few-shot-learning","slug":"a-new-meta-baseline-for-few-shot-learning","title":"Meta-Baseline: Exploring Simple Meta-Learning for Few-Shot Learning","date":"2020-03-09","arxiv_id":"2003.04390","repositories_listed":10,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":5,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-new-meta-baseline-for-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/2003.04390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04390"}},"official":{"repos":["cyvius96/few-shot-meta-baseline","yinboc/few-shot-meta-baseline"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dreamtime-finding-alexnet-for-time-series","slug":"dreamtime-finding-alexnet-for-time-series","title":"InceptionTime: Finding AlexNet for Time Series Classification","date":"2019-09-11","arxiv_id":"1909.04939","repositories_listed":10,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dreamtime-finding-alexnet-for-time-series#ran","syntology_url":"https://syntology.ai/paper/1909.04939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04939"}},"official":{"repos":["hfawaz/InceptionTime"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/evolvegcn-evolving-graph-convolutional","slug":"evolvegcn-evolving-graph-convolutional","title":"EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs","date":"2019-02-26","arxiv_id":"1902.10191","repositories_listed":10,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/evolvegcn-evolving-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/1902.10191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10191"}},"official":{"repos":["IBM/AMLSim","IBM/EvolveGCN"],"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/fixup-initialization-residual-learning","slug":"fixup-initialization-residual-learning","title":"Fixup Initialization: Residual Learning Without Normalization","date":"2019-01-27","arxiv_id":"1901.09321","repositories_listed":10,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fixup-initialization-residual-learning#ran","syntology_url":"https://syntology.ai/paper/1901.09321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09321"}},"official":null}},{"url":"/paper/espnetv2-a-light-weight-power-efficient-and","slug":"espnetv2-a-light-weight-power-efficient-and","title":"ESPNetv2: A Light-weight, Power Efficient, and General Purpose Convolutional Neural Network","date":"2018-11-28","arxiv_id":"1811.11431","repositories_listed":10,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/espnetv2-a-light-weight-power-efficient-and#ran","syntology_url":"https://syntology.ai/paper/1811.11431","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11431"}},"official":{"repos":["sacmehta/EdgeNets"],"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/evidential-deep-learning-to-quantify","slug":"evidential-deep-learning-to-quantify","title":"Evidential Deep Learning to Quantify Classification Uncertainty","date":"2018-06-05","arxiv_id":"1806.01768","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evidential-deep-learning-to-quantify#ran","syntology_url":"https://syntology.ai/paper/1806.01768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01768"}},"official":null}},{"url":"/paper/meta-learning-for-semi-supervised-few-shot","slug":"meta-learning-for-semi-supervised-few-shot","title":"Meta-Learning for Semi-Supervised Few-Shot Classification","date":"2018-03-02","arxiv_id":"1803.00676","repositories_listed":10,"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/meta-learning-for-semi-supervised-few-shot#ran","syntology_url":"https://syntology.ai/paper/1803.00676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.00676"}},"official":{"repos":["renmengye/few-shot-ssl-public"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/catboost-unbiased-boosting-with-categorical","slug":"catboost-unbiased-boosting-with-categorical","title":"CatBoost: unbiased boosting with categorical features","date":"2017-06-28","arxiv_id":"1706.09516","repositories_listed":10,"syntology":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/a-c-lstm-neural-network-for-text","slug":"a-c-lstm-neural-network-for-text","title":"A C-LSTM Neural Network for Text Classification","date":"2015-11-27","arxiv_id":"1511.08630","repositories_listed":10,"syntology":null},{"url":"/paper/semi-supervised-learning-with-ladder-networks","slug":"semi-supervised-learning-with-ladder-networks","title":"Semi-Supervised Learning with Ladder Networks","date":"2015-07-09","arxiv_id":"1507.02672","repositories_listed":10,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/semi-supervised-learning-with-ladder-networks#ran","syntology_url":"https://syntology.ai/paper/1507.02672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1507.02672"}},"official":{"repos":["arasmus/ladder"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/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/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/measuring-the-effects-of-non-identical-data","slug":"measuring-the-effects-of-non-identical-data","title":"Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classification","date":"2019-09-13","arxiv_id":"1909.06335","repositories_listed":9,"syntology":null},{"url":"/paper/soft-conditional-computation","slug":"soft-conditional-computation","title":"CondConv: Conditionally Parameterized Convolutions for Efficient Inference","date":"2019-04-10","arxiv_id":"1904.04971","repositories_listed":9,"syntology":null},{"url":"/paper/single-path-nas-designing-hardware-efficient","slug":"single-path-nas-designing-hardware-efficient","title":"Single-Path NAS: Designing Hardware-Efficient ConvNets in less than 4 Hours","date":"2019-04-05","arxiv_id":"1904.02877","repositories_listed":9,"syntology":{"n":16,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":12,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/single-path-nas-designing-hardware-efficient#ran","syntology_url":"https://syntology.ai/paper/1904.02877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02877"}},"official":{"repos":["dstamoulis/single-path-nas"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmarking-natural-language-understanding","slug":"benchmarking-natural-language-understanding","title":"Benchmarking Natural Language Understanding Services for building Conversational Agents","date":"2019-03-13","arxiv_id":"1903.05566","repositories_listed":9,"syntology":null},{"url":"/paper/theoretically-principled-trade-off-between","slug":"theoretically-principled-trade-off-between","title":"Theoretically Principled Trade-off between Robustness and Accuracy","date":"2019-01-24","arxiv_id":"1901.08573","repositories_listed":9,"syntology":{"n":15,"n_ran":12,"n_constructed":6,"n_ran_checked":7,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"12 ran (of which 6 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/theoretically-principled-trade-off-between#ran","syntology_url":"https://syntology.ai/paper/1901.08573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08573"}},"official":{"repos":["yaodongyu/TRADES"],"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/gradient-harmonized-single-stage-detector","slug":"gradient-harmonized-single-stage-detector","title":"Gradient Harmonized Single-stage Detector","date":"2018-11-13","arxiv_id":"1811.05181","repositories_listed":9,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/gradient-harmonized-single-stage-detector#ran","syntology_url":"https://syntology.ai/paper/1811.05181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05181"}},"official":{"repos":["libuyu/GHM_Detection"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/graph-convolutional-networks-for-text","slug":"graph-convolutional-networks-for-text","title":"Graph Convolutional Networks for Text Classification","date":"2018-09-15","arxiv_id":"1809.05679","repositories_listed":9,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":6,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-convolutional-networks-for-text#ran","syntology_url":"https://syntology.ai/paper/1809.05679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.05679"}},"official":{"repos":["yao8839836/text_gcn"],"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/bayesian-convolutional-neural-networks-with-1","slug":"bayesian-convolutional-neural-networks-with-1","title":"Uncertainty Estimations by Softplus normalization in Bayesian Convolutional Neural Networks with Variational Inference","date":"2018-06-15","arxiv_id":"1806.05978","repositories_listed":9,"syntology":null},{"url":"/paper/pubmed-200k-rct-a-dataset-for-sequential","slug":"pubmed-200k-rct-a-dataset-for-sequential","title":"PubMed 200k RCT: a Dataset for Sequential Sentence Classification in Medical Abstracts","date":"2017-10-17","arxiv_id":"1710.06071","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":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/pubmed-200k-rct-a-dataset-for-sequential#ran","syntology_url":"https://syntology.ai/paper/1710.06071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.06071"}},"official":{"repos":["Franck-Dernoncourt/pubmed-rct"],"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/lstm-fully-convolutional-networks-for-time","slug":"lstm-fully-convolutional-networks-for-time","title":"LSTM Fully Convolutional Networks for Time Series Classification","date":"2017-09-08","arxiv_id":"1709.05206","repositories_listed":9,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lstm-fully-convolutional-networks-for-time#ran","syntology_url":"https://syntology.ai/paper/1709.05206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.05206"}},"official":{"repos":["titu1994/LSTM-FCN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/the-reversible-residual-network","slug":"the-reversible-residual-network","title":"The Reversible Residual Network: Backpropagation Without Storing Activations","date":"2017-07-14","arxiv_id":"1707.04585","repositories_listed":9,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-reversible-residual-network#ran","syntology_url":"https://syntology.ai/paper/1707.04585","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.04585"}},"official":{"repos":["renmengye/revnet-public"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/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/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/all-nlp-tasks-are-generation-tasks-a-general","slug":"all-nlp-tasks-are-generation-tasks-a-general","title":"GLM: General Language Model Pretraining with Autoregressive Blank Infilling","date":"2021-03-18","arxiv_id":"2103.10360","repositories_listed":8,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/all-nlp-tasks-are-generation-tasks-a-general#ran","syntology_url":"https://syntology.ai/paper/2103.10360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10360"}},"official":{"repos":["THUDM/GLM"],"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/visual-transformers-token-based-image","slug":"visual-transformers-token-based-image","title":"Visual Transformers: Token-based Image Representation and Processing for Computer Vision","date":"2020-06-05","arxiv_id":"2006.03677","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/visual-transformers-token-based-image#ran","syntology_url":"https://syntology.ai/paper/2006.03677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03677"}},"official":null}},{"url":"/paper/x3d-expanding-architectures-for-efficient","slug":"x3d-expanding-architectures-for-efficient","title":"X3D: Expanding Architectures for Efficient Video Recognition","date":"2020-04-09","arxiv_id":"2004.04730","repositories_listed":8,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/x3d-expanding-architectures-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2004.04730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04730"}},"official":{"repos":["facebookresearch/SlowFast"],"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/gradient-centralization-a-new-optimization","slug":"gradient-centralization-a-new-optimization","title":"Gradient Centralization: A New Optimization Technique for Deep Neural Networks","date":"2020-04-03","arxiv_id":"2004.01461","repositories_listed":8,"syntology":{"n":29,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":16,"n_pointer_only":3,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 1 honoured, 0 violated, 16 with no contract checked; 1 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/gradient-centralization-a-new-optimization#ran","syntology_url":"https://syntology.ai/paper/2004.01461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01461"}},"official":{"repos":["Yonghongwei/Gradient-Centralization"],"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/huse-hierarchical-universal-semantic","slug":"huse-hierarchical-universal-semantic","title":"HUSE: Hierarchical Universal Semantic Embeddings","date":"2019-11-14","arxiv_id":"1911.05978","repositories_listed":8,"syntology":null},{"url":"/paper/utilizing-bert-for-aspect-based-sentiment","slug":"utilizing-bert-for-aspect-based-sentiment","title":"Utilizing BERT for Aspect-Based Sentiment Analysis via Constructing Auxiliary Sentence","date":"2019-03-22","arxiv_id":"1903.09588","repositories_listed":8,"syntology":{"n":27,"n_ran":19,"n_constructed":0,"n_ran_checked":15,"n_instrument":4,"n_unverified":8,"n_honours":3,"n_violates":0,"n_no_contract":12,"n_pointer_only":9,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 3 honoured, 0 violated, 12 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/utilizing-bert-for-aspect-based-sentiment#ran","syntology_url":"https://syntology.ai/paper/1903.09588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.09588"}},"official":{"repos":["HSLCY/ABSA-BERT-pair"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-deep-representations-by-mutual","slug":"learning-deep-representations-by-mutual","title":"Learning deep representations by mutual information estimation and maximization","date":"2018-08-20","arxiv_id":"1808.06670","repositories_listed":8,"syntology":{"n":6,"n_ran":5,"n_constructed":2,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"5 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-deep-representations-by-mutual#ran","syntology_url":"https://syntology.ai/paper/1808.06670","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.06670"}},"official":{"repos":["rdevon/DIM"],"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/one-shot-learning-for-semantic-segmentation","slug":"one-shot-learning-for-semantic-segmentation","title":"One-Shot Learning for Semantic Segmentation","date":"2017-09-11","arxiv_id":"1709.03410","repositories_listed":8,"syntology":null},{"url":"/paper/eurosat-a-novel-dataset-and-deep-learning","slug":"eurosat-a-novel-dataset-and-deep-learning","title":"EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classification","date":"2017-08-31","arxiv_id":"1709.00029","repositories_listed":8,"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/eurosat-a-novel-dataset-and-deep-learning#ran","syntology_url":"https://syntology.ai/paper/1709.00029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.00029"}},"official":{"repos":["phelber/EuroSAT"],"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/wasserstein-distance-guided-representation","slug":"wasserstein-distance-guided-representation","title":"Wasserstein Distance Guided Representation Learning for Domain Adaptation","date":"2017-07-05","arxiv_id":"1707.01217","repositories_listed":8,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/wasserstein-distance-guided-representation#ran","syntology_url":"https://syntology.ai/paper/1707.01217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.01217"}},"official":{"repos":["RockySJ/WDGRL"],"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/doubly-stochastic-variational-inference-for","slug":"doubly-stochastic-variational-inference-for","title":"Doubly Stochastic Variational Inference for Deep Gaussian Processes","date":"2017-05-24","arxiv_id":"1705.08933","repositories_listed":8,"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":1,"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/doubly-stochastic-variational-inference-for#ran","syntology_url":"https://syntology.ai/paper/1705.08933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.08933"}},"official":{"repos":["ICL-SML/Doubly-Stochastic-DGP"],"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/attention-based-lstm-for-aspect-level","slug":"attention-based-lstm-for-aspect-level","title":"Attention-based LSTM for Aspect-level Sentiment Classification","date":"2016-11-01","arxiv_id":null,"repositories_listed":8,"syntology":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/convolutional-radio-modulation-recognition","slug":"convolutional-radio-modulation-recognition","title":"Convolutional Radio Modulation Recognition Networks","date":"2016-02-12","arxiv_id":"1602.04105","repositories_listed":8,"syntology":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/vehicle-color-recognition-using-convolutional","slug":"vehicle-color-recognition-using-convolutional","title":"Vehicle Color Recognition using Convolutional Neural Network","date":"2015-10-26","arxiv_id":"1510.07391","repositories_listed":8,"syntology":null},{"url":"/paper/meta-learning-a-real-time-tabular-automl","slug":"meta-learning-a-real-time-tabular-automl","title":"TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Second","date":"2022-07-05","arxiv_id":"2207.01848","repositories_listed":7,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-a-real-time-tabular-automl#ran","syntology_url":"https://syntology.ai/paper/2207.01848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01848"}},"official":null}},{"url":"/paper/token-labeling-training-a-85-5-top-1-accuracy","slug":"token-labeling-training-a-85-5-top-1-accuracy","title":"All Tokens Matter: Token Labeling for Training Better Vision Transformers","date":"2021-04-22","arxiv_id":"2104.10858","repositories_listed":7,"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":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) · 2 unverified","sample_list":"/paper/token-labeling-training-a-85-5-top-1-accuracy#ran","syntology_url":"https://syntology.ai/paper/2104.10858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.10858"}},"official":{"repos":["zihangJiang/TokenLabeling"],"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/generalized-focal-loss-learning-qualified-and","slug":"generalized-focal-loss-learning-qualified-and","title":"Generalized Focal Loss: Learning Qualified and Distributed Bounding Boxes for Dense Object Detection","date":"2020-06-08","arxiv_id":"2006.04388","repositories_listed":7,"syntology":{"n":24,"n_ran":22,"n_constructed":0,"n_ran_checked":22,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":22,"n_pointer_only":2,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 0 honoured, 0 violated, 22 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/generalized-focal-loss-learning-qualified-and#ran","syntology_url":"https://syntology.ai/paper/2006.04388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04388"}},"official":{"repos":["implus/GFocal"],"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/mockingjay-unsupervised-speech-representation","slug":"mockingjay-unsupervised-speech-representation","title":"Mockingjay: Unsupervised Speech Representation Learning with Deep Bidirectional Transformer Encoders","date":"2019-10-25","arxiv_id":"1910.12638","repositories_listed":7,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mockingjay-unsupervised-speech-representation#ran","syntology_url":"https://syntology.ai/paper/1910.12638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12638"}},"official":{"repos":["andi611/Self-Supervised-Speech-Pretraining-and-Representation-Learning"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/is-bert-really-robust-natural-language-attack","slug":"is-bert-really-robust-natural-language-attack","title":"Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailment","date":"2019-07-27","arxiv_id":"1907.11932","repositories_listed":7,"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/is-bert-really-robust-natural-language-attack#ran","syntology_url":"https://syntology.ai/paper/1907.11932","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11932"}},"official":{"repos":["jind11/TextFooler"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/the-truly-deep-graph-convolutional-networks","slug":"the-truly-deep-graph-convolutional-networks","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","date":"2019-07-25","arxiv_id":"1907.10903","repositories_listed":7,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-truly-deep-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1907.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10903"}},"official":{"repos":["DropEdge/DropEdge"],"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/190407094","slug":"190407094","title":"CEDR: Contextualized Embeddings for Document Ranking","date":"2019-04-15","arxiv_id":"1904.07094","repositories_listed":7,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190407094#ran","syntology_url":"https://syntology.ai/paper/1904.07094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.07094"}},"official":{"repos":["Georgetown-IR-Lab/cedr","Georgetown-IR-Lab/contextualized-reps-for-ranking"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/wav2vec-unsupervised-pre-training-for-speech","slug":"wav2vec-unsupervised-pre-training-for-speech","title":"wav2vec: Unsupervised Pre-training for Speech Recognition","date":"2019-04-11","arxiv_id":"1904.05862","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":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/wav2vec-unsupervised-pre-training-for-speech#ran","syntology_url":"https://syntology.ai/paper/1904.05862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05862"}},"official":{"repos":["pytorch/fairseq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/video-classification-with-channel-separated","slug":"video-classification-with-channel-separated","title":"Video Classification with Channel-Separated Convolutional Networks","date":"2019-04-04","arxiv_id":"1904.02811","repositories_listed":7,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/video-classification-with-channel-separated#ran","syntology_url":"https://syntology.ai/paper/1904.02811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02811"}},"official":{"repos":["facebookresearch/VMZ"],"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/the-omniglot-challenge-a-3-year-progress","slug":"the-omniglot-challenge-a-3-year-progress","title":"The Omniglot challenge: a 3-year progress report","date":"2019-02-09","arxiv_id":"1902.03477","repositories_listed":7,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-omniglot-challenge-a-3-year-progress#ran","syntology_url":"https://syntology.ai/paper/1902.03477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03477"}},"official":{"repos":["brendenlake/omniglot"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/multi-task-learning-as-multi-objective","slug":"multi-task-learning-as-multi-objective","title":"Multi-Task Learning as Multi-Objective Optimization","date":"2018-10-10","arxiv_id":"1810.04650","repositories_listed":7,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":1,"phrase":"17 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-task-learning-as-multi-objective#ran","syntology_url":"https://syntology.ai/paper/1810.04650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.04650"}},"official":{"repos":["IntelVCL/MultiObjectiveOptimization"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-retrospective-analysis-of-the-fake-news-1","slug":"a-retrospective-analysis-of-the-fake-news-1","title":"A Retrospective Analysis of the Fake News Challenge Stance Detection Task","date":"2018-06-13","arxiv_id":"1806.05180","repositories_listed":7,"syntology":null},{"url":"/paper/revisiting-rcnn-on-awakening-the","slug":"revisiting-rcnn-on-awakening-the","title":"Revisiting RCNN: On Awakening the Classification Power of Faster RCNN","date":"2018-03-19","arxiv_id":"1803.06799","repositories_listed":7,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-rcnn-on-awakening-the#ran","syntology_url":"https://syntology.ai/paper/1803.06799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.06799"}},"official":null}},{"url":"/paper/fix-your-classifier-the-marginal-value-of","slug":"fix-your-classifier-the-marginal-value-of","title":"Fix your classifier: the marginal value of training the last weight layer","date":"2018-01-14","arxiv_id":"1801.04540","repositories_listed":7,"syntology":null},{"url":"/paper/multivariate-lstm-fcns-for-time-series","slug":"multivariate-lstm-fcns-for-time-series","title":"Multivariate LSTM-FCNs for Time Series Classification","date":"2018-01-14","arxiv_id":"1801.04503","repositories_listed":7,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multivariate-lstm-fcns-for-time-series#ran","syntology_url":"https://syntology.ai/paper/1801.04503","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.04503"}},"official":{"repos":["houshd/MLSTM-FCN"],"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/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/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/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/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/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/compact-bilinear-pooling","slug":"compact-bilinear-pooling","title":"Compact Bilinear Pooling","date":"2015-11-19","arxiv_id":"1511.06062","repositories_listed":7,"syntology":null},{"url":"/paper/two-stream-convolutional-networks-for-action","slug":"two-stream-convolutional-networks-for-action","title":"Two-Stream Convolutional Networks for Action Recognition in Videos","date":"2014-06-09","arxiv_id":"1406.2199","repositories_listed":7,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/two-stream-convolutional-networks-for-action#ran","syntology_url":"https://syntology.ai/paper/1406.2199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.2199"}},"official":{"repos":["feichtenhofer/twostreamfusion"],"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/maxout-networks","slug":"maxout-networks","title":"Maxout Networks","date":"2013-02-18","arxiv_id":"1302.4389","repositories_listed":7,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/maxout-networks#ran","syntology_url":"https://syntology.ai/paper/1302.4389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1302.4389"}},"official":null}},{"url":"/paper/a-transformer-based-framework-for-1","slug":"a-transformer-based-framework-for-1","title":"A Transformer-based Framework for Multivariate Time Series Representation Learning","date":"2020-10-06","arxiv_id":"2010.02803","repositories_listed":6,"syntology":{"n":32,"n_ran":23,"n_constructed":0,"n_ran_checked":22,"n_instrument":1,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":22,"n_pointer_only":6,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 0 honoured, 0 violated, 22 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/a-transformer-based-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2010.02803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02803"}},"official":{"repos":["gzerveas/mvts_transformer"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/resnet50-on-cifar-100-without-transfer","slug":"resnet50-on-cifar-100-without-transfer","title":"ResNet50_on_Cifar_100_Without_Transfer_Learning","date":"2020-08-03","arxiv_id":null,"repositories_listed":6,"syntology":null},{"url":"/paper/leveraging-the-feature-distribution-in","slug":"leveraging-the-feature-distribution-in","title":"Leveraging the Feature Distribution in Transfer-based Few-Shot Learning","date":"2020-06-06","arxiv_id":"2006.03806","repositories_listed":6,"syntology":{"n":26,"n_ran":22,"n_constructed":0,"n_ran_checked":13,"n_instrument":9,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":12,"phrase":"22 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; 9 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/leveraging-the-feature-distribution-in#ran","syntology_url":"https://syntology.ai/paper/2006.03806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03806"}},"official":{"repos":["yhu01/PT-MAP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/sp-nas-serial-to-parallel-backbone-search-for","slug":"sp-nas-serial-to-parallel-backbone-search-for","title":"SP-NAS: Serial-to-Parallel Backbone Search for Object Detection","date":"2020-06-01","arxiv_id":null,"repositories_listed":6,"syntology":null},{"url":"/paper/exploiting-cloze-questions-for-few-shot-text","slug":"exploiting-cloze-questions-for-few-shot-text","title":"Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inference","date":"2020-01-21","arxiv_id":"2001.07676","repositories_listed":6,"syntology":null},{"url":"/paper/a-multi-task-learning-model-for-chinese","slug":"a-multi-task-learning-model-for-chinese","title":"A Multi-task Learning Model for Chinese-oriented Aspect Polarity Classification and Aspect Term Extraction","date":"2019-12-17","arxiv_id":"1912.07976","repositories_listed":6,"syntology":null},{"url":"/paper/siamfc-towards-robust-and-accurate-visual","slug":"siamfc-towards-robust-and-accurate-visual","title":"SiamFC++: Towards Robust and Accurate Visual Tracking with Target Estimation Guidelines","date":"2019-11-14","arxiv_id":"1911.06188","repositories_listed":6,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/siamfc-towards-robust-and-accurate-visual#ran","syntology_url":"https://syntology.ai/paper/1911.06188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06188"}},"official":{"repos":["MegviiDetection/video_analyst"],"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/simpleshot-revisiting-nearest-neighbor","slug":"simpleshot-revisiting-nearest-neighbor","title":"SimpleShot: Revisiting Nearest-Neighbor Classification for Few-Shot Learning","date":"2019-11-12","arxiv_id":"1911.04623","repositories_listed":6,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"9 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simpleshot-revisiting-nearest-neighbor#ran","syntology_url":"https://syntology.ai/paper/1911.04623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04623"}},"official":{"repos":["mileyan/simple_shot"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rocket-exceptionally-fast-and-accurate-time","slug":"rocket-exceptionally-fast-and-accurate-time","title":"ROCKET: Exceptionally fast and accurate time series classification using random convolutional kernels","date":"2019-10-29","arxiv_id":"1910.13051","repositories_listed":6,"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/rocket-exceptionally-fast-and-accurate-time#ran","syntology_url":"https://syntology.ai/paper/1910.13051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13051"}},"official":{"repos":["angus924/rocket"],"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/supervised-multimodal-bitransformers-for","slug":"supervised-multimodal-bitransformers-for","title":"Supervised Multimodal Bitransformers for Classifying Images and Text","date":"2019-09-06","arxiv_id":"1909.02950","repositories_listed":6,"syntology":null},{"url":"/paper/scientific-statement-classification-over","slug":"scientific-statement-classification-over","title":"Scientific Statement Classification over arXiv.org","date":"2019-08-29","arxiv_id":"1908.10993","repositories_listed":6,"syntology":null},{"url":"/paper/enriching-pre-trained-language-model-with","slug":"enriching-pre-trained-language-model-with","title":"Enriching Pre-trained Language Model with Entity Information for Relation Classification","date":"2019-05-20","arxiv_id":"1905.08284","repositories_listed":6,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/enriching-pre-trained-language-model-with#ran","syntology_url":"https://syntology.ai/paper/1905.08284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08284"}},"official":null}},{"url":"/paper/adversarial-training-for-free","slug":"adversarial-training-for-free","title":"Adversarial Training for Free!","date":"2019-04-29","arxiv_id":"1904.12843","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/adversarial-training-for-free#ran","syntology_url":"https://syntology.ai/paper/1904.12843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12843"}},"official":{"repos":["ashafahi/free_adv_train","mahyarnajibi/FreeAdversarialTraining"],"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/scibert-pretrained-contextualized-embeddings","slug":"scibert-pretrained-contextualized-embeddings","title":"SciBERT: A Pretrained Language Model for Scientific Text","date":"2019-03-26","arxiv_id":"1903.10676","repositories_listed":6,"syntology":null},{"url":"/paper/music-artist-classification-with","slug":"music-artist-classification-with","title":"Music Artist Classification with Convolutional Recurrent Neural Networks","date":"2019-01-14","arxiv_id":"1901.04555","repositories_listed":6,"syntology":null},{"url":"/paper/a-comprehensive-guide-to-bayesian","slug":"a-comprehensive-guide-to-bayesian","title":"A Comprehensive guide to Bayesian Convolutional Neural Network with Variational Inference","date":"2019-01-08","arxiv_id":"1901.02731","repositories_listed":6,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":2,"phrase":"14 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-comprehensive-guide-to-bayesian#ran","syntology_url":"https://syntology.ai/paper/1901.02731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.02731"}},"official":{"repos":["kumar-shridhar/PyTorch-BayesianCNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-embedding-adaptation-for-few-shot","slug":"learning-embedding-adaptation-for-few-shot","title":"Few-Shot Learning via Embedding Adaptation with Set-to-Set Functions","date":"2018-12-10","arxiv_id":"1812.03664","repositories_listed":6,"syntology":null},{"url":"/paper/deepsphere-efficient-spherical-convolutional","slug":"deepsphere-efficient-spherical-convolutional","title":"DeepSphere: Efficient spherical Convolutional Neural Network with HEALPix sampling for cosmological applications","date":"2018-10-29","arxiv_id":"1810.12186","repositories_listed":6,"syntology":null},{"url":"/paper/deep-learning-for-time-series-classification","slug":"deep-learning-for-time-series-classification","title":"Deep learning for time series classification: a review","date":"2018-09-12","arxiv_id":"1809.04356","repositories_listed":6,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-learning-for-time-series-classification#ran","syntology_url":"https://syntology.ai/paper/1809.04356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.04356"}},"official":{"repos":["hfawaz/dl-4-tsc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/proximity-forest-an-effective-and-scalable","slug":"proximity-forest-an-effective-and-scalable","title":"Proximity Forest: An effective and scalable distance-based classifier for time series","date":"2018-08-31","arxiv_id":"1808.10594","repositories_listed":6,"syntology":null},{"url":"/paper/invariant-information-distillation-for","slug":"invariant-information-distillation-for","title":"Invariant Information Clustering for Unsupervised Image Classification and Segmentation","date":"2018-07-17","arxiv_id":"1807.06653","repositories_listed":6,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 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; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/invariant-information-distillation-for#ran","syntology_url":"https://syntology.ai/paper/1807.06653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.06653"}},"official":{"repos":["xu-ji/IIC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/detecting-damaged-buildings-on-post-hurricane","slug":"detecting-damaged-buildings-on-post-hurricane","title":"Building Damage Annotation on Post-Hurricane Satellite Imagery Based on Convolutional Neural Networks","date":"2018-07-04","arxiv_id":"1807.01688","repositories_listed":6,"syntology":null},{"url":"/paper/adversarial-reprogramming-of-neural-networks","slug":"adversarial-reprogramming-of-neural-networks","title":"Adversarial Reprogramming of Neural Networks","date":"2018-06-28","arxiv_id":"1806.11146","repositories_listed":6,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adversarial-reprogramming-of-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1806.11146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.11146"}},"official":null}},{"url":"/paper/what-you-can-cram-into-a-single-vector","slug":"what-you-can-cram-into-a-single-vector","title":"What you can cram into a single vector: Probing sentence embeddings for linguistic properties","date":"2018-05-03","arxiv_id":"1805.01070","repositories_listed":6,"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/what-you-can-cram-into-a-single-vector#ran","syntology_url":"https://syntology.ai/paper/1805.01070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.01070"}},"official":{"repos":["facebookresearch/SentEval"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/eco-efficient-convolutional-network-for","slug":"eco-efficient-convolutional-network-for","title":"ECO: Efficient Convolutional Network for Online Video Understanding","date":"2018-04-24","arxiv_id":"1804.09066","repositories_listed":6,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/eco-efficient-convolutional-network-for#ran","syntology_url":"https://syntology.ai/paper/1804.09066","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.09066"}},"official":{"repos":["mzolfaghari/ECO-efficient-video-understanding"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/an-efficient-framework-for-learning-sentence","slug":"an-efficient-framework-for-learning-sentence","title":"An efficient framework for learning sentence representations","date":"2018-03-07","arxiv_id":"1803.02893","repositories_listed":6,"syntology":{"n":21,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/an-efficient-framework-for-learning-sentence#ran","syntology_url":"https://syntology.ai/paper/1803.02893","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02893"}},"official":null}},{"url":"/paper/distilling-a-neural-network-into-a-soft","slug":"distilling-a-neural-network-into-a-soft","title":"Distilling a Neural Network Into a Soft Decision Tree","date":"2017-11-27","arxiv_id":"1711.09784","repositories_listed":6,"syntology":null},{"url":"/paper/ssh-single-stage-headless-face-detector","slug":"ssh-single-stage-headless-face-detector","title":"SSH: Single Stage Headless Face Detector","date":"2017-08-14","arxiv_id":"1708.03979","repositories_listed":6,"syntology":null},{"url":"/paper/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","repositories_listed":6,"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/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}},"official":null}},{"url":"/paper/advances-in-joint-ctc-attention-based-end-to","slug":"advances-in-joint-ctc-attention-based-end-to","title":"Advances in Joint CTC-Attention based End-to-End Speech Recognition with a Deep CNN Encoder and RNN-LM","date":"2017-06-08","arxiv_id":"1706.02737","repositories_listed":6,"syntology":null},{"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/soundnet-learning-sound-representations-from","slug":"soundnet-learning-sound-representations-from","title":"SoundNet: Learning Sound Representations from Unlabeled Video","date":"2016-10-27","arxiv_id":"1610.09001","repositories_listed":6,"syntology":null}],"record_sha256":"05d3f8984eb0fb66c38cdd249204ead39630fbcb0c22148aa81282fd3b2c8891","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}