{"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/image-classification/papers/ran/11","list_of":"/task/image-classification","task":"Image 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":11,"pages_in_order":14,"rows_per_page":100,"rows":[1001,1100],"of":1392,"counts":{"archive_papers_tagged":10488,"with_a_code_link":4702,"where_syntology_ran_a_sample":1392,"not_listed_spam_title":0,"listed":10488,"listed_where_code_ran":1392,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1164,"every_run_a_failure_of_syntologys_instrument":228,"listed_with_a_run_with_no_instrument_failure":1164,"listed_every_run_a_failure_of_syntologys_instrument":228,"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/image-classification/papers/ran/1","prev":"/task/image-classification/papers/ran/10","next":"/task/image-classification/papers/ran/12","papers":[{"url":"/paper/discretize-optimize-vs-optimize-discretize","slug":"discretize-optimize-vs-optimize-discretize","title":"Discretize-Optimize vs. Optimize-Discretize for Time-Series Regression and Continuous Normalizing Flows","date":"2020-05-27","arxiv_id":"2005.13420","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/discretize-optimize-vs-optimize-discretize#ran","syntology_url":"https://syntology.ai/paper/2005.13420","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.13420"}},"official":{"repos":["EmoryMLIP/DOvsOD_NeuralODEs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/u-2-net-going-deeper-with-nested-u-structure","slug":"u-2-net-going-deeper-with-nested-u-structure","title":"U$^2$-Net: Going Deeper with Nested U-Structure for Salient Object Detection","date":"2020-05-18","arxiv_id":"2005.09007","repositories_listed":29,"syntology":{"n":42,"n_ran":24,"n_constructed":0,"n_ran_checked":22,"n_instrument":2,"n_unverified":18,"n_honours":1,"n_violates":1,"n_no_contract":20,"n_pointer_only":2,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 1 honoured, 1 violated, 20 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/u-2-net-going-deeper-with-nested-u-structure#ran","syntology_url":"https://syntology.ai/paper/2005.09007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09007"}},"official":{"repos":["NathanUA/U-2-Net"],"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/a-simple-semi-supervised-learning-framework","slug":"a-simple-semi-supervised-learning-framework","title":"A Simple Semi-Supervised Learning Framework for Object Detection","date":"2020-05-10","arxiv_id":"2005.04757","repositories_listed":7,"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-simple-semi-supervised-learning-framework#ran","syntology_url":"https://syntology.ai/paper/2005.04757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04757"}},"official":{"repos":["google-research/ssl_detection"],"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/enabling-deep-spiking-neural-networks-with-1","slug":"enabling-deep-spiking-neural-networks-with-1","title":"Enabling Deep Spiking Neural Networks with Hybrid Conversion and Spike Timing Dependent Backpropagation","date":"2020-05-04","arxiv_id":"2005.01807","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/enabling-deep-spiking-neural-networks-with-1#ran","syntology_url":"https://syntology.ai/paper/2005.01807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01807"}},"official":{"repos":["nitin-rathi/hybrid-snn-conversion"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/supervised-contrastive-learning","slug":"supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","arxiv_id":"2004.11362","repositories_listed":26,"syntology":{"n":23,"n_ran":17,"n_constructed":0,"n_ran_checked":14,"n_instrument":3,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":12,"n_pointer_only":5,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 2 honoured, 0 violated, 12 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/supervised-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2004.11362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11362"}},"official":{"repos":["HobbitLong/SupContrast","google-research/google-research"],"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/amc-loss-angular-margin-contrastive-loss-for","slug":"amc-loss-angular-margin-contrastive-loss-for","title":"AMC-Loss: Angular Margin Contrastive Loss for Improved Explainability in Image Classification","date":"2020-04-21","arxiv_id":"2004.09805","repositories_listed":1,"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":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) · 3 unverified","sample_list":"/paper/amc-loss-angular-margin-contrastive-loss-for#ran","syntology_url":"https://syntology.ai/paper/2004.09805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09805"}},"official":{"repos":["hchoi71/AMC-Loss"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/tensor-networks-for-medical-image","slug":"tensor-networks-for-medical-image","title":"Tensor Networks for Medical Image Classification","date":"2020-04-21","arxiv_id":"2004.10076","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"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 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) · 1 unverified","sample_list":"/paper/tensor-networks-for-medical-image#ran","syntology_url":"https://syntology.ai/paper/2004.10076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10076"}},"official":{"repos":["bitbucket.org/raghavian/lotenet_pytorch","raghavian/loTeNet_pytorch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/local-search-is-a-remarkably-strong-baseline","slug":"local-search-is-a-remarkably-strong-baseline","title":"Local Search is a Remarkably Strong Baseline for Neural Architecture Search","date":"2020-04-20","arxiv_id":"2004.08996","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/local-search-is-a-remarkably-strong-baseline#ran","syntology_url":"https://syntology.ai/paper/2004.08996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08996"}},"official":{"repos":["ArkadiyD/MacroNASBenchmark","tdenottelander/MacroNAS"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lsq-improving-low-bit-quantization-through","slug":"lsq-improving-low-bit-quantization-through","title":"LSQ+: Improving low-bit quantization through learnable offsets and better initialization","date":"2020-04-20","arxiv_id":"2004.09576","repositories_listed":4,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":10,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/lsq-improving-low-bit-quantization-through#ran","syntology_url":"https://syntology.ai/paper/2004.09576","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09576"}},"official":null}},{"url":"/paper/resnest-split-attention-networks","slug":"resnest-split-attention-networks","title":"ResNeSt: Split-Attention Networks","date":"2020-04-19","arxiv_id":"2004.08955","repositories_listed":36,"syntology":{"n":48,"n_ran":28,"n_constructed":0,"n_ran_checked":25,"n_instrument":3,"n_unverified":20,"n_honours":0,"n_violates":0,"n_no_contract":25,"n_pointer_only":23,"phrase":"28 ran (of which 0 constructed an object rather than computing a result; 25 with no instrument failure: 0 honoured, 0 violated, 25 with no contract checked; 3 where Syntology's instrument failed) · 20 unverified","sample_list":"/paper/resnest-split-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2004.08955","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08955"}},"official":{"repos":["zhanghang1989/ResNeSt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/ktrain-a-low-code-library-for-augmented","slug":"ktrain-a-low-code-library-for-augmented","title":"ktrain: A Low-Code Library for Augmented Machine Learning","date":"2020-04-19","arxiv_id":"2004.10703","repositories_listed":4,"syntology":{"n":16,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":12,"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) · 12 unverified","sample_list":"/paper/ktrain-a-low-code-library-for-augmented#ran","syntology_url":"https://syntology.ai/paper/2004.10703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10703"}},"official":{"repos":["amaiya/ktrain"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":10,"ran_from_kinds":["listed"]}}},{"url":"/paper/semi-supervised-semantic-segmentation-via","slug":"semi-supervised-semantic-segmentation-via","title":"DMT: Dynamic Mutual Training for Semi-Supervised Learning","date":"2020-04-18","arxiv_id":"2004.08514","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semi-supervised-semantic-segmentation-via#ran","syntology_url":"https://syntology.ai/paper/2004.08514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08514"}},"official":{"repos":["voldemortX/DST-CBC"],"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/improved-residual-networks-for-image-and","slug":"improved-residual-networks-for-image-and","title":"Improved Residual Networks for Image and Video Recognition","date":"2020-04-10","arxiv_id":"2004.04989","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/improved-residual-networks-for-image-and#ran","syntology_url":"https://syntology.ai/paper/2004.04989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04989"}},"official":{"repos":["iduta/iresnet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/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/network-adjustment-channel-search-guided-by","slug":"network-adjustment-channel-search-guided-by","title":"Network Adjustment: Channel Search Guided by FLOPs Utilization Ratio","date":"2020-04-06","arxiv_id":"2004.02767","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/network-adjustment-channel-search-guided-by#ran","syntology_url":"https://syntology.ai/paper/2004.02767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02767"}},"official":{"repos":["danczs/NetworkAdjustment"],"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/evolving-normalization-activation-layers","slug":"evolving-normalization-activation-layers","title":"Evolving Normalization-Activation Layers","date":"2020-04-06","arxiv_id":"2004.02967","repositories_listed":8,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/evolving-normalization-activation-layers#ran","syntology_url":"https://syntology.ai/paper/2004.02967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02967"}},"official":null}},{"url":"/paper/approximate-manifold-defense-against-multiple","slug":"approximate-manifold-defense-against-multiple","title":"Approximate Manifold Defense Against Multiple Adversarial Perturbations","date":"2020-04-05","arxiv_id":"2004.02183","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/approximate-manifold-defense-against-multiple#ran","syntology_url":"https://syntology.ai/paper/2004.02183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02183"}},"official":{"repos":["jayjaynandy/RBF-CNN"],"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/neural-architecture-search-for-lightweight","slug":"neural-architecture-search-for-lightweight","title":"Neural Architecture Search for Lightweight Non-Local Networks","date":"2020-04-04","arxiv_id":"2004.01961","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-architecture-search-for-lightweight#ran","syntology_url":"https://syntology.ai/paper/2004.01961","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01961"}},"official":{"repos":["LiYingwei/AutoNL"],"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/objectnet-dataset-reanalysis-and-correction","slug":"objectnet-dataset-reanalysis-and-correction","title":"ObjectNet Dataset: Reanalysis and Correction","date":"2020-04-04","arxiv_id":"2004.02042","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/objectnet-dataset-reanalysis-and-correction#ran","syntology_url":"https://syntology.ai/paper/2004.02042","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02042"}},"official":{"repos":["aliborji/ObjectNetReanalysis"],"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/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/controllable-orthogonalization-in-training","slug":"controllable-orthogonalization-in-training","title":"Controllable Orthogonalization in Training DNNs","date":"2020-04-02","arxiv_id":"2004.00917","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"8 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/controllable-orthogonalization-in-training#ran","syntology_url":"https://syntology.ai/paper/2004.00917","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00917"}},"official":{"repos":["huangleiBuaa/ONI"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/editable-neural-networks-1","slug":"editable-neural-networks-1","title":"Editable Neural Networks","date":"2020-04-01","arxiv_id":"2004.00345","repositories_listed":5,"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":1,"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/editable-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2004.00345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00345"}},"official":{"repos":["editable-ICLR2020/editable","xtinkt/editable"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/muxconv-information-multiplexing-in","slug":"muxconv-information-multiplexing-in","title":"MUXConv: Information Multiplexing in Convolutional Neural Networks","date":"2020-03-31","arxiv_id":"2003.13880","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/muxconv-information-multiplexing-in#ran","syntology_url":"https://syntology.ai/paper/2003.13880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13880"}},"official":{"repos":["human-analysis/MUXConv"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/regularizing-class-wise-predictions-via-self","slug":"regularizing-class-wise-predictions-via-self","title":"Regularizing Class-wise Predictions via Self-knowledge Distillation","date":"2020-03-31","arxiv_id":"2003.13964","repositories_listed":1,"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/regularizing-class-wise-predictions-via-self#ran","syntology_url":"https://syntology.ai/paper/2003.13964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13964"}},"official":{"repos":["alinlab/cs-kd"],"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","unlocated"]}}},{"url":"/paper/learning-from-small-data-through-sampling-an","slug":"learning-from-small-data-through-sampling-an","title":"Generative Latent Implicit Conditional Optimization when Learning from Small Sample","date":"2020-03-31","arxiv_id":"2003.14297","repositories_listed":1,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/learning-from-small-data-through-sampling-an#ran","syntology_url":"https://syntology.ai/paper/2003.14297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.14297"}},"official":{"repos":["IdanAzuri/glico-learning-small-sample"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/designing-network-design-spaces","slug":"designing-network-design-spaces","title":"Designing Network Design Spaces","date":"2020-03-30","arxiv_id":"2003.13678","repositories_listed":26,"syntology":{"n":53,"n_ran":48,"n_constructed":0,"n_ran_checked":41,"n_instrument":7,"n_unverified":5,"n_honours":4,"n_violates":0,"n_no_contract":37,"n_pointer_only":7,"phrase":"48 ran (of which 0 constructed an object rather than computing a result; 41 with no instrument failure: 4 honoured, 0 violated, 37 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/designing-network-design-spaces#ran","syntology_url":"https://syntology.ai/paper/2003.13678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13678"}},"official":{"repos":["facebookresearch/pycls"],"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/dhp-differentiable-meta-pruning-via","slug":"dhp-differentiable-meta-pruning-via","title":"DHP: Differentiable Meta Pruning via HyperNetworks","date":"2020-03-30","arxiv_id":"2003.13683","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dhp-differentiable-meta-pruning-via#ran","syntology_url":"https://syntology.ai/paper/2003.13683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13683"}},"official":{"repos":["ofsoundof/dhp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/milking-cowmask-for-semi-supervised-image","slug":"milking-cowmask-for-semi-supervised-image","title":"Milking CowMask for Semi-Supervised Image Classification","date":"2020-03-26","arxiv_id":"2003.12022","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/milking-cowmask-for-semi-supervised-image#ran","syntology_url":"https://syntology.ai/paper/2003.12022","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12022"}},"official":{"repos":["google-research/google-research"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-few-shot-image-classification-a","slug":"rethinking-few-shot-image-classification-a","title":"Rethinking Few-Shot Image Classification: a Good Embedding Is All You Need?","date":"2020-03-25","arxiv_id":"2003.11539","repositories_listed":3,"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/rethinking-few-shot-image-classification-a#ran","syntology_url":"https://syntology.ai/paper/2003.11539","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11539"}},"official":{"repos":["WangYueFt/rfs"],"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":["listed","official","unlocated"]}}},{"url":"/paper/model-based-asynchronous-hyperparameter","slug":"model-based-asynchronous-hyperparameter","title":"Model-based Asynchronous Hyperparameter and Neural Architecture Search","date":"2020-03-24","arxiv_id":"2003.10865","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":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/model-based-asynchronous-hyperparameter#ran","syntology_url":"https://syntology.ai/paper/2003.10865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10865"}},"official":{"repos":["awslabs/syne-tune"],"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/meta-pseudo-labels","slug":"meta-pseudo-labels","title":"Meta Pseudo Labels","date":"2020-03-23","arxiv_id":"2003.10580","repositories_listed":9,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"12 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-pseudo-labels#ran","syntology_url":"https://syntology.ai/paper/2003.10580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10580"}},"official":{"repos":["google-research/google-research"],"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/adversarial-continual-learning","slug":"adversarial-continual-learning","title":"Adversarial Continual Learning","date":"2020-03-21","arxiv_id":"2003.09553","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-continual-learning#ran","syntology_url":"https://syntology.ai/paper/2003.09553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09553"}},"official":{"repos":["facebookresearch/Adversarial-Continual-Learning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/overinterpretation-reveals-image","slug":"overinterpretation-reveals-image","title":"Overinterpretation reveals image classification model pathologies","date":"2020-03-19","arxiv_id":"2003.08907","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/overinterpretation-reveals-image#ran","syntology_url":"https://syntology.ai/paper/2003.08907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.08907"}},"official":{"repos":["gifford-lab/overinterpretation"],"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":["listed","official"]}}},{"url":"/paper/axial-deeplab-stand-alone-axial-attention-for","slug":"axial-deeplab-stand-alone-axial-attention-for","title":"Axial-DeepLab: Stand-Alone Axial-Attention for Panoptic Segmentation","date":"2020-03-17","arxiv_id":"2003.07853","repositories_listed":5,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":3,"n_honours":0,"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; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/axial-deeplab-stand-alone-axial-attention-for#ran","syntology_url":"https://syntology.ai/paper/2003.07853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07853"}},"official":{"repos":["google-research/deeplab2"],"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":["named_in_paper"]}}},{"url":"/paper/synthesizing-human-like-sketches-from-natural","slug":"synthesizing-human-like-sketches-from-natural","title":"Synthesizing human-like sketches from natural images using a conditional convolutional decoder","date":"2020-03-16","arxiv_id":"2003.07101","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/synthesizing-human-like-sketches-from-natural#ran","syntology_url":"https://syntology.ai/paper/2003.07101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07101"}},"official":{"repos":["kampelmuehler/synthesizing_human_like_sketches"],"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/deepemd-few-shot-image-classification-with","slug":"deepemd-few-shot-image-classification-with","title":"DeepEMD: Differentiable Earth Mover's Distance for Few-Shot Learning","date":"2020-03-15","arxiv_id":"2003.06777","repositories_listed":5,"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":1,"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/deepemd-few-shot-image-classification-with#ran","syntology_url":"https://syntology.ai/paper/2003.06777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.06777"}},"official":null}},{"url":"/paper/improved-baselines-with-momentum-contrastive","slug":"improved-baselines-with-momentum-contrastive","title":"Improved Baselines with Momentum Contrastive Learning","date":"2020-03-09","arxiv_id":"2003.04297","repositories_listed":36,"syntology":{"n":43,"n_ran":28,"n_constructed":0,"n_ran_checked":21,"n_instrument":7,"n_unverified":15,"n_honours":0,"n_violates":1,"n_no_contract":20,"n_pointer_only":15,"phrase":"28 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 1 violated, 20 with no contract checked; 7 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/improved-baselines-with-momentum-contrastive#ran","syntology_url":"https://syntology.ai/paper/2003.04297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04297"}},"official":{"repos":["facebookresearch/moco"],"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/clean-label-backdoor-attacks-on-video","slug":"clean-label-backdoor-attacks-on-video","title":"Clean-Label Backdoor Attacks on Video Recognition Models","date":"2020-03-06","arxiv_id":"2003.03030","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/clean-label-backdoor-attacks-on-video#ran","syntology_url":"https://syntology.ai/paper/2003.03030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03030"}},"official":{"repos":["ShihaoZhaoZSH/Video-Backdoor-Attack"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tasknorm-rethinking-batch-normalization-for","slug":"tasknorm-rethinking-batch-normalization-for","title":"TaskNorm: Rethinking Batch Normalization for Meta-Learning","date":"2020-03-06","arxiv_id":"2003.03284","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tasknorm-rethinking-batch-normalization-for#ran","syntology_url":"https://syntology.ai/paper/2003.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03284"}},"official":{"repos":["cambridge-mlg/cnaps"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/black-box-smoothing-a-provable-defense-for","slug":"black-box-smoothing-a-provable-defense-for","title":"Denoised Smoothing: A Provable Defense for Pretrained Classifiers","date":"2020-03-04","arxiv_id":"2003.01908","repositories_listed":4,"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/black-box-smoothing-a-provable-defense-for#ran","syntology_url":"https://syntology.ai/paper/2003.01908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01908"}},"official":{"repos":["microsoft/blackbox-smoothing","microsoft/denoised-smoothing"],"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/curriculum-by-texture","slug":"curriculum-by-texture","title":"Curriculum By Smoothing","date":"2020-03-03","arxiv_id":"2003.01367","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":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) · 1 unverified","sample_list":"/paper/curriculum-by-texture#ran","syntology_url":"https://syntology.ai/paper/2003.01367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01367"}},"official":{"repos":["pairlab/CBS"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/out-of-distribution-generalization-via-risk","slug":"out-of-distribution-generalization-via-risk","title":"Out-of-Distribution Generalization via Risk Extrapolation (REx)","date":"2020-03-02","arxiv_id":"2003.00688","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 1 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) · 1 unverified","sample_list":"/paper/out-of-distribution-generalization-via-risk#ran","syntology_url":"https://syntology.ai/paper/2003.00688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00688"}},"official":{"repos":["capybaralet/REx_code_release"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-neural-networks-with-maximum-mean","slug":"bayesian-neural-networks-with-maximum-mean","title":"Bayesian Neural Networks With Maximum Mean Discrepancy Regularization","date":"2020-03-02","arxiv_id":"2003.00952","repositories_listed":4,"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":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) · 1 unverified","sample_list":"/paper/bayesian-neural-networks-with-maximum-mean#ran","syntology_url":"https://syntology.ai/paper/2003.00952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00952"}},"official":{"repos":["ispamm/MMD-Bayesian-Neural-Network"],"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/understanding-and-enhancing-mixed-sample-data","slug":"understanding-and-enhancing-mixed-sample-data","title":"FMix: Enhancing Mixed Sample Data Augmentation","date":"2020-02-27","arxiv_id":"2002.12047","repositories_listed":5,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":1,"n_instrument":7,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"8 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; 7 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-and-enhancing-mixed-sample-data#ran","syntology_url":"https://syntology.ai/paper/2002.12047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12047"}},"official":{"repos":["ecs-vlc/FMix"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/on-feature-normalization-and-data","slug":"on-feature-normalization-and-data","title":"On Feature Normalization and Data Augmentation","date":"2020-02-25","arxiv_id":"2002.11102","repositories_listed":1,"syntology":{"n":14,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 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; 3 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/on-feature-normalization-and-data#ran","syntology_url":"https://syntology.ai/paper/2002.11102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.11102"}},"official":{"repos":["Boyiliee/MoEx"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-spike-sequence-learning-via","slug":"temporal-spike-sequence-learning-via","title":"Temporal Spike Sequence Learning via Backpropagation for Deep Spiking Neural Networks","date":"2020-02-24","arxiv_id":"2002.10085","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/temporal-spike-sequence-learning-via#ran","syntology_url":"https://syntology.ai/paper/2002.10085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10085"}},"official":{"repos":["stonezwr/TSSL-BP"],"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":["official"]}}},{"url":"/paper/towards-robust-and-reproducible-active","slug":"towards-robust-and-reproducible-active","title":"Towards Robust and Reproducible Active Learning Using Neural Networks","date":"2020-02-21","arxiv_id":"2002.09564","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":6,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 2 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-robust-and-reproducible-active#ran","syntology_url":"https://syntology.ai/paper/2002.09564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09564"}},"official":{"repos":["prateekmunjal/torchal"],"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/kaokore-a-pre-modern-japanese-art-facial","slug":"kaokore-a-pre-modern-japanese-art-facial","title":"KaoKore: A Pre-modern Japanese Art Facial Expression Dataset","date":"2020-02-20","arxiv_id":"2002.08595","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 0 unverified","sample_list":"/paper/kaokore-a-pre-modern-japanese-art-facial#ran","syntology_url":"https://syntology.ai/paper/2002.08595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08595"}},"official":{"repos":["rois-codh/kaokore"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-scale-representation-learning-for-1","slug":"multi-scale-representation-learning-for-1","title":"Multi-Scale Representation Learning for Spatial Feature Distributions using Grid Cells","date":"2020-02-16","arxiv_id":"2003.00824","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-scale-representation-learning-for-1#ran","syntology_url":"https://syntology.ai/paper/2003.00824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00824"}},"official":{"repos":["gengchenmai/space2vec"],"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"]}}},{"url":"/paper/a-simple-framework-for-contrastive-learning","slug":"a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","arxiv_id":"2002.05709","repositories_listed":96,"syntology":{"n":137,"n_ran":115,"n_constructed":33,"n_ran_checked":90,"n_instrument":25,"n_unverified":22,"n_honours":1,"n_violates":1,"n_no_contract":88,"n_pointer_only":52,"phrase":"115 ran (of which 33 constructed an object rather than computing a result; 90 with no instrument failure: 1 honoured, 1 violated, 88 with no contract checked; 25 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/a-simple-framework-for-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2002.05709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05709"}},"official":{"repos":["google-research/simclr"],"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/cross-iteration-batch-normalization","slug":"cross-iteration-batch-normalization","title":"Cross-Iteration Batch Normalization","date":"2020-02-13","arxiv_id":"2002.05712","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cross-iteration-batch-normalization#ran","syntology_url":"https://syntology.ai/paper/2002.05712","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05712"}},"official":{"repos":["Howal/Cross-iterationBatchNorm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/scalable-and-practical-natural-gradient-for","slug":"scalable-and-practical-natural-gradient-for","title":"Scalable and Practical Natural Gradient for Large-Scale Deep Learning","date":"2020-02-13","arxiv_id":"2002.06015","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/scalable-and-practical-natural-gradient-for#ran","syntology_url":"https://syntology.ai/paper/2002.06015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06015"}},"official":{"repos":["tyohei/chainerkfac"],"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/capsules-with-inverted-dot-product-attention-1","slug":"capsules-with-inverted-dot-product-attention-1","title":"Capsules with Inverted Dot-Product Attention Routing","date":"2020-02-12","arxiv_id":"2002.04764","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/capsules-with-inverted-dot-product-attention-1#ran","syntology_url":"https://syntology.ai/paper/2002.04764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04764"}},"official":{"repos":["apple/ml-capsules-inverted-attention-routing","yaohungt/Capsules-Inverted-Attention-Routing"],"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":["official"]}}},{"url":"/paper/the-devil-is-in-the-channels-mutual-channel","slug":"the-devil-is-in-the-channels-mutual-channel","title":"The Devil is in the Channels: Mutual-Channel Loss for Fine-Grained Image Classification","date":"2020-02-11","arxiv_id":"2002.04264","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/the-devil-is-in-the-channels-mutual-channel#ran","syntology_url":"https://syntology.ai/paper/2002.04264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04264"}},"official":{"repos":["dongliangchang/Mutual-Channel-Loss"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/near-lossless-post-training-quantization-of","slug":"near-lossless-post-training-quantization-of","title":"Post-Training Piecewise Linear Quantization for Deep Neural Networks","date":"2020-01-31","arxiv_id":"2002.00104","repositories_listed":3,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/near-lossless-post-training-quantization-of#ran","syntology_url":"https://syntology.ai/paper/2002.00104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.00104"}},"official":null}},{"url":"/paper/fixmatch-simplifying-semi-supervised-learning","slug":"fixmatch-simplifying-semi-supervised-learning","title":"FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence","date":"2020-01-21","arxiv_id":"2001.07685","repositories_listed":26,"syntology":{"n":74,"n_ran":53,"n_constructed":13,"n_ran_checked":35,"n_instrument":18,"n_unverified":21,"n_honours":3,"n_violates":2,"n_no_contract":30,"n_pointer_only":17,"phrase":"53 ran (of which 13 constructed an object rather than computing a result; 35 with no instrument failure: 3 honoured, 2 violated, 30 with no contract checked; 18 where Syntology's instrument failed) · 21 unverified","sample_list":"/paper/fixmatch-simplifying-semi-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2001.07685","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.07685"}},"official":{"repos":["google-research/fixmatch"],"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-surgery-for-multi-task-learning-1","slug":"gradient-surgery-for-multi-task-learning-1","title":"Gradient Surgery for Multi-Task Learning","date":"2020-01-19","arxiv_id":"2001.06782","repositories_listed":18,"syntology":{"n":10,"n_ran":7,"n_constructed":5,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"7 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradient-surgery-for-multi-task-learning-1#ran","syntology_url":"https://syntology.ai/paper/2001.06782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06782"}},"official":{"repos":["tianheyu927/PCGrad"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/harmonic-convolutional-networks-based-on","slug":"harmonic-convolutional-networks-based-on","title":"Harmonic Convolutional Networks based on Discrete Cosine Transform","date":"2020-01-18","arxiv_id":"2001.06570","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/harmonic-convolutional-networks-based-on#ran","syntology_url":"https://syntology.ai/paper/2001.06570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06570"}},"official":{"repos":["matej-ulicny/harmonic-networks"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/compounding-the-performance-improvements-of","slug":"compounding-the-performance-improvements-of","title":"Compounding the Performance Improvements of Assembled Techniques in a Convolutional Neural Network","date":"2020-01-17","arxiv_id":"2001.06268","repositories_listed":1,"syntology":{"n":11,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/compounding-the-performance-improvements-of#ran","syntology_url":"https://syntology.ai/paper/2001.06268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06268"}},"official":{"repos":["clovaai/assembled-cnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/adapting-grad-cam-for-embedding-networks","slug":"adapting-grad-cam-for-embedding-networks","title":"Adapting Grad-CAM for Embedding Networks","date":"2020-01-17","arxiv_id":"2001.06538","repositories_listed":1,"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/adapting-grad-cam-for-embedding-networks#ran","syntology_url":"https://syntology.ai/paper/2001.06538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06538"}},"official":null}},{"url":"/paper/curriculum-labeling-self-paced-pseudo","slug":"curriculum-labeling-self-paced-pseudo","title":"Curriculum Labeling: Revisiting Pseudo-Labeling for Semi-Supervised Learning","date":"2020-01-16","arxiv_id":"2001.06001","repositories_listed":1,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":11,"n_instrument":6,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":4,"phrase":"17 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; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/curriculum-labeling-self-paced-pseudo#ran","syntology_url":"https://syntology.ai/paper/2001.06001","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06001"}},"official":{"repos":["uvavision/Curriculum-Labeling"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-neural-network-adaptation-via-parameter","slug":"fast-neural-network-adaptation-via-parameter","title":"Fast Neural Network Adaptation via Parameter Remapping and Architecture Search","date":"2020-01-08","arxiv_id":"2001.02525","repositories_listed":0,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fast-neural-network-adaptation-via-parameter#ran","syntology_url":"https://syntology.ai/paper/2001.02525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.02525"}},"official":null}},{"url":"/paper/sparse-weight-activation-training-1","slug":"sparse-weight-activation-training-1","title":"Sparse Weight Activation Training","date":"2020-01-07","arxiv_id":"2001.01969","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 3 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; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/sparse-weight-activation-training-1#ran","syntology_url":"https://syntology.ai/paper/2001.01969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01969"}},"official":{"repos":["AamirRaihan/SWAT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-troublesome-kernel-why-deep-learning-for","slug":"the-troublesome-kernel-why-deep-learning-for","title":"The troublesome kernel -- On hallucinations, no free lunches and the accuracy-stability trade-off in inverse problems","date":"2020-01-05","arxiv_id":"2001.01258","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-troublesome-kernel-why-deep-learning-for#ran","syntology_url":"https://syntology.ai/paper/2001.01258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01258"}},"official":{"repos":["vegarant/troublesome_kernel"],"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/fdftnet-facing-off-fake-images-using-fake","slug":"fdftnet-facing-off-fake-images-using-fake","title":"FDFtNet: Facing Off Fake Images using Fake Detection Fine-tuning Network","date":"2020-01-05","arxiv_id":"2001.01265","repositories_listed":2,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/fdftnet-facing-off-fake-images-using-fake#ran","syntology_url":"https://syntology.ai/paper/2001.01265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01265"}},"official":{"repos":["cutz-j/FDFtNet"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/discrimination-aware-network-pruning-for-deep","slug":"discrimination-aware-network-pruning-for-deep","title":"Discrimination-aware Network Pruning for Deep Model Compression","date":"2020-01-04","arxiv_id":"2001.01050","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 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) · 2 unverified","sample_list":"/paper/discrimination-aware-network-pruning-for-deep#ran","syntology_url":"https://syntology.ai/paper/2001.01050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01050"}},"official":{"repos":["SCUT-AILab/DCP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-neural-dirichlet-process-mixture-model-for","slug":"a-neural-dirichlet-process-mixture-model-for","title":"A Neural Dirichlet Process Mixture Model for Task-Free Continual Learning","date":"2020-01-03","arxiv_id":"2001.00689","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-neural-dirichlet-process-mixture-model-for#ran","syntology_url":"https://syntology.ai/paper/2001.00689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00689"}},"official":{"repos":["soochan-lee/CN-DPM"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/layoutlm-pre-training-of-text-and-layout-for","slug":"layoutlm-pre-training-of-text-and-layout-for","title":"LayoutLM: Pre-training of Text and Layout for Document Image Understanding","date":"2019-12-31","arxiv_id":"1912.13318","repositories_listed":19,"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":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) · 1 unverified","sample_list":"/paper/layoutlm-pre-training-of-text-and-layout-for#ran","syntology_url":"https://syntology.ai/paper/1912.13318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.13318"}},"official":{"repos":["microsoft/unilm"],"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/semi-supervised-learning-with-normalizing-1","slug":"semi-supervised-learning-with-normalizing-1","title":"Semi-Supervised Learning with Normalizing Flows","date":"2019-12-30","arxiv_id":"1912.13025","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semi-supervised-learning-with-normalizing-1#ran","syntology_url":"https://syntology.ai/paper/1912.13025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.13025"}},"official":{"repos":["izmailovpavel/flowgmm"],"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/sess-self-ensembling-semi-supervised-3d","slug":"sess-self-ensembling-semi-supervised-3d","title":"SESS: Self-Ensembling Semi-Supervised 3D Object Detection","date":"2019-12-26","arxiv_id":"1912.11803","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"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; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sess-self-ensembling-semi-supervised-3d#ran","syntology_url":"https://syntology.ai/paper/1912.11803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11803"}},"official":{"repos":["Na-Z/sess"],"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/large-scale-learning-of-general-visual","slug":"large-scale-learning-of-general-visual","title":"Big Transfer (BiT): General Visual Representation Learning","date":"2019-12-24","arxiv_id":"1912.11370","repositories_listed":9,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/large-scale-learning-of-general-visual#ran","syntology_url":"https://syntology.ai/paper/1912.11370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11370"}},"official":{"repos":["google-research/big_transfer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-to-impute-a-general-framework-for-1","slug":"learning-to-impute-a-general-framework-for-1","title":"Learning to Impute: A General Framework for Semi-supervised Learning","date":"2019-12-22","arxiv_id":"1912.10364","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-impute-a-general-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/1912.10364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.10364"}},"official":{"repos":["VICO-UoE/L2I"],"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/overcoming-long-term-catastrophic-forgetting","slug":"overcoming-long-term-catastrophic-forgetting","title":"Overcoming Long-term Catastrophic Forgetting through Adversarial Neural Pruning and Synaptic Consolidation","date":"2019-12-19","arxiv_id":"1912.09091","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/overcoming-long-term-catastrophic-forgetting#ran","syntology_url":"https://syntology.ai/paper/1912.09091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.09091"}},"official":{"repos":["GeoX-Lab/ANPyC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-verifying-robustness-of-neural","slug":"towards-verifying-robustness-of-neural","title":"Towards Verifying Robustness of Neural Networks Against Semantic Perturbations","date":"2019-12-19","arxiv_id":"1912.09533","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/towards-verifying-robustness-of-neural#ran","syntology_url":"https://syntology.ai/paper/1912.09533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.09533"}},"official":{"repos":["JeetMo/Semantify-NN"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/direction-concentration-learning-enhancing","slug":"direction-concentration-learning-enhancing","title":"Direction Concentration Learning: Enhancing Congruency in Machine Learning","date":"2019-12-17","arxiv_id":"1912.08136","repositories_listed":1,"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":4,"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/direction-concentration-learning-enhancing#ran","syntology_url":"https://syntology.ai/paper/1912.08136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08136"}},"official":{"repos":["luoyan407/congruency"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-disentangled-representations-via-1","slug":"learning-disentangled-representations-via-1","title":"Learning Disentangled Representations via Mutual Information Estimation","date":"2019-12-09","arxiv_id":"1912.03915","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":1,"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/learning-disentangled-representations-via-1#ran","syntology_url":"https://syntology.ai/paper/1912.03915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03915"}},"official":null}},{"url":"/paper/dynamic-convolution-attention-over","slug":"dynamic-convolution-attention-over","title":"Dynamic Convolution: Attention over Convolution Kernels","date":"2019-12-07","arxiv_id":"1912.03458","repositories_listed":5,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":1,"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; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dynamic-convolution-attention-over#ran","syntology_url":"https://syntology.ai/paper/1912.03458","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03458"}},"official":null}},{"url":"/paper/dynamic-convolutions-exploiting-spatial","slug":"dynamic-convolutions-exploiting-spatial","title":"Dynamic Convolutions: Exploiting Spatial Sparsity for Faster Inference","date":"2019-12-06","arxiv_id":"1912.03203","repositories_listed":1,"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/dynamic-convolutions-exploiting-spatial#ran","syntology_url":"https://syntology.ai/paper/1912.03203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03203"}},"official":{"repos":["thomasverelst/dynconv"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/augmix-a-simple-data-processing-method-to","slug":"augmix-a-simple-data-processing-method-to","title":"AugMix: A Simple Data Processing Method to Improve Robustness and Uncertainty","date":"2019-12-05","arxiv_id":"1912.02781","repositories_listed":15,"syntology":{"n":51,"n_ran":46,"n_constructed":0,"n_ran_checked":9,"n_instrument":37,"n_unverified":5,"n_honours":4,"n_violates":2,"n_no_contract":3,"n_pointer_only":25,"phrase":"46 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 4 honoured, 2 violated, 3 with no contract checked; 37 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/augmix-a-simple-data-processing-method-to#ran","syntology_url":"https://syntology.ai/paper/1912.02781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.02781"}},"official":{"repos":["google-research/augmix"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/less-is-better-unweighted-data-subsampling","slug":"less-is-better-unweighted-data-subsampling","title":"Less Is Better: Unweighted Data Subsampling via Influence Function","date":"2019-12-03","arxiv_id":"1912.01321","repositories_listed":1,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/less-is-better-unweighted-data-subsampling#ran","syntology_url":"https://syntology.ai/paper/1912.01321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.01321"}},"official":{"repos":["RyanWangZf/Influence_Subsampling"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/ap-perf-incorporating-generic-performance","slug":"ap-perf-incorporating-generic-performance","title":"AP-Perf: Incorporating Generic Performance Metrics in Differentiable Learning","date":"2019-12-02","arxiv_id":"1912.00965","repositories_listed":4,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ap-perf-incorporating-generic-performance#ran","syntology_url":"https://syntology.ai/paper/1912.00965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00965"}},"official":{"repos":["rizalzaf/AP-examples","rizalzaf/AdversarialPrediction.jl"],"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/sgas-sequential-greedy-architecture-search","slug":"sgas-sequential-greedy-architecture-search","title":"SGAS: Sequential Greedy Architecture Search","date":"2019-11-30","arxiv_id":"1912.00195","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/sgas-sequential-greedy-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1912.00195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00195"}},"official":null}},{"url":"/paper/whats-hidden-in-a-randomly-weighted-neural","slug":"whats-hidden-in-a-randomly-weighted-neural","title":"What's Hidden in a Randomly Weighted Neural Network?","date":"2019-11-29","arxiv_id":"1911.13299","repositories_listed":4,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":5,"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) · 0 unverified","sample_list":"/paper/whats-hidden-in-a-randomly-weighted-neural#ran","syntology_url":"https://syntology.ai/paper/1911.13299","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.13299"}},"official":{"repos":["allenai/hidden-networks"],"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"]}}},{"url":"/paper/ghostnet-more-features-from-cheap-operations","slug":"ghostnet-more-features-from-cheap-operations","title":"GhostNet: More Features from Cheap Operations","date":"2019-11-27","arxiv_id":"1911.11907","repositories_listed":33,"syntology":{"n":23,"n_ran":19,"n_constructed":0,"n_ran_checked":16,"n_instrument":3,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":14,"n_pointer_only":5,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 2 honoured, 0 violated, 14 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ghostnet-more-features-from-cheap-operations#ran","syntology_url":"https://syntology.ai/paper/1911.11907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11907"}},"official":{"repos":["huawei-noah/ghostnet"],"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/orthogonal-convolutional-neural-networks","slug":"orthogonal-convolutional-neural-networks","title":"Orthogonal Convolutional Neural Networks","date":"2019-11-27","arxiv_id":"1911.12207","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/orthogonal-convolutional-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1911.12207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.12207"}},"official":{"repos":["samaonline/Orthogonal-Convolutional-Neural-Networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-with-gaussian-differential","slug":"deep-learning-with-gaussian-differential","title":"Deep Learning with Gaussian Differential Privacy","date":"2019-11-26","arxiv_id":"1911.11607","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":3,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-learning-with-gaussian-differential#ran","syntology_url":"https://syntology.ai/paper/1911.11607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11607"}},"official":{"repos":["woodyx218/Deep-Learning-with-GDP"],"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/rigging-the-lottery-making-all-tickets-1","slug":"rigging-the-lottery-making-all-tickets-1","title":"Rigging the Lottery: Making All Tickets Winners","date":"2019-11-25","arxiv_id":"1911.11134","repositories_listed":11,"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/rigging-the-lottery-making-all-tickets-1#ran","syntology_url":"https://syntology.ai/paper/1911.11134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11134"}},"official":{"repos":["google-research/rigl","varun19299/rigl-reproducibility"],"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/quantization-networks-1","slug":"quantization-networks-1","title":"Quantization Networks","date":"2019-11-21","arxiv_id":"1911.09464","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quantization-networks-1#ran","syntology_url":"https://syntology.ai/paper/1911.09464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09464"}},"official":{"repos":["aliyun/alibabacloud-quantization-networks"],"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/adversarial-examples-improve-image","slug":"adversarial-examples-improve-image","title":"Adversarial Examples Improve Image Recognition","date":"2019-11-21","arxiv_id":"1911.09665","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":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-examples-improve-image#ran","syntology_url":"https://syntology.ai/paper/1911.09665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09665"}},"official":{"repos":["tensorflow/tpu"],"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/filter-response-normalization-layer","slug":"filter-response-normalization-layer","title":"Filter Response Normalization Layer: Eliminating Batch Dependence in the Training of Deep Neural Networks","date":"2019-11-21","arxiv_id":"1911.09737","repositories_listed":16,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/filter-response-normalization-layer#ran","syntology_url":"https://syntology.ai/paper/1911.09737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09737"}},"official":null}},{"url":"/paper/remixmatch-semi-supervised-learning-with-1","slug":"remixmatch-semi-supervised-learning-with-1","title":"ReMixMatch: Semi-Supervised Learning with Distribution Alignment and Augmentation Anchoring","date":"2019-11-21","arxiv_id":"1911.09785","repositories_listed":3,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/remixmatch-semi-supervised-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/1911.09785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09785"}},"official":{"repos":["google-research/remixmatch","google-research/mixmatch"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/rethinking-deep-active-learning-using-1","slug":"rethinking-deep-active-learning-using-1","title":"Rethinking deep active learning: Using unlabeled data at model training","date":"2019-11-19","arxiv_id":"1911.08177","repositories_listed":1,"syntology":{"n":21,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":13,"n_pointer_only":3,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 2 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/rethinking-deep-active-learning-using-1#ran","syntology_url":"https://syntology.ai/paper/1911.08177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08177"}},"official":{"repos":["osimeoni/RethinkingDeepActiveLearning"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-reinforced-synthetic-data-for-one-shot-1","slug":"meta-reinforced-synthetic-data-for-one-shot-1","title":"Meta-Reinforced Synthetic Data for One-Shot Fine-Grained Visual Recognition","date":"2019-11-17","arxiv_id":"1911.07164","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/meta-reinforced-synthetic-data-for-one-shot-1#ran","syntology_url":"https://syntology.ai/paper/1911.07164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.07164"}},"official":{"repos":["apple2373/MetaIRNet"],"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/self-supervised-learning-for-few-shot-image","slug":"self-supervised-learning-for-few-shot-image","title":"Self-Supervised Learning For Few-Shot Image Classification","date":"2019-11-14","arxiv_id":"1911.06045","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":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) · 0 unverified","sample_list":"/paper/self-supervised-learning-for-few-shot-image#ran","syntology_url":"https://syntology.ai/paper/1911.06045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06045"}},"official":{"repos":["Alibaba-AAIG/SSL-FEW-SHOT"],"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":["named_in_paper"]}}},{"url":"/paper/momentum-contrast-for-unsupervised-visual","slug":"momentum-contrast-for-unsupervised-visual","title":"Momentum Contrast for Unsupervised Visual Representation Learning","date":"2019-11-13","arxiv_id":"1911.05722","repositories_listed":44,"syntology":{"n":42,"n_ran":28,"n_constructed":16,"n_ran_checked":23,"n_instrument":5,"n_unverified":14,"n_honours":0,"n_violates":0,"n_no_contract":23,"n_pointer_only":19,"phrase":"28 ran (of which 16 constructed an object rather than computing a result; 23 with no instrument failure: 0 honoured, 0 violated, 23 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/momentum-contrast-for-unsupervised-visual#ran","syntology_url":"https://syntology.ai/paper/1911.05722","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05722"}},"official":{"repos":["facebookresearch/moco","ppwwyyxx/moco.tensorflow"],"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/self-training-with-noisy-student-improves","slug":"self-training-with-noisy-student-improves","title":"Self-training with Noisy Student improves ImageNet classification","date":"2019-11-11","arxiv_id":"1911.04252","repositories_listed":13,"syntology":{"n":24,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":11,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"13 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; 3 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/self-training-with-noisy-student-improves#ran","syntology_url":"https://syntology.ai/paper/1911.04252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04252"}},"official":{"repos":["google-research/noisystudent","tensorflow/tpu"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":10,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/meta-label-correction-for-learning-with-weak-1","slug":"meta-label-correction-for-learning-with-weak-1","title":"Meta Label Correction for Noisy Label Learning","date":"2019-11-10","arxiv_id":"1911.03809","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/meta-label-correction-for-learning-with-weak-1#ran","syntology_url":"https://syntology.ai/paper/1911.03809","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03809"}},"official":{"repos":["microsoft/mlc"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-relationship-between-self-attention-1","slug":"on-the-relationship-between-self-attention-1","title":"On the Relationship between Self-Attention and Convolutional Layers","date":"2019-11-08","arxiv_id":"1911.03584","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":4,"phrase":"13 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-the-relationship-between-self-attention-1#ran","syntology_url":"https://syntology.ai/paper/1911.03584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03584"}},"official":{"repos":["epfml/attention-cnn"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-large-yet-imperceptible-adversarial","slug":"towards-large-yet-imperceptible-adversarial","title":"Towards Large yet Imperceptible Adversarial Image Perturbations with Perceptual Color Distance","date":"2019-11-06","arxiv_id":"1911.02466","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":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-large-yet-imperceptible-adversarial#ran","syntology_url":"https://syntology.ai/paper/1911.02466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02466"}},"official":{"repos":["ZhengyuZhao/PerC-Adversarial"],"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/multimodal-model-agnostic-meta-learning-via","slug":"multimodal-model-agnostic-meta-learning-via","title":"Multimodal Model-Agnostic Meta-Learning via Task-Aware Modulation","date":"2019-10-30","arxiv_id":"1910.13616","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multimodal-model-agnostic-meta-learning-via#ran","syntology_url":"https://syntology.ai/paper/1910.13616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13616"}},"official":{"repos":["vuoristo/MMAML"],"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":"ced4e220a3faa5892c2e92909ddf28fa75cea3d9397f52aa86fad9536ee56043","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}