{"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/10","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":10,"pages_in_order":14,"rows_per_page":100,"rows":[901,1000],"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/9","next":"/task/image-classification/papers/ran/11","papers":[{"url":"/paper/bottleneck-transformers-for-visual","slug":"bottleneck-transformers-for-visual","title":"Bottleneck Transformers for Visual Recognition","date":"2021-01-27","arxiv_id":"2101.11605","repositories_listed":13,"syntology":{"n":49,"n_ran":26,"n_constructed":9,"n_ran_checked":19,"n_instrument":7,"n_unverified":23,"n_honours":1,"n_violates":0,"n_no_contract":18,"n_pointer_only":8,"phrase":"26 ran (of which 9 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 0 violated, 18 with no contract checked; 7 where Syntology's instrument failed) · 23 unverified","sample_list":"/paper/bottleneck-transformers-for-visual#ran","syntology_url":"https://syntology.ai/paper/2101.11605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.11605"}},"official":null}},{"url":"/paper/daf-re-a-challenging-crowd-sourced-large","slug":"daf-re-a-challenging-crowd-sourced-large","title":"DAF:re: A Challenging, Crowd-Sourced, Large-Scale, Long-Tailed Dataset For Anime Character Recognition","date":"2021-01-21","arxiv_id":"2101.08674","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/daf-re-a-challenging-crowd-sourced-large#ran","syntology_url":"https://syntology.ai/paper/2101.08674","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.08674"}},"official":{"repos":["arkel23/animesion"],"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/counterfactual-generative-networks-1","slug":"counterfactual-generative-networks-1","title":"Counterfactual Generative Networks","date":"2021-01-15","arxiv_id":"2101.06046","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/counterfactual-generative-networks-1#ran","syntology_url":"https://syntology.ai/paper/2101.06046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.06046"}},"official":{"repos":["autonomousvision/counterfactual_generative_networks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/repvgg-making-vgg-style-convnets-great-again","slug":"repvgg-making-vgg-style-convnets-great-again","title":"RepVGG: Making VGG-style ConvNets Great Again","date":"2021-01-11","arxiv_id":"2101.03697","repositories_listed":25,"syntology":{"n":16,"n_ran":13,"n_constructed":7,"n_ran_checked":8,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":6,"phrase":"13 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/repvgg-making-vgg-style-convnets-great-again#ran","syntology_url":"https://syntology.ai/paper/2101.03697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.03697"}},"official":{"repos":["DingXiaoH/RepVGG"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/kaleidoscope-an-efficient-learnable-1","slug":"kaleidoscope-an-efficient-learnable-1","title":"Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps","date":"2020-12-29","arxiv_id":"2012.14966","repositories_listed":2,"syntology":{"n":23,"n_ran":16,"n_constructed":9,"n_ran_checked":9,"n_instrument":7,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"16 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 7 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/kaleidoscope-an-efficient-learnable-1#ran","syntology_url":"https://syntology.ai/paper/2012.14966","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.14966"}},"official":{"repos":["HazyResearch/butterfly","HazyResearch/learning-circuits"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":9,"n_ran_no_instrument_failure":9,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/training-data-efficient-image-transformers","slug":"training-data-efficient-image-transformers","title":"Training data-efficient image transformers & distillation through attention","date":"2020-12-23","arxiv_id":"2012.12877","repositories_listed":40,"syntology":{"n":19,"n_ran":12,"n_constructed":1,"n_ran_checked":9,"n_instrument":3,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/training-data-efficient-image-transformers#ran","syntology_url":"https://syntology.ai/paper/2012.12877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.12877"}},"official":{"repos":["facebookresearch/deit"],"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/separation-and-concentration-in-deep-networks","slug":"separation-and-concentration-in-deep-networks","title":"Separation and Concentration in Deep Networks","date":"2020-12-18","arxiv_id":"2012.10424","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/separation-and-concentration-in-deep-networks#ran","syntology_url":"https://syntology.ai/paper/2012.10424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.10424"}},"official":{"repos":["iclr2021-paper1937/separation_concentration_deepnets","j-zarka/separation_concentration_deepnets"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/wilds-a-benchmark-of-in-the-wild-distribution","slug":"wilds-a-benchmark-of-in-the-wild-distribution","title":"WILDS: A Benchmark of in-the-Wild Distribution Shifts","date":"2020-12-14","arxiv_id":"2012.07421","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/wilds-a-benchmark-of-in-the-wild-distribution#ran","syntology_url":"https://syntology.ai/paper/2012.07421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07421"}},"official":{"repos":["p-lambda/wilds"],"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/encoding-the-latent-posterior-of-bayesian","slug":"encoding-the-latent-posterior-of-bayesian","title":"Encoding the latent posterior of Bayesian Neural Networks for uncertainty quantification","date":"2020-12-04","arxiv_id":"2012.02818","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/encoding-the-latent-posterior-of-bayesian#ran","syntology_url":"https://syntology.ai/paper/2012.02818","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.02818"}},"official":null}},{"url":"/paper/how-well-do-self-supervised-models-transfer","slug":"how-well-do-self-supervised-models-transfer","title":"How Well Do Self-Supervised Models Transfer?","date":"2020-11-26","arxiv_id":"2011.13377","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":0,"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/how-well-do-self-supervised-models-transfer#ran","syntology_url":"https://syntology.ai/paper/2011.13377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.13377"}},"official":{"repos":["linusericsson/ssl-transfer"],"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/torchdistill-a-modular-configuration-driven","slug":"torchdistill-a-modular-configuration-driven","title":"torchdistill: A Modular, Configuration-Driven Framework for Knowledge Distillation","date":"2020-11-25","arxiv_id":"2011.12913","repositories_listed":1,"syntology":{"n":26,"n_ran":10,"n_constructed":0,"n_ran_checked":0,"n_instrument":10,"n_unverified":16,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"10 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; 10 where Syntology's instrument failed) · 16 unverified","sample_list":"/paper/torchdistill-a-modular-configuration-driven#ran","syntology_url":"https://syntology.ai/paper/2011.12913","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.12913"}},"official":{"repos":["yoshitomo-matsubara/torchdistill"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":16,"ran_from_kinds":["official"]}}},{"url":"/paper/persistent-mixture-model-networks-for-few","slug":"persistent-mixture-model-networks-for-few","title":"Mixture-based Feature Space Learning for Few-shot Image Classification","date":"2020-11-24","arxiv_id":"2011.11872","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/persistent-mixture-model-networks-for-few#ran","syntology_url":"https://syntology.ai/paper/2011.11872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.11872"}},"official":null}},{"url":"/paper/geography-aware-self-supervised-learning","slug":"geography-aware-self-supervised-learning","title":"Geography-Aware Self-Supervised Learning","date":"2020-11-19","arxiv_id":"2011.09980","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/geography-aware-self-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2011.09980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.09980"}},"official":{"repos":["sustainlab-group/geography-aware-ssl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/error-bounded-correction-of-noisy-labels-1","slug":"error-bounded-correction-of-noisy-labels-1","title":"Error-Bounded Correction of Noisy Labels","date":"2020-11-19","arxiv_id":"2011.10077","repositories_listed":3,"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/error-bounded-correction-of-noisy-labels-1#ran","syntology_url":"https://syntology.ai/paper/2011.10077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.10077"}},"official":{"repos":["pingqingsheng/LRT"],"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/dense-contrastive-learning-for-self","slug":"dense-contrastive-learning-for-self","title":"Dense Contrastive Learning for Self-Supervised Visual Pre-Training","date":"2020-11-18","arxiv_id":"2011.09157","repositories_listed":7,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/dense-contrastive-learning-for-self#ran","syntology_url":"https://syntology.ai/paper/2011.09157","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.09157"}},"official":null}},{"url":"/paper/dual-stream-multiple-instance-learning","slug":"dual-stream-multiple-instance-learning","title":"Dual-stream Multiple Instance Learning Network for Whole Slide Image Classification with Self-supervised Contrastive Learning","date":"2020-11-17","arxiv_id":"2011.08939","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dual-stream-multiple-instance-learning#ran","syntology_url":"https://syntology.ai/paper/2011.08939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.08939"}},"official":{"repos":["binli123/dsmil-wsi"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-layered-tensor-networks-for-image","slug":"multi-layered-tensor-networks-for-image","title":"Multi-layered tensor networks for image classification","date":"2020-11-13","arxiv_id":"2011.06982","repositories_listed":1,"syntology":{"n":17,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":16,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":17,"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) · 16 unverified","sample_list":"/paper/multi-layered-tensor-networks-for-image#ran","syntology_url":"https://syntology.ai/paper/2011.06982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.06982"}},"official":{"repos":["raghavian/mltn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":16,"ran_from_kinds":["official"]}}},{"url":"/paper/a-tunable-robust-pruning-framework-through","slug":"a-tunable-robust-pruning-framework-through","title":"A Tunable Robust Pruning Framework Through Dynamic Network Rewiring of DNNs","date":"2020-11-03","arxiv_id":"2011.03083","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-tunable-robust-pruning-framework-through#ran","syntology_url":"https://syntology.ai/paper/2011.03083","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.03083"}},"official":null}},{"url":"/paper/loss-rescaling-vqa-revisiting-language-prior","slug":"loss-rescaling-vqa-revisiting-language-prior","title":"Loss re-scaling VQA: Revisiting the LanguagePrior Problem from a Class-imbalance View","date":"2020-10-30","arxiv_id":"2010.16010","repositories_listed":1,"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":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) · 1 unverified","sample_list":"/paper/loss-rescaling-vqa-revisiting-language-prior#ran","syntology_url":"https://syntology.ai/paper/2010.16010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.16010"}},"official":{"repos":["guoyang9/class-imbalance-VQA"],"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/delta-stn-efficient-bilevel-optimization-for","slug":"delta-stn-efficient-bilevel-optimization-for","title":"Delta-STN: Efficient Bilevel Optimization for Neural Networks using Structured Response Jacobians","date":"2020-10-26","arxiv_id":"2010.13514","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/delta-stn-efficient-bilevel-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2010.13514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13514"}},"official":{"repos":["pomonam/Self-Tuning-Networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-image-is-worth-16x16-words-transformers-1","slug":"an-image-is-worth-16x16-words-transformers-1","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","date":"2020-10-22","arxiv_id":"2010.11929","repositories_listed":158,"syntology":{"n":419,"n_ran":307,"n_constructed":165,"n_ran_checked":286,"n_instrument":21,"n_unverified":112,"n_honours":8,"n_violates":2,"n_no_contract":276,"n_pointer_only":154,"phrase":"307 ran (of which 165 constructed an object rather than computing a result; 286 with no instrument failure: 8 honoured, 2 violated, 276 with no contract checked; 21 where Syntology's instrument failed) · 112 unverified","sample_list":"/paper/an-image-is-worth-16x16-words-transformers-1#ran","syntology_url":"https://syntology.ai/paper/2010.11929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11929"}},"official":{"repos":["google-research/vision_transformer"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["community","listed","unlocated"]}}},{"url":"/paper/active-domain-adaptation-via-clustering","slug":"active-domain-adaptation-via-clustering","title":"Active Domain Adaptation via Clustering Uncertainty-weighted Embeddings","date":"2020-10-16","arxiv_id":"2010.08666","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/active-domain-adaptation-via-clustering#ran","syntology_url":"https://syntology.ai/paper/2010.08666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08666"}},"official":{"repos":["virajprabhu/clue"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/adabelief-optimizer-adapting-stepsizes-by-the","slug":"adabelief-optimizer-adapting-stepsizes-by-the","title":"AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradients","date":"2020-10-15","arxiv_id":"2010.07468","repositories_listed":8,"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/adabelief-optimizer-adapting-stepsizes-by-the#ran","syntology_url":"https://syntology.ai/paper/2010.07468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07468"}},"official":{"repos":["juntang-zhuang/Adabelief-Optimizer"],"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/open-sourced-dataset-protection-via-backdoor","slug":"open-sourced-dataset-protection-via-backdoor","title":"Open-sourced Dataset Protection via Backdoor Watermarking","date":"2020-10-12","arxiv_id":"2010.05821","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/open-sourced-dataset-protection-via-backdoor#ran","syntology_url":"https://syntology.ai/paper/2010.05821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05821"}},"official":{"repos":["THUYimingLi/Open-sourced_Dataset_Protection"],"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/shape-texture-debiased-neural-network-1","slug":"shape-texture-debiased-neural-network-1","title":"Shape-Texture Debiased Neural Network Training","date":"2020-10-12","arxiv_id":"2010.05981","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/shape-texture-debiased-neural-network-1#ran","syntology_url":"https://syntology.ai/paper/2010.05981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05981"}},"official":{"repos":["LiYingwei/ShapeTextureDebiasedTraining"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/glance-and-focus-a-dynamic-approach-to","slug":"glance-and-focus-a-dynamic-approach-to","title":"Glance and Focus: a Dynamic Approach to Reducing Spatial Redundancy in Image Classification","date":"2020-10-11","arxiv_id":"2010.05300","repositories_listed":1,"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":0,"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/glance-and-focus-a-dynamic-approach-to#ran","syntology_url":"https://syntology.ai/paper/2010.05300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05300"}},"official":{"repos":["blackfeather-wang/GFNet-Pytorch"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/moco-pretraining-improves-representation-and","slug":"moco-pretraining-improves-representation-and","title":"MoCo-CXR: MoCo Pretraining Improves Representation and Transferability of Chest X-ray Models","date":"2020-10-11","arxiv_id":"2010.05352","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/moco-pretraining-improves-representation-and#ran","syntology_url":"https://syntology.ai/paper/2010.05352","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05352"}},"official":{"repos":["stanfordmlgroup/MoCo-CXR"],"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/byzshield-an-efficient-and-robust-system-for","slug":"byzshield-an-efficient-and-robust-system-for","title":"ByzShield: An Efficient and Robust System for Distributed Training","date":"2020-10-10","arxiv_id":"2010.04902","repositories_listed":1,"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/byzshield-an-efficient-and-robust-system-for#ran","syntology_url":"https://syntology.ai/paper/2010.04902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04902"}},"official":{"repos":["kkonstantinidis/ByzShield"],"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/regularizing-neural-networks-via-adversarial","slug":"regularizing-neural-networks-via-adversarial","title":"Regularizing Neural Networks via Adversarial Model Perturbation","date":"2020-10-10","arxiv_id":"2010.04925","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/regularizing-neural-networks-via-adversarial#ran","syntology_url":"https://syntology.ai/paper/2010.04925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04925"}},"official":{"repos":["hiyouga/AMP-Regularizer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/permuted-adain-enhancing-the-representation","slug":"permuted-adain-enhancing-the-representation","title":"Permuted AdaIN: Reducing the Bias Towards Global Statistics in Image Classification","date":"2020-10-09","arxiv_id":"2010.05785","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/permuted-adain-enhancing-the-representation#ran","syntology_url":"https://syntology.ai/paper/2010.05785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05785"}},"official":{"repos":["onuriel/PermutedAdaIN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-panda-no-it-s-a-sloth-slowdown-attacks-on-1","slug":"a-panda-no-it-s-a-sloth-slowdown-attacks-on-1","title":"A Panda? No, It's a Sloth: Slowdown Attacks on Adaptive Multi-Exit Neural Network Inference","date":"2020-10-06","arxiv_id":"2010.02432","repositories_listed":1,"syntology":{"n":17,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"10 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; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/a-panda-no-it-s-a-sloth-slowdown-attacks-on-1#ran","syntology_url":"https://syntology.ai/paper/2010.02432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02432"}},"official":{"repos":["sanghyun-hong/deepsloth"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/long-tailed-recognition-by-routing-diverse-1","slug":"long-tailed-recognition-by-routing-diverse-1","title":"Long-tailed Recognition by Routing Diverse Distribution-Aware Experts","date":"2020-10-05","arxiv_id":"2010.01809","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":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/long-tailed-recognition-by-routing-diverse-1#ran","syntology_url":"https://syntology.ai/paper/2010.01809","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01809"}},"official":{"repos":["frank-xwang/RIDE-LongTailRecognition"],"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/learning-with-instance-dependent-label-noise-1","slug":"learning-with-instance-dependent-label-noise-1","title":"Learning with Instance-Dependent Label Noise: A Sample Sieve Approach","date":"2020-10-05","arxiv_id":"2010.02347","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-with-instance-dependent-label-noise-1#ran","syntology_url":"https://syntology.ai/paper/2010.02347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02347"}},"official":{"repos":["UCSC-REAL/cores"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/sharpness-aware-minimization-for-efficiently-1","slug":"sharpness-aware-minimization-for-efficiently-1","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","date":"2020-10-03","arxiv_id":"2010.01412","repositories_listed":18,"syntology":{"n":20,"n_ran":15,"n_constructed":6,"n_ran_checked":13,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":6,"phrase":"15 ran (of which 6 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/sharpness-aware-minimization-for-efficiently-1#ran","syntology_url":"https://syntology.ai/paper/2010.01412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01412"}},"official":{"repos":["google-research/sam"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/contrastive-learning-of-medical-visual","slug":"contrastive-learning-of-medical-visual","title":"Contrastive Learning of Medical Visual Representations from Paired Images and Text","date":"2020-10-02","arxiv_id":"2010.00747","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/contrastive-learning-of-medical-visual#ran","syntology_url":"https://syntology.ai/paper/2010.00747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00747"}},"official":{"repos":["yuhaozhang/convirt"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/neural-bootstrapper","slug":"neural-bootstrapper","title":"Neural Bootstrapper","date":"2020-10-02","arxiv_id":"2010.01051","repositories_listed":2,"syntology":{"n":15,"n_ran":13,"n_constructed":1,"n_ran_checked":10,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"13 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-bootstrapper#ran","syntology_url":"https://syntology.ai/paper/2010.01051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01051"}},"official":{"repos":["sungbinlim/GBS","sungbinlim/neuboots"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":1,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dverge-diversifying-vulnerabilities-for","slug":"dverge-diversifying-vulnerabilities-for","title":"DVERGE: Diversifying Vulnerabilities for Enhanced Robust Generation of Ensembles","date":"2020-09-30","arxiv_id":"2009.14720","repositories_listed":3,"syntology":{"n":10,"n_ran":7,"n_constructed":1,"n_ran_checked":1,"n_instrument":6,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":10,"phrase":"7 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; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dverge-diversifying-vulnerabilities-for#ran","syntology_url":"https://syntology.ai/paper/2009.14720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14720"}},"official":{"repos":["zjysteven/DVERGE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/attentional-feature-fusion","slug":"attentional-feature-fusion","title":"Attentional Feature Fusion","date":"2020-09-29","arxiv_id":"2009.14082","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/attentional-feature-fusion#ran","syntology_url":"https://syntology.ai/paper/2009.14082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14082"}},"official":{"repos":["YimianDai/open-aff"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/asymmetric-loss-for-multi-label","slug":"asymmetric-loss-for-multi-label","title":"Asymmetric Loss For Multi-Label Classification","date":"2020-09-29","arxiv_id":"2009.14119","repositories_listed":5,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":9,"phrase":"10 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/asymmetric-loss-for-multi-label#ran","syntology_url":"https://syntology.ai/paper/2009.14119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14119"}},"official":{"repos":["Alibaba-MIIL/ASL"],"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/long-tailed-classification-by-keeping-the-1","slug":"long-tailed-classification-by-keeping-the-1","title":"Long-Tailed Classification by Keeping the Good and Removing the Bad Momentum Causal Effect","date":"2020-09-28","arxiv_id":"2009.12991","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/long-tailed-classification-by-keeping-the-1#ran","syntology_url":"https://syntology.ai/paper/2009.12991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.12991"}},"official":{"repos":["KaihuaTang/Long-Tailed-Recognition.pytorch"],"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/adaptive-meta-learning-for-identification-of","slug":"adaptive-meta-learning-for-identification-of","title":"Adaptive Meta-Learning for Identification of Rover-Terrain Dynamics","date":"2020-09-21","arxiv_id":"2009.10191","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/adaptive-meta-learning-for-identification-of#ran","syntology_url":"https://syntology.ai/paper/2009.10191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.10191"}},"official":{"repos":["StanfordASL/rover-meta-learning"],"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/noisy-concurrent-training-for-efficient","slug":"noisy-concurrent-training-for-efficient","title":"Noisy Concurrent Training for Efficient Learning under Label Noise","date":"2020-09-17","arxiv_id":"2009.08325","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/noisy-concurrent-training-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2009.08325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08325"}},"official":{"repos":["NeurAI-Lab/NCT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/constrained-labeling-for-weakly-supervised","slug":"constrained-labeling-for-weakly-supervised","title":"Constrained Labeling for Weakly Supervised Learning","date":"2020-09-15","arxiv_id":"2009.07360","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/constrained-labeling-for-weakly-supervised#ran","syntology_url":"https://syntology.ai/paper/2009.07360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.07360"}},"official":{"repos":["VTCSML/Constrained-Labeling-for-Weakly-Supervised-Learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-the-role-of-individual-units-in","slug":"understanding-the-role-of-individual-units-in","title":"Understanding the Role of Individual Units in a Deep Neural Network","date":"2020-09-10","arxiv_id":"2009.05041","repositories_listed":2,"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/understanding-the-role-of-individual-units-in#ran","syntology_url":"https://syntology.ai/paper/2009.05041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05041"}},"official":{"repos":["davidbau/dissect"],"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/stochastic-yolo-efficient-probabilistic","slug":"stochastic-yolo-efficient-probabilistic","title":"Stochastic-YOLO: Efficient Probabilistic Object Detection under Dataset Shifts","date":"2020-09-07","arxiv_id":"2009.02967","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/stochastic-yolo-efficient-probabilistic#ran","syntology_url":"https://syntology.ai/paper/2009.02967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.02967"}},"official":{"repos":["tjiagom/stochastic-yolo"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/s3nas-fast-npu-aware-neural-architecture","slug":"s3nas-fast-npu-aware-neural-architecture","title":"S3NAS: Fast NPU-aware Neural Architecture Search Methodology","date":"2020-09-04","arxiv_id":"2009.02009","repositories_listed":1,"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/s3nas-fast-npu-aware-neural-architecture#ran","syntology_url":"https://syntology.ai/paper/2009.02009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.02009"}},"official":{"repos":["cap-lab/S3NAS"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-framework-for-contrastive-self-supervised","slug":"a-framework-for-contrastive-self-supervised","title":"A Framework For Contrastive Self-Supervised Learning And Designing A New Approach","date":"2020-08-31","arxiv_id":"2009.00104","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-framework-for-contrastive-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2009.00104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.00104"}},"official":null}},{"url":"/paper/webly-supervised-image-classification-with","slug":"webly-supervised-image-classification-with","title":"Webly Supervised Image Classification with Self-Contained Confidence","date":"2020-08-27","arxiv_id":"2008.11894","repositories_listed":4,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/webly-supervised-image-classification-with#ran","syntology_url":"https://syntology.ai/paper/2008.11894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.11894"}},"official":{"repos":["bigvideoresearch/SCC","bigvideoresearch/Enigma"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-learning-for-large-scale","slug":"self-supervised-learning-for-large-scale","title":"Self-Supervised Learning for Large-Scale Unsupervised Image Clustering","date":"2020-08-24","arxiv_id":"2008.10312","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/self-supervised-learning-for-large-scale#ran","syntology_url":"https://syntology.ai/paper/2008.10312","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.10312"}},"official":{"repos":["Randl/kmeans_selfsuper"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-modeling-of-chest-radiographs-and","slug":"joint-modeling-of-chest-radiographs-and","title":"Joint Modeling of Chest Radiographs and Radiology Reports for Pulmonary Edema Assessment","date":"2020-08-22","arxiv_id":"2008.09884","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/joint-modeling-of-chest-radiographs-and#ran","syntology_url":"https://syntology.ai/paper/2008.09884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.09884"}},"official":{"repos":["RayRuizhiLiao/joint_chestxray"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/non-convex-learning-via-replica-exchange","slug":"non-convex-learning-via-replica-exchange","title":"Non-convex Learning via Replica Exchange Stochastic Gradient MCMC","date":"2020-08-12","arxiv_id":"2008.05367","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/non-convex-learning-via-replica-exchange#ran","syntology_url":"https://syntology.ai/paper/2008.05367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05367"}},"official":{"repos":["gaoliyao/Replica_Exchange_Stochastic_Gradient_MCMC"],"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/graph-convolutional-networks-for-1","slug":"graph-convolutional-networks-for-1","title":"Graph Convolutional Networks for Hyperspectral Image Classification","date":"2020-08-06","arxiv_id":"2008.02457","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-convolutional-networks-for-1#ran","syntology_url":"https://syntology.ai/paper/2008.02457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.02457"}},"official":{"repos":["danfenghong/IEEE_TGRS_GCN"],"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/assisted-perception-optimizing-observations","slug":"assisted-perception-optimizing-observations","title":"Assisted Perception: Optimizing Observations to Communicate State","date":"2020-08-06","arxiv_id":"2008.02840","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":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) · 3 unverified","sample_list":"/paper/assisted-perception-optimizing-observations#ran","syntology_url":"https://syntology.ai/paper/2008.02840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.02840"}},"official":null}},{"url":"/paper/dynamic-federated-learning-model-for","slug":"dynamic-federated-learning-model-for","title":"Dynamic Defense Against Byzantine Poisoning Attacks in Federated Learning","date":"2020-07-29","arxiv_id":"2007.15030","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dynamic-federated-learning-model-for#ran","syntology_url":"https://syntology.ai/paper/2007.15030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15030"}},"official":{"repos":["ari-dasci/s-ddaba"],"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/detecting-anomalous-inputs-to-dnn-classifiers","slug":"detecting-anomalous-inputs-to-dnn-classifiers","title":"A General Framework For Detecting Anomalous Inputs to DNN Classifiers","date":"2020-07-29","arxiv_id":"2007.15147","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/detecting-anomalous-inputs-to-dnn-classifiers#ran","syntology_url":"https://syntology.ai/paper/2007.15147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15147"}},"official":{"repos":["jayaram-r/adversarial-detection"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/economical-ensembles-with-hypernetworks","slug":"economical-ensembles-with-hypernetworks","title":"Neural networks with late-phase weights","date":"2020-07-25","arxiv_id":"2007.12927","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/economical-ensembles-with-hypernetworks#ran","syntology_url":"https://syntology.ai/paper/2007.12927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12927"}},"official":{"repos":["google/uncertainty-baselines","seijin-kobayashi/late-phase-weights"],"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/nsganetv2-evolutionary-multi-objective","slug":"nsganetv2-evolutionary-multi-objective","title":"NSGANetV2: Evolutionary Multi-Objective Surrogate-Assisted Neural Architecture Search","date":"2020-07-20","arxiv_id":"2007.10396","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":2,"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, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/nsganetv2-evolutionary-multi-objective#ran","syntology_url":"https://syntology.ai/paper/2007.10396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.10396"}},"official":{"repos":["mikelzc1990/nsganetv2"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/pdo-econvs-partial-differential-operator","slug":"pdo-econvs-partial-differential-operator","title":"PDO-eConvs: Partial Differential Operator Based Equivariant Convolutions","date":"2020-07-20","arxiv_id":"2007.10408","repositories_listed":3,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/pdo-econvs-partial-differential-operator#ran","syntology_url":"https://syntology.ai/paper/2007.10408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.10408"}},"official":{"repos":["shenzy08/PDO-eConvs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/onlineaugment-online-data-augmentation-with","slug":"onlineaugment-online-data-augmentation-with","title":"OnlineAugment: Online Data Augmentation with Less Domain Knowledge","date":"2020-07-17","arxiv_id":"2007.09271","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/onlineaugment-online-data-augmentation-with#ran","syntology_url":"https://syntology.ai/paper/2007.09271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09271"}},"official":{"repos":["zhiqiangdon/online-augment"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/concept-learners-for-generalizable-few-shot","slug":"concept-learners-for-generalizable-few-shot","title":"Concept Learners for Few-Shot Learning","date":"2020-07-14","arxiv_id":"2007.07375","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/concept-learners-for-generalizable-few-shot#ran","syntology_url":"https://syntology.ai/paper/2007.07375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.07375"}},"official":{"repos":["snap-stanford/comet"],"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/adversarially-trained-deep-nets-transfer","slug":"adversarially-trained-deep-nets-transfer","title":"Adversarially-Trained Deep Nets Transfer Better: Illustration on Image Classification","date":"2020-07-11","arxiv_id":"2007.05869","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/adversarially-trained-deep-nets-transfer#ran","syntology_url":"https://syntology.ai/paper/2007.05869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05869"}},"official":{"repos":["utrerf/robust_transfer_learning"],"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/attack-of-the-tails-yes-you-really-can","slug":"attack-of-the-tails-yes-you-really-can","title":"Attack of the Tails: Yes, You Really Can Backdoor Federated Learning","date":"2020-07-09","arxiv_id":"2007.05084","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/attack-of-the-tails-yes-you-really-can#ran","syntology_url":"https://syntology.ai/paper/2007.05084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05084"}},"official":{"repos":["ksreenivasan/OOD_Federated_Learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-group-convolution-for-accelerating","slug":"dynamic-group-convolution-for-accelerating","title":"Dynamic Group Convolution for Accelerating Convolutional Neural Networks","date":"2020-07-08","arxiv_id":"2007.04242","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dynamic-group-convolution-for-accelerating#ran","syntology_url":"https://syntology.ai/paper/2007.04242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04242"}},"official":{"repos":["zhuogege1943/dgc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/discretization-aware-architecture-search","slug":"discretization-aware-architecture-search","title":"Discretization-Aware Architecture Search","date":"2020-07-07","arxiv_id":"2007.03154","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/discretization-aware-architecture-search#ran","syntology_url":"https://syntology.ai/paper/2007.03154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.03154"}},"official":{"repos":["sunsmarterjie/DAAS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/gold-nas-gradual-one-level-differentiable","slug":"gold-nas-gradual-one-level-differentiable","title":"GOLD-NAS: Gradual, One-Level, Differentiable","date":"2020-07-07","arxiv_id":"2007.03331","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":2,"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/gold-nas-gradual-one-level-differentiable#ran","syntology_url":"https://syntology.ai/paper/2007.03331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.03331"}},"official":null}},{"url":"/paper/self-challenging-improves-cross-domain","slug":"self-challenging-improves-cross-domain","title":"Self-Challenging Improves Cross-Domain Generalization","date":"2020-07-05","arxiv_id":"2007.02454","repositories_listed":8,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-challenging-improves-cross-domain#ran","syntology_url":"https://syntology.ai/paper/2007.02454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02454"}},"official":null}},{"url":"/paper/rexnet-diminishing-representational","slug":"rexnet-diminishing-representational","title":"Rethinking Channel Dimensions for Efficient Model Design","date":"2020-07-02","arxiv_id":"2007.00992","repositories_listed":10,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rexnet-diminishing-representational#ran","syntology_url":"https://syntology.ai/paper/2007.00992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00992"}},"official":{"repos":["clovaai/rexnet"],"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/are-there-any-object-detectors-in-the-hidden-1","slug":"are-there-any-object-detectors-in-the-hidden-1","title":"Are there any 'object detectors' in the hidden layers of CNNs trained to identify objects or scenes?","date":"2020-07-02","arxiv_id":"2007.01062","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/are-there-any-object-detectors-in-the-hidden-1#ran","syntology_url":"https://syntology.ai/paper/2007.01062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01062"}},"official":{"repos":["ellagale/testing_object_detectors_in_deepCNNs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/theory-inspired-path-regularized-differential","slug":"theory-inspired-path-regularized-differential","title":"Theory-Inspired Path-Regularized Differential Network Architecture Search","date":"2020-06-30","arxiv_id":"2006.16537","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 3 unverified","sample_list":"/paper/theory-inspired-path-regularized-differential#ran","syntology_url":"https://syntology.ai/paper/2006.16537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16537"}},"official":null}},{"url":"/paper/improving-robustness-against-common","slug":"improving-robustness-against-common","title":"Improving robustness against common corruptions by covariate shift adaptation","date":"2020-06-30","arxiv_id":"2006.16971","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-robustness-against-common#ran","syntology_url":"https://syntology.ai/paper/2006.16971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16971"}},"official":{"repos":["bethgelab/robustness"],"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/learning-to-combine-top-down-and-bottom-up","slug":"learning-to-combine-top-down-and-bottom-up","title":"Learning to Combine Top-Down and Bottom-Up Signals in Recurrent Neural Networks with Attention over Modules","date":"2020-06-30","arxiv_id":"2006.16981","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/learning-to-combine-top-down-and-bottom-up#ran","syntology_url":"https://syntology.ai/paper/2006.16981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16981"}},"official":{"repos":["sarthmit/BRIMs"],"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/early-learning-regularization-prevents","slug":"early-learning-regularization-prevents","title":"Early-Learning Regularization Prevents Memorization of Noisy Labels","date":"2020-06-30","arxiv_id":"2007.00151","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":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) · 0 unverified","sample_list":"/paper/early-learning-regularization-prevents#ran","syntology_url":"https://syntology.ai/paper/2007.00151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00151"}},"official":{"repos":["shengliu66/ELR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-data-augmentation-with-online","slug":"learning-data-augmentation-with-online","title":"Learning Data Augmentation with Online Bilevel Optimization for Image Classification","date":"2020-06-25","arxiv_id":"2006.14699","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-data-augmentation-with-online#ran","syntology_url":"https://syntology.ai/paper/2006.14699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14699"}},"official":{"repos":["ElementAI/bilevel_augment"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/when-do-neural-networks-outperform-kernel","slug":"when-do-neural-networks-outperform-kernel","title":"When Do Neural Networks Outperform Kernel Methods?","date":"2020-06-24","arxiv_id":"2006.13409","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/when-do-neural-networks-outperform-kernel#ran","syntology_url":"https://syntology.ai/paper/2006.13409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13409"}},"official":{"repos":["bGhorbani/linearized_neural_networks"],"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":["official"]}}},{"url":"/paper/normalized-loss-functions-for-deep-learning","slug":"normalized-loss-functions-for-deep-learning","title":"Normalized Loss Functions for Deep Learning with Noisy Labels","date":"2020-06-24","arxiv_id":"2006.13554","repositories_listed":4,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/normalized-loss-functions-for-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2006.13554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13554"}},"official":{"repos":["HanxunH/Active-Passive-Losses"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/hyperparameter-ensembles-for-robustness-and","slug":"hyperparameter-ensembles-for-robustness-and","title":"Hyperparameter Ensembles for Robustness and Uncertainty Quantification","date":"2020-06-24","arxiv_id":"2006.13570","repositories_listed":3,"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/hyperparameter-ensembles-for-robustness-and#ran","syntology_url":"https://syntology.ai/paper/2006.13570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13570"}},"official":{"repos":["google/uncertainty-baselines"],"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/blacklight-defending-black-box-adversarial","slug":"blacklight-defending-black-box-adversarial","title":"Blacklight: Scalable Defense for Neural Networks against Query-Based Black-Box Attacks","date":"2020-06-24","arxiv_id":"2006.14042","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/blacklight-defending-black-box-adversarial#ran","syntology_url":"https://syntology.ai/paper/2006.14042","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14042"}},"official":{"repos":["huiying-li/blacklight"],"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/calibration-of-neural-networks-using-splines","slug":"calibration-of-neural-networks-using-splines","title":"Calibration of Neural Networks using Splines","date":"2020-06-23","arxiv_id":"2006.12800","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/calibration-of-neural-networks-using-splines#ran","syntology_url":"https://syntology.ai/paper/2006.12800","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12800"}},"official":{"repos":["kartikgupta-at-anu/spline-calibration"],"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/self-knowledge-distillation-a-simple-way-for","slug":"self-knowledge-distillation-a-simple-way-for","title":"Self-Knowledge Distillation with Progressive Refinement of Targets","date":"2020-06-22","arxiv_id":"2006.12000","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-knowledge-distillation-a-simple-way-for#ran","syntology_url":"https://syntology.ai/paper/2006.12000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12000"}},"official":{"repos":["lgcnsai/ps-kd-pytorch"],"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":["official"]}}},{"url":"/paper/do-conv-depthwise-over-parameterized","slug":"do-conv-depthwise-over-parameterized","title":"DO-Conv: Depthwise Over-parameterized Convolutional Layer","date":"2020-06-22","arxiv_id":"2006.12030","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/do-conv-depthwise-over-parameterized#ran","syntology_url":"https://syntology.ai/paper/2006.12030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12030"}},"official":{"repos":["yangyanli/DO-Conv"],"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/the-color-out-of-space-learning-self","slug":"the-color-out-of-space-learning-self","title":"The color out of space: learning self-supervised representations for Earth Observation imagery","date":"2020-06-22","arxiv_id":"2006.12119","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-color-out-of-space-learning-self#ran","syntology_url":"https://syntology.ai/paper/2006.12119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12119"}},"official":{"repos":["stevinc/TheColorOutOfSpace"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/paying-more-attention-to-snapshots-of","slug":"paying-more-attention-to-snapshots-of","title":"Paying more attention to snapshots of Iterative Pruning: Improving Model Compression via Ensemble Distillation","date":"2020-06-20","arxiv_id":"2006.11487","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 4 unverified","sample_list":"/paper/paying-more-attention-to-snapshots-of#ran","syntology_url":"https://syntology.ai/paper/2006.11487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11487"}},"official":{"repos":["lehduong/kesi"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/shapeshifter-networks-cross-layer-parameter","slug":"shapeshifter-networks-cross-layer-parameter","title":"Neural Parameter Allocation Search","date":"2020-06-18","arxiv_id":"2006.10598","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/shapeshifter-networks-cross-layer-parameter#ran","syntology_url":"https://syntology.ai/paper/2006.10598","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10598"}},"official":{"repos":["bryanplummer/ssn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fully-test-time-adaptation-by-entropy","slug":"fully-test-time-adaptation-by-entropy","title":"Tent: Fully Test-time Adaptation by Entropy Minimization","date":"2020-06-18","arxiv_id":"2006.10726","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":2,"n_ran_checked":2,"n_instrument":6,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fully-test-time-adaptation-by-entropy#ran","syntology_url":"https://syntology.ai/paper/2006.10726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10726"}},"official":{"repos":["DequanWang/tent"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/unsupervised-learning-of-visual-features-by","slug":"unsupervised-learning-of-visual-features-by","title":"Unsupervised Learning of Visual Features by Contrasting Cluster Assignments","date":"2020-06-17","arxiv_id":"2006.09882","repositories_listed":18,"syntology":{"n":17,"n_ran":13,"n_constructed":4,"n_ran_checked":6,"n_instrument":7,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":6,"phrase":"13 ran (of which 4 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/unsupervised-learning-of-visual-features-by#ran","syntology_url":"https://syntology.ai/paper/2006.09882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09882"}},"official":{"repos":["facebookresearch/swav"],"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/improving-few-shot-visual-classification-with","slug":"improving-few-shot-visual-classification-with","title":"Enhancing Few-Shot Image Classification with Unlabelled Examples","date":"2020-06-17","arxiv_id":"2006.12245","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/improving-few-shot-visual-classification-with#ran","syntology_url":"https://syntology.ai/paper/2006.12245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12245"}},"official":{"repos":["plai-group/simple-cnaps"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/slowing-down-the-weight-norm-increase-in","slug":"slowing-down-the-weight-norm-increase-in","title":"AdamP: Slowing Down the Slowdown for Momentum Optimizers on Scale-invariant Weights","date":"2020-06-15","arxiv_id":"2006.08217","repositories_listed":4,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/slowing-down-the-weight-norm-increase-in#ran","syntology_url":"https://syntology.ai/paper/2006.08217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08217"}},"official":{"repos":["clovaai/AdamP"],"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/depth-uncertainty-in-neural-networks","slug":"depth-uncertainty-in-neural-networks","title":"Depth Uncertainty in Neural Networks","date":"2020-06-15","arxiv_id":"2006.08437","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/depth-uncertainty-in-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.08437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08437"}},"official":{"repos":["cambridge-mlg/DUN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-ensemble-search-for-performant-and","slug":"neural-ensemble-search-for-performant-and","title":"Neural Ensemble Search for Uncertainty Estimation and Dataset Shift","date":"2020-06-15","arxiv_id":"2006.08573","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-ensemble-search-for-performant-and#ran","syntology_url":"https://syntology.ai/paper/2006.08573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08573"}},"official":{"repos":["automl/nes"],"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/on-the-training-dynamics-of-deep-networks","slug":"on-the-training-dynamics-of-deep-networks","title":"On the training dynamics of deep networks with $L_2$ regularization","date":"2020-06-15","arxiv_id":"2006.08643","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/on-the-training-dynamics-of-deep-networks#ran","syntology_url":"https://syntology.ai/paper/2006.08643","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08643"}},"official":null}},{"url":"/paper/multiscale-deep-equilibrium-models","slug":"multiscale-deep-equilibrium-models","title":"Multiscale Deep Equilibrium Models","date":"2020-06-15","arxiv_id":"2006.08656","repositories_listed":4,"syntology":{"n":14,"n_ran":10,"n_constructed":6,"n_ran_checked":7,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"10 ran (of which 6 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/multiscale-deep-equilibrium-models#ran","syntology_url":"https://syntology.ai/paper/2006.08656","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08656"}},"official":{"repos":["locuslab/mdeq"],"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":["listed","official"]}}},{"url":"/paper/bootstrap-your-own-latent-a-new-approach-to","slug":"bootstrap-your-own-latent-a-new-approach-to","title":"Bootstrap your own latent: A new approach to self-supervised Learning","date":"2020-06-13","arxiv_id":"2006.07733","repositories_listed":31,"syntology":{"n":79,"n_ran":62,"n_constructed":19,"n_ran_checked":42,"n_instrument":20,"n_unverified":17,"n_honours":4,"n_violates":1,"n_no_contract":37,"n_pointer_only":46,"phrase":"62 ran (of which 19 constructed an object rather than computing a result; 42 with no instrument failure: 4 honoured, 1 violated, 37 with no contract checked; 20 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/bootstrap-your-own-latent-a-new-approach-to#ran","syntology_url":"https://syntology.ai/paper/2006.07733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07733"}},"official":{"repos":["deepmind/deepmind-research"],"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/kernelized-information-bottleneck-leads-to","slug":"kernelized-information-bottleneck-leads-to","title":"Kernelized information bottleneck leads to biologically plausible 3-factor Hebbian learning in deep networks","date":"2020-06-12","arxiv_id":"2006.07123","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":2,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kernelized-information-bottleneck-leads-to#ran","syntology_url":"https://syntology.ai/paper/2006.07123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07123"}},"official":{"repos":["romanpogodin/plausible-kernelized-bottleneck"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-second-order-behaviour-in-augmented-neural","slug":"on-second-order-behaviour-in-augmented-neural","title":"On Second Order Behaviour in Augmented Neural ODEs","date":"2020-06-12","arxiv_id":"2006.07220","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-second-order-behaviour-in-augmented-neural#ran","syntology_url":"https://syntology.ai/paper/2006.07220","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07220"}},"official":null}},{"url":"/paper/attentive-waveblock-complementarity-enhanced","slug":"attentive-waveblock-complementarity-enhanced","title":"Attentive WaveBlock: Complementarity-enhanced Mutual Networks for Unsupervised Domain Adaptation in Person Re-identification and Beyond","date":"2020-06-11","arxiv_id":"2006.06525","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/attentive-waveblock-complementarity-enhanced#ran","syntology_url":"https://syntology.ai/paper/2006.06525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06525"}},"official":{"repos":["WangWenhao0716/Attentive-WaveBlock"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/virtex-learning-visual-representations-from","slug":"virtex-learning-visual-representations-from","title":"VirTex: Learning Visual Representations from Textual Annotations","date":"2020-06-11","arxiv_id":"2006.06666","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/virtex-learning-visual-representations-from#ran","syntology_url":"https://syntology.ai/paper/2006.06666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06666"}},"official":{"repos":["kdexd/virtex"],"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/interpolation-between-residual-and-non","slug":"interpolation-between-residual-and-non","title":"Interpolation between Residual and Non-Residual Networks","date":"2020-06-10","arxiv_id":"2006.05749","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/interpolation-between-residual-and-non#ran","syntology_url":"https://syntology.ai/paper/2006.05749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05749"}},"official":null}},{"url":"/paper/visual-transformers-token-based-image","slug":"visual-transformers-token-based-image","title":"Visual Transformers: Token-based Image Representation and Processing for Computer Vision","date":"2020-06-05","arxiv_id":"2006.03677","repositories_listed":8,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/visual-transformers-token-based-image#ran","syntology_url":"https://syntology.ai/paper/2006.03677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03677"}},"official":null}},{"url":"/paper/deep-convolutional-tensor-network","slug":"deep-convolutional-tensor-network","title":"Deep convolutional tensor network","date":"2020-05-29","arxiv_id":"2005.14506","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":8,"n_ran_checked":8,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":14,"phrase":"10 ran (of which 8 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deep-convolutional-tensor-network#ran","syntology_url":"https://syntology.ai/paper/2005.14506","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14506"}},"official":{"repos":["philip-bl/dctn"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":8,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-from-context-agnostic-synthetic-data","slug":"learning-from-context-agnostic-synthetic-data","title":"Towards Context-Agnostic Learning Using Synthetic Data","date":"2020-05-29","arxiv_id":"2005.14707","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 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) · 0 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-from-context-agnostic-synthetic-data#ran","syntology_url":"https://syntology.ai/paper/2005.14707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14707"}},"official":{"repos":["charlesjin/synthetic_data"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"84d544d97e2a3a2e6aad1956b1baedb752a62dea1a7fed635101271c44866130","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}