{"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/data-augmentation/papers/ran/6","list_of":"/task/data-augmentation","task":"Data Augmentation","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":6,"pages_in_order":7,"rows_per_page":100,"rows":[501,600],"of":692,"counts":{"archive_papers_tagged":8378,"with_a_code_link":3225,"where_syntology_ran_a_sample":692,"not_listed_spam_title":0,"listed":8378,"listed_where_code_ran":692,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":567,"every_run_a_failure_of_syntologys_instrument":125,"listed_with_a_run_with_no_instrument_failure":567,"listed_every_run_a_failure_of_syntologys_instrument":125,"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/data-augmentation/papers/ran/1","prev":"/task/data-augmentation/papers/ran/5","next":"/task/data-augmentation/papers/ran/7","papers":[{"url":"/paper/misclassification-aware-gaussian-smoothing","slug":"misclassification-aware-gaussian-smoothing","title":"Diverse Gaussian Noise Consistency Regularization for Robustness and Uncertainty Calibration","date":"2021-04-02","arxiv_id":"2104.01231","repositories_listed":1,"syntology":{"n":52,"n_ran":45,"n_constructed":8,"n_ran_checked":20,"n_instrument":25,"n_unverified":7,"n_honours":3,"n_violates":1,"n_no_contract":16,"n_pointer_only":1,"phrase":"45 ran (of which 8 constructed an object rather than computing a result; 20 with no instrument failure: 3 honoured, 1 violated, 16 with no contract checked; 25 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/misclassification-aware-gaussian-smoothing#ran","syntology_url":"https://syntology.ai/paper/2104.01231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01231"}},"official":{"repos":["theot1/dign"],"state":"official (archive's flag): 45 ran","n_ran":45,"n_constructed":8,"n_ran_no_instrument_failure":20,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/efficientnetv2-smaller-models-and-faster","slug":"efficientnetv2-smaller-models-and-faster","title":"EfficientNetV2: Smaller Models and Faster Training","date":"2021-04-01","arxiv_id":"2104.00298","repositories_listed":26,"syntology":{"n":79,"n_ran":55,"n_constructed":14,"n_ran_checked":46,"n_instrument":9,"n_unverified":24,"n_honours":11,"n_violates":0,"n_no_contract":35,"n_pointer_only":13,"phrase":"55 ran (of which 14 constructed an object rather than computing a result; 46 with no instrument failure: 11 honoured, 0 violated, 35 with no contract checked; 9 where Syntology's instrument failed) · 24 unverified","sample_list":"/paper/efficientnetv2-smaller-models-and-faster#ran","syntology_url":"https://syntology.ai/paper/2104.00298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.00298"}},"official":{"repos":["google/automl"],"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":["community","listed","official"]}}},{"url":"/paper/remix-towards-image-to-image-translation-with","slug":"remix-towards-image-to-image-translation-with","title":"ReMix: Towards Image-to-Image Translation with Limited Data","date":"2021-03-31","arxiv_id":"2103.16835","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/remix-towards-image-to-image-translation-with#ran","syntology_url":"https://syntology.ai/paper/2103.16835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16835"}},"official":null}},{"url":"/paper/alignmix-improving-representation-by","slug":"alignmix-improving-representation-by","title":"AlignMixup: Improving Representations By Interpolating Aligned Features","date":"2021-03-29","arxiv_id":"2103.15375","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/alignmix-improving-representation-by#ran","syntology_url":"https://syntology.ai/paper/2103.15375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.15375"}},"official":{"repos":["shashankvkt/alignmixup_cvpr22"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/automix-unveiling-the-power-of-mixup","slug":"automix-unveiling-the-power-of-mixup","title":"AutoMix: Unveiling the Power of Mixup for Stronger Classifiers","date":"2021-03-24","arxiv_id":"2103.13027","repositories_listed":3,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/automix-unveiling-the-power-of-mixup#ran","syntology_url":"https://syntology.ai/paper/2103.13027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13027"}},"official":{"repos":["Westlake-AI/openmixup"],"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/metasaug-meta-semantic-augmentation-for-long","slug":"metasaug-meta-semantic-augmentation-for-long","title":"MetaSAug: Meta Semantic Augmentation for Long-Tailed Visual Recognition","date":"2021-03-23","arxiv_id":"2103.12579","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/metasaug-meta-semantic-augmentation-for-long#ran","syntology_url":"https://syntology.ai/paper/2103.12579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12579"}},"official":{"repos":["BIT-DA/MetaSAug"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-pretraining-improves-self","slug":"self-supervised-pretraining-improves-self","title":"Self-Supervised Pretraining Improves Self-Supervised Pretraining","date":"2021-03-23","arxiv_id":"2103.12718","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/self-supervised-pretraining-improves-self#ran","syntology_url":"https://syntology.ai/paper/2103.12718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12718"}},"official":{"repos":["cjrd/self-supervised-pretraining"],"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/adversarial-feature-augmentation-and","slug":"adversarial-feature-augmentation-and","title":"Adversarial Feature Augmentation and Normalization for Visual Recognition","date":"2021-03-22","arxiv_id":"2103.12171","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/adversarial-feature-augmentation-and#ran","syntology_url":"https://syntology.ai/paper/2103.12171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12171"}},"official":{"repos":["VITA-Group/CV_A-FAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/training-gans-with-stronger-augmentations-via-1","slug":"training-gans-with-stronger-augmentations-via-1","title":"Training GANs with Stronger Augmentations via Contrastive Discriminator","date":"2021-03-17","arxiv_id":"2103.09742","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/training-gans-with-stronger-augmentations-via-1#ran","syntology_url":"https://syntology.ai/paper/2103.09742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.09742"}},"official":{"repos":["jh-jeong/ContraD"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/refine-myself-by-teaching-myself-feature","slug":"refine-myself-by-teaching-myself-feature","title":"Refine Myself by Teaching Myself: Feature Refinement via Self-Knowledge Distillation","date":"2021-03-15","arxiv_id":"2103.08273","repositories_listed":1,"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":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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/refine-myself-by-teaching-myself-feature#ran","syntology_url":"https://syntology.ai/paper/2103.08273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.08273"}},"official":{"repos":["MingiJi/FRSKD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-text-classification-with-triplet","slug":"few-shot-text-classification-with-triplet","title":"Few-Shot Text Classification with Triplet Networks, Data Augmentation, and Curriculum Learning","date":"2021-03-12","arxiv_id":"2103.07552","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/few-shot-text-classification-with-triplet#ran","syntology_url":"https://syntology.ai/paper/2103.07552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07552"}},"official":{"repos":["jasonwei20/triplet-loss"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/covidgan-data-augmentation-using-auxiliary","slug":"covidgan-data-augmentation-using-auxiliary","title":"CovidGAN: Data Augmentation Using Auxiliary Classifier GAN for Improved Covid-19 Detection","date":"2021-03-08","arxiv_id":"2103.05094","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":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/covidgan-data-augmentation-using-auxiliary#ran","syntology_url":"https://syntology.ai/paper/2103.05094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.05094"}},"official":null}},{"url":"/paper/contemplating-real-world-object","slug":"contemplating-real-world-object","title":"Contemplating real-world object classification","date":"2021-03-08","arxiv_id":"2103.05137","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/contemplating-real-world-object#ran","syntology_url":"https://syntology.ai/paper/2103.05137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.05137"}},"official":{"repos":["aliborji/ObjectNetReanalysis"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-attentional-deepfake-detection","slug":"multi-attentional-deepfake-detection","title":"Multi-attentional Deepfake Detection","date":"2021-03-03","arxiv_id":"2103.02406","repositories_listed":1,"syntology":{"n":25,"n_ran":20,"n_constructed":10,"n_ran_checked":17,"n_instrument":3,"n_unverified":5,"n_honours":3,"n_violates":0,"n_no_contract":14,"n_pointer_only":25,"phrase":"20 ran (of which 10 constructed an object rather than computing a result; 17 with no instrument failure: 3 honoured, 0 violated, 14 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/multi-attentional-deepfake-detection#ran","syntology_url":"https://syntology.ai/paper/2103.02406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02406"}},"official":{"repos":["yoctta/multiple-attention"],"state":"official (archive's flag): 20 ran","n_ran":20,"n_constructed":10,"n_ran_no_instrument_failure":17,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-probabilistic-models-for-3d-point","slug":"diffusion-probabilistic-models-for-3d-point","title":"Diffusion Probabilistic Models for 3D Point Cloud Generation","date":"2021-03-02","arxiv_id":"2103.01458","repositories_listed":3,"syntology":{"n":29,"n_ran":22,"n_constructed":11,"n_ran_checked":12,"n_instrument":10,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"22 ran (of which 11 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 10 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/diffusion-probabilistic-models-for-3d-point#ran","syntology_url":"https://syntology.ai/paper/2103.01458","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.01458"}},"official":{"repos":["luost26/diffusion-point-cloud"],"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/data-augmentation-for-abstractive-query","slug":"data-augmentation-for-abstractive-query","title":"Data Augmentation for Abstractive Query-Focused Multi-Document Summarization","date":"2021-03-02","arxiv_id":"2103.01863","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"4 ran (of which 4 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; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/data-augmentation-for-abstractive-query#ran","syntology_url":"https://syntology.ai/paper/2103.01863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.01863"}},"official":{"repos":["ramakanth-pasunuru/QmdsCnnIr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/image-compositing-for-segmentation-of","slug":"image-compositing-for-segmentation-of","title":"Image Compositing for Segmentation of Surgical Tools without Manual Annotations","date":"2021-02-18","arxiv_id":"2102.09528","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/image-compositing-for-segmentation-of#ran","syntology_url":"https://syntology.ai/paper/2102.09528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.09528"}},"official":null}},{"url":"/paper/transgan-two-transformers-can-make-one-strong","slug":"transgan-two-transformers-can-make-one-strong","title":"TransGAN: Two Pure Transformers Can Make One Strong GAN, and That Can Scale Up","date":"2021-02-14","arxiv_id":"2102.07074","repositories_listed":10,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":7,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transgan-two-transformers-can-make-one-strong#ran","syntology_url":"https://syntology.ai/paper/2102.07074","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.07074"}},"official":{"repos":["VITA-Group/TransGAN"],"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/negative-data-augmentation-1","slug":"negative-data-augmentation-1","title":"Negative Data Augmentation","date":"2021-02-09","arxiv_id":"2102.05113","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/negative-data-augmentation-1#ran","syntology_url":"https://syntology.ai/paper/2102.05113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.05113"}},"official":{"repos":["ermongroup/NDA"],"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/regularization-strategy-for-point-cloud-via","slug":"regularization-strategy-for-point-cloud-via","title":"Regularization Strategy for Point Cloud via Rigidly Mixed Sample","date":"2021-02-03","arxiv_id":"2102.01929","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/regularization-strategy-for-point-cloud-via#ran","syntology_url":"https://syntology.ai/paper/2102.01929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.01929"}},"official":{"repos":["dogyoonlee/RSMix-official"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-data-augmentation-via-example","slug":"neural-data-augmentation-via-example","title":"Neural Data Augmentation via Example Extrapolation","date":"2021-02-02","arxiv_id":"2102.01335","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-data-augmentation-via-example#ran","syntology_url":"https://syntology.ai/paper/2102.01335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.01335"}},"official":{"repos":["google/example_extrapolation"],"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-maximum-likelihood-training-of-score-based","slug":"on-maximum-likelihood-training-of-score-based","title":"Maximum Likelihood Training of Score-Based Diffusion Models","date":"2021-01-22","arxiv_id":"2101.09258","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"5 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-maximum-likelihood-training-of-score-based#ran","syntology_url":"https://syntology.ai/paper/2101.09258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.09258"}},"official":{"repos":["yang-song/score_flow"],"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/a-pipeline-for-fair-comparison-of-graph","slug":"a-pipeline-for-fair-comparison-of-graph","title":"A pipeline for fair comparison of graph neural networks in node classification tasks","date":"2020-12-19","arxiv_id":"2012.10619","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/a-pipeline-for-fair-comparison-of-graph#ran","syntology_url":"https://syntology.ai/paper/2012.10619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.10619"}},"official":{"repos":["karl-zhao/benchmarking-gnns-pyg"],"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/joint-generative-and-contrastive-learning-for","slug":"joint-generative-and-contrastive-learning-for","title":"Joint Generative and Contrastive Learning for Unsupervised Person Re-identification","date":"2020-12-16","arxiv_id":"2012.09071","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/joint-generative-and-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2012.09071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.09071"}},"official":{"repos":["chenhao2345/GCL"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/simple-copy-paste-is-a-strong-data","slug":"simple-copy-paste-is-a-strong-data","title":"Simple Copy-Paste is a Strong Data Augmentation Method for Instance Segmentation","date":"2020-12-13","arxiv_id":"2012.07177","repositories_listed":5,"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/simple-copy-paste-is-a-strong-data#ran","syntology_url":"https://syntology.ai/paper/2012.07177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07177"}},"official":{"repos":["tensorflow/tpu"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/videomix-rethinking-data-augmentation-for","slug":"videomix-rethinking-data-augmentation-for","title":"VideoMix: Rethinking Data Augmentation for Video Classification","date":"2020-12-07","arxiv_id":"2012.03457","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/videomix-rethinking-data-augmentation-for#ran","syntology_url":"https://syntology.ai/paper/2012.03457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.03457"}},"official":null}},{"url":"/paper/knowledge-distillation-thrives-on-data","slug":"knowledge-distillation-thrives-on-data","title":"What Makes a \"Good\" Data Augmentation in Knowledge Distillation -- A Statistical Perspective","date":"2020-12-05","arxiv_id":"2012.02909","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/knowledge-distillation-thrives-on-data#ran","syntology_url":"https://syntology.ai/paper/2012.02909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.02909"}},"official":{"repos":["mingsun-tse/good-da-in-kd"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improved-contrastive-divergence-training-of-1","slug":"improved-contrastive-divergence-training-of-1","title":"Improved Contrastive Divergence Training of Energy Based Models","date":"2020-12-02","arxiv_id":"2012.01316","repositories_listed":6,"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/improved-contrastive-divergence-training-of-1#ran","syntology_url":"https://syntology.ai/paper/2012.01316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.01316"}},"official":null}},{"url":"/paper/truly-shift-invariant-convolutional-neural","slug":"truly-shift-invariant-convolutional-neural","title":"Truly shift-invariant convolutional neural networks","date":"2020-11-28","arxiv_id":"2011.14214","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":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/truly-shift-invariant-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/2011.14214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.14214"}},"official":{"repos":["achaman2/truly_shift_invariant_cnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/teaching-with-commentaries-1","slug":"teaching-with-commentaries-1","title":"Teaching with Commentaries","date":"2020-11-05","arxiv_id":"2011.03037","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/teaching-with-commentaries-1#ran","syntology_url":"https://syntology.ai/paper/2011.03037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.03037"}},"official":{"repos":["googleinterns/commentaries"],"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/a-two-stage-approach-to-device-robust","slug":"a-two-stage-approach-to-device-robust","title":"A Two-Stage Approach to Device-Robust Acoustic Scene Classification","date":"2020-11-03","arxiv_id":"2011.01447","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-two-stage-approach-to-device-robust#ran","syntology_url":"https://syntology.ai/paper/2011.01447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01447"}},"official":{"repos":["MihawkHu/DCASE2020_task1"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-analysis-of-simple-data-augmentation-for","slug":"an-analysis-of-simple-data-augmentation-for","title":"An Analysis of Simple Data Augmentation for Named Entity Recognition","date":"2020-10-22","arxiv_id":"2010.11683","repositories_listed":3,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-analysis-of-simple-data-augmentation-for#ran","syntology_url":"https://syntology.ai/paper/2010.11683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11683"}},"official":null}},{"url":"/paper/flag-adversarial-data-augmentation-for-graph-1","slug":"flag-adversarial-data-augmentation-for-graph-1","title":"Robust Optimization as Data Augmentation for Large-scale Graphs","date":"2020-10-19","arxiv_id":"2010.09891","repositories_listed":3,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/flag-adversarial-data-augmentation-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2010.09891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09891"}},"official":{"repos":["devnkong/FLAG"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/maximum-entropy-adversarial-data-augmentation","slug":"maximum-entropy-adversarial-data-augmentation","title":"Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustness","date":"2020-10-15","arxiv_id":"2010.08001","repositories_listed":1,"syntology":{"n":22,"n_ran":17,"n_constructed":11,"n_ran_checked":12,"n_instrument":5,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"17 ran (of which 11 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/maximum-entropy-adversarial-data-augmentation#ran","syntology_url":"https://syntology.ai/paper/2010.08001","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08001"}},"official":{"repos":["garyzhao/ME-ADA"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":11,"n_ran_no_instrument_failure":12,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/data-augmentation-for-meta-learning-1","slug":"data-augmentation-for-meta-learning-1","title":"Data Augmentation for Meta-Learning","date":"2020-10-14","arxiv_id":"2010.07092","repositories_listed":1,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":6,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"11 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/data-augmentation-for-meta-learning-1#ran","syntology_url":"https://syntology.ai/paper/2010.07092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07092"}},"official":{"repos":["RenkunNi/MetaAug"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/measuring-visual-generalization-in-continuous-1","slug":"measuring-visual-generalization-in-continuous-1","title":"Measuring Visual Generalization in Continuous Control from Pixels","date":"2020-10-13","arxiv_id":"2010.06740","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/measuring-visual-generalization-in-continuous-1#ran","syntology_url":"https://syntology.ai/paper/2010.06740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06740"}},"official":{"repos":["QData/dmc_remastered","jakegrigsby/dmc_remastered"],"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/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/directional-graph-networks-1","slug":"directional-graph-networks-1","title":"Directional Graph Networks","date":"2020-10-06","arxiv_id":"2010.02863","repositories_listed":2,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":1,"n_honours":3,"n_violates":1,"n_no_contract":7,"n_pointer_only":5,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 1 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/directional-graph-networks-1#ran","syntology_url":"https://syntology.ai/paper/2010.02863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02863"}},"official":{"repos":["Saro00/DGN"],"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/seqmix-augmenting-active-sequence-labeling","slug":"seqmix-augmenting-active-sequence-labeling","title":"SeqMix: Augmenting Active Sequence Labeling via Sequence Mixup","date":"2020-10-05","arxiv_id":"2010.02322","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"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) · 5 unverified","sample_list":"/paper/seqmix-augmenting-active-sequence-labeling#ran","syntology_url":"https://syntology.ai/paper/2010.02322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02322"}},"official":{"repos":["rz-zhang/SeqMix"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-simple-but-tough-to-beat-data-augmentation","slug":"a-simple-but-tough-to-beat-data-augmentation","title":"A Simple but Tough-to-Beat Data Augmentation Approach for Natural Language Understanding and Generation","date":"2020-09-29","arxiv_id":"2009.13818","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/a-simple-but-tough-to-beat-data-augmentation#ran","syntology_url":"https://syntology.ai/paper/2009.13818","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13818"}},"official":{"repos":["dinghanshen/Cutoff"],"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/inltk-natural-language-toolkit-for-indic","slug":"inltk-natural-language-toolkit-for-indic","title":"iNLTK: Natural Language Toolkit for Indic Languages","date":"2020-09-26","arxiv_id":"2009.12534","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 3 unverified","sample_list":"/paper/inltk-natural-language-toolkit-for-indic#ran","syntology_url":"https://syntology.ai/paper/2009.12534","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.12534"}},"official":{"repos":["goru001/inltk"],"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/adapting-bert-for-word-sense-disambiguation","slug":"adapting-bert-for-word-sense-disambiguation","title":"Adapting BERT for Word Sense Disambiguation with Gloss Selection Objective and Example Sentences","date":"2020-09-24","arxiv_id":"2009.11795","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adapting-bert-for-word-sense-disambiguation#ran","syntology_url":"https://syntology.ai/paper/2009.11795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.11795"}},"official":{"repos":["BPYap/BERT-WSD"],"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/synthetic-training-for-accurate-3d-human-pose","slug":"synthetic-training-for-accurate-3d-human-pose","title":"Synthetic Training for Accurate 3D Human Pose and Shape Estimation in the Wild","date":"2020-09-21","arxiv_id":"2009.10013","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/synthetic-training-for-accurate-3d-human-pose#ran","syntology_url":"https://syntology.ai/paper/2009.10013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.10013"}},"official":{"repos":["akashsengupta1997/STRAPS-3DHumanShapePose"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ssmba-self-supervised-manifold-based-data","slug":"ssmba-self-supervised-manifold-based-data","title":"SSMBA: Self-Supervised Manifold Based Data Augmentation for Improving Out-of-Domain Robustness","date":"2020-09-21","arxiv_id":"2009.10195","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ssmba-self-supervised-manifold-based-data#ran","syntology_url":"https://syntology.ai/paper/2009.10195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.10195"}},"official":{"repos":["nng555/ssmba"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficientderain-learning-pixel-wise-dilation","slug":"efficientderain-learning-pixel-wise-dilation","title":"EfficientDeRain: Learning Pixel-wise Dilation Filtering for High-Efficiency Single-Image Deraining","date":"2020-09-19","arxiv_id":"2009.09238","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":2,"n_no_contract":3,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 2 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficientderain-learning-pixel-wise-dilation#ran","syntology_url":"https://syntology.ai/paper/2009.09238","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.09238"}},"official":{"repos":["tsingqguo/efficientderain"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/preparing-for-the-worst-making-networks-less","slug":"preparing-for-the-worst-making-networks-less","title":"Encoding Robustness to Image Style via Adversarial Feature Perturbations","date":"2020-09-18","arxiv_id":"2009.08965","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/preparing-for-the-worst-making-networks-less#ran","syntology_url":"https://syntology.ai/paper/2009.08965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08965"}},"official":{"repos":["azshue/AdvBN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/grounded-adaptation-for-zero-shot-executable","slug":"grounded-adaptation-for-zero-shot-executable","title":"Grounded Adaptation for Zero-shot Executable Semantic Parsing","date":"2020-09-16","arxiv_id":"2009.07396","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/grounded-adaptation-for-zero-shot-executable#ran","syntology_url":"https://syntology.ai/paper/2009.07396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.07396"}},"official":null}},{"url":"/paper/bop-challenge-2020-on-6d-object-localization","slug":"bop-challenge-2020-on-6d-object-localization","title":"BOP Challenge 2020 on 6D Object Localization","date":"2020-09-15","arxiv_id":"2009.07378","repositories_listed":5,"syntology":{"n":30,"n_ran":27,"n_constructed":0,"n_ran_checked":25,"n_instrument":2,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":23,"n_pointer_only":4,"phrase":"27 ran (of which 0 constructed an object rather than computing a result; 25 with no instrument failure: 2 honoured, 0 violated, 23 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bop-challenge-2020-on-6d-object-localization#ran","syntology_url":"https://syntology.ai/paper/2009.07378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.07378"}},"official":{"repos":["thodan/bop_toolkit"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/decoupling-representation-learning-from","slug":"decoupling-representation-learning-from","title":"Decoupling Representation Learning from Reinforcement Learning","date":"2020-09-14","arxiv_id":"2009.08319","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/decoupling-representation-learning-from#ran","syntology_url":"https://syntology.ai/paper/2009.08319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08319"}},"official":{"repos":["astooke/rlpyt"],"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/learning-joint-segmentation-of-tissues-and","slug":"learning-joint-segmentation-of-tissues-and","title":"Learning joint segmentation of tissues and brain lesions from task-specific hetero-modal domain-shifted datasets","date":"2020-09-08","arxiv_id":"2009.04009","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/learning-joint-segmentation-of-tissues-and#ran","syntology_url":"https://syntology.ai/paper/2009.04009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.04009"}},"official":{"repos":["ReubenDo/jSTABL"],"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/rangercnn-towards-fast-and-accurate-3d-object","slug":"rangercnn-towards-fast-and-accurate-3d-object","title":"RangeRCNN: Towards Fast and Accurate 3D Object Detection with Range Image Representation","date":"2020-09-01","arxiv_id":"2009.00206","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":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rangercnn-towards-fast-and-accurate-3d-object#ran","syntology_url":"https://syntology.ai/paper/2009.00206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.00206"}},"official":null}},{"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/bowtie-networks-generative-modeling-for-joint","slug":"bowtie-networks-generative-modeling-for-joint","title":"Bowtie Networks: Generative Modeling for Joint Few-Shot Recognition and Novel-View Synthesis","date":"2020-08-16","arxiv_id":"2008.06981","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":4,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"6 ran (of which 4 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/bowtie-networks-generative-modeling-for-joint#ran","syntology_url":"https://syntology.ai/paper/2008.06981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.06981"}},"official":{"repos":["zpbao/bowtie_networks"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/model-patching-closing-the-subgroup","slug":"model-patching-closing-the-subgroup","title":"Model Patching: Closing the Subgroup Performance Gap with Data Augmentation","date":"2020-08-15","arxiv_id":"2008.06775","repositories_listed":1,"syntology":{"n":24,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/model-patching-closing-the-subgroup#ran","syntology_url":"https://syntology.ai/paper/2008.06775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.06775"}},"official":{"repos":["HazyResearch/model-patching"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/mixing-specific-data-augmentation-techniques","slug":"mixing-specific-data-augmentation-techniques","title":"Mixing-Specific Data Augmentation Techniques for Improved Blind Violin/Piano Source Separation","date":"2020-08-06","arxiv_id":"2008.02480","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/mixing-specific-data-augmentation-techniques#ran","syntology_url":"https://syntology.ai/paper/2008.02480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.02480"}},"official":{"repos":["SunnyCYC/aug4mss"],"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/an-empirical-survey-of-data-augmentation-for","slug":"an-empirical-survey-of-data-augmentation-for","title":"An Empirical Survey of Data Augmentation for Time Series Classification with Neural Networks","date":"2020-07-31","arxiv_id":"2007.15951","repositories_listed":1,"syntology":{"n":19,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/an-empirical-survey-of-data-augmentation-for#ran","syntology_url":"https://syntology.ai/paper/2007.15951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15951"}},"official":{"repos":["uchidalab/time_series_augmentation"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/part-aware-data-augmentation-for-3d-object","slug":"part-aware-data-augmentation-for-3d-object","title":"Part-Aware Data Augmentation for 3D Object Detection in Point Cloud","date":"2020-07-27","arxiv_id":"2007.13373","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":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/part-aware-data-augmentation-for-3d-object#ran","syntology_url":"https://syntology.ai/paper/2007.13373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.13373"}},"official":{"repos":["sky77764/pa-aug.pytorch"],"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/unsupervised-domain-adaptation-in-the","slug":"unsupervised-domain-adaptation-in-the","title":"Unsupervised Domain Adaptation in the Dissimilarity Space for Person Re-identification","date":"2020-07-27","arxiv_id":"2007.13890","repositories_listed":2,"syntology":{"n":19,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/unsupervised-domain-adaptation-in-the#ran","syntology_url":"https://syntology.ai/paper/2007.13890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.13890"}},"official":{"repos":["djidje/D-MMD"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/self-supervised-learning-for-deep-models-in","slug":"self-supervised-learning-for-deep-models-in","title":"Self-supervised Learning for Large-scale Item Recommendations","date":"2020-07-25","arxiv_id":"2007.12865","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-supervised-learning-for-deep-models-in#ran","syntology_url":"https://syntology.ai/paper/2007.12865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12865"}},"official":null}},{"url":"/paper/robust-and-generalizable-visual","slug":"robust-and-generalizable-visual","title":"Robust and Generalizable Visual Representation Learning via Random Convolutions","date":"2020-07-25","arxiv_id":"2007.13003","repositories_listed":5,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-and-generalizable-visual#ran","syntology_url":"https://syntology.ai/paper/2007.13003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.13003"}},"official":null}},{"url":"/paper/regularizing-deep-networks-with-semantic-data","slug":"regularizing-deep-networks-with-semantic-data","title":"Regularizing Deep Networks with Semantic Data Augmentation","date":"2020-07-21","arxiv_id":"2007.10538","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":1,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/regularizing-deep-networks-with-semantic-data#ran","syntology_url":"https://syntology.ai/paper/2007.10538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.10538"}},"official":{"repos":["blackfeather-wang/ISDA-for-Deep-Networks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","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/featmatch-feature-based-augmentation-for-semi","slug":"featmatch-feature-based-augmentation-for-semi","title":"FeatMatch: Feature-Based Augmentation for Semi-Supervised Learning","date":"2020-07-16","arxiv_id":"2007.08505","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/featmatch-feature-based-augmentation-for-semi#ran","syntology_url":"https://syntology.ai/paper/2007.08505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08505"}},"official":null}},{"url":"/paper/classmix-segmentation-based-data-augmentation","slug":"classmix-segmentation-based-data-augmentation","title":"ClassMix: Segmentation-Based Data Augmentation for Semi-Supervised Learning","date":"2020-07-15","arxiv_id":"2007.07936","repositories_listed":2,"syntology":{"n":19,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":7,"n_honours":3,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/classmix-segmentation-based-data-augmentation#ran","syntology_url":"https://syntology.ai/paper/2007.07936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.07936"}},"official":{"repos":["WilhelmT/ClassMix"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/data-efficient-reinforcement-learning-with-1","slug":"data-efficient-reinforcement-learning-with-1","title":"Data-Efficient Reinforcement Learning with Self-Predictive Representations","date":"2020-07-12","arxiv_id":"2007.05929","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":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) · 1 unverified","sample_list":"/paper/data-efficient-reinforcement-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/2007.05929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05929"}},"official":{"repos":["mila-iqia/spr"],"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/variable-skipping-for-autoregressive-range","slug":"variable-skipping-for-autoregressive-range","title":"Variable Skipping for Autoregressive Range Density Estimation","date":"2020-07-10","arxiv_id":"2007.05572","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/variable-skipping-for-autoregressive-range#ran","syntology_url":"https://syntology.ai/paper/2007.05572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05572"}},"official":{"repos":["var-skip/var-skip"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/boundary-thickness-and-robustness-in-learning","slug":"boundary-thickness-and-robustness-in-learning","title":"Boundary thickness and robustness in learning models","date":"2020-07-09","arxiv_id":"2007.05086","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/boundary-thickness-and-robustness-in-learning#ran","syntology_url":"https://syntology.ai/paper/2007.05086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05086"}},"official":{"repos":["nsfzyzz/boundary_thickness"],"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/counterfactual-data-augmentation-using","slug":"counterfactual-data-augmentation-using","title":"Counterfactual Data Augmentation using Locally Factored Dynamics","date":"2020-07-06","arxiv_id":"2007.02863","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/counterfactual-data-augmentation-using#ran","syntology_url":"https://syntology.ai/paper/2007.02863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02863"}},"official":null}},{"url":"/paper/the-many-faces-of-robustness-a-critical","slug":"the-many-faces-of-robustness-a-critical","title":"The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalization","date":"2020-06-29","arxiv_id":"2006.16241","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":1,"n_ran_checked":2,"n_instrument":12,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"14 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 12 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-many-faces-of-robustness-a-critical#ran","syntology_url":"https://syntology.ai/paper/2006.16241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16241"}},"official":{"repos":["hendrycks/imagenet-r"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":1,"n_ran_no_instrument_failure":2,"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/contrastive-generative-adversarial-networks","slug":"contrastive-generative-adversarial-networks","title":"ContraGAN: Contrastive Learning for Conditional Image Generation","date":"2020-06-23","arxiv_id":"2006.12681","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/contrastive-generative-adversarial-networks#ran","syntology_url":"https://syntology.ai/paper/2006.12681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12681"}},"official":{"repos":["POSTECH-CVLab/PyTorch-StudioGAN"],"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":["official"]}}},{"url":"/paper/real-time-speech-enhancement-in-the-waveform","slug":"real-time-speech-enhancement-in-the-waveform","title":"Real Time Speech Enhancement in the Waveform Domain","date":"2020-06-23","arxiv_id":"2006.12847","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/real-time-speech-enhancement-in-the-waveform#ran","syntology_url":"https://syntology.ai/paper/2006.12847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12847"}},"official":{"repos":["facebookresearch/denoiser"],"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/automatic-data-augmentation-for","slug":"automatic-data-augmentation-for","title":"Automatic Data Augmentation for Generalization in Deep Reinforcement Learning","date":"2020-06-23","arxiv_id":"2006.12862","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/automatic-data-augmentation-for#ran","syntology_url":"https://syntology.ai/paper/2006.12862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12862"}},"official":{"repos":["rraileanu/auto-drac"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["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/cascaded-deep-monocular-3d-human-pose-1","slug":"cascaded-deep-monocular-3d-human-pose-1","title":"Cascaded deep monocular 3D human pose estimation with evolutionary training data","date":"2020-06-14","arxiv_id":"2006.07778","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/cascaded-deep-monocular-3d-human-pose-1#ran","syntology_url":"https://syntology.ai/paper/2006.07778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07778"}},"official":{"repos":["Nicholasli1995/EvoSkeleton"],"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/domain-generalization-using-causal-matching-1","slug":"domain-generalization-using-causal-matching-1","title":"Domain Generalization using Causal Matching","date":"2020-06-12","arxiv_id":"2006.07500","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/domain-generalization-using-causal-matching-1#ran","syntology_url":"https://syntology.ai/paper/2006.07500","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07500"}},"official":{"repos":["microsoft/robustdg"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/data-augmentation-for-graph-neural-networks","slug":"data-augmentation-for-graph-neural-networks","title":"Data Augmentation for Graph Neural Networks","date":"2020-06-11","arxiv_id":"2006.06830","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-augmentation-for-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.06830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06830"}},"official":{"repos":["zhao-tong/GAug"],"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/towards-good-practices-for-data-augmentation","slug":"towards-good-practices-for-data-augmentation","title":"On Data Augmentation for GAN Training","date":"2020-06-09","arxiv_id":"2006.05338","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":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/towards-good-practices-for-data-augmentation#ran","syntology_url":"https://syntology.ai/paper/2006.05338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05338"}},"official":{"repos":["sutd-visual-computing-group/dag-gans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-random-neural-network","slug":"graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","arxiv_id":"2005.11079","repositories_listed":9,"syntology":{"n":22,"n_ran":15,"n_constructed":1,"n_ran_checked":9,"n_instrument":6,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"15 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; 6 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/graph-random-neural-network#ran","syntology_url":"https://syntology.ai/paper/2005.11079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11079"}},"official":{"repos":["Grand20/grand"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/lung-segmentation-from-chest-x-rays-using","slug":"lung-segmentation-from-chest-x-rays-using","title":"Lung Segmentation from Chest X-rays using Variational Data Imputation","date":"2020-05-20","arxiv_id":"2005.10052","repositories_listed":3,"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":0,"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/lung-segmentation-from-chest-x-rays-using#ran","syntology_url":"https://syntology.ai/paper/2005.10052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10052"}},"official":{"repos":["raghavian/lungVAE"],"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":["official"]}}},{"url":"/paper/global-inducing-point-variational-posteriors","slug":"global-inducing-point-variational-posteriors","title":"Global inducing point variational posteriors for Bayesian neural networks and deep Gaussian processes","date":"2020-05-17","arxiv_id":"2005.08140","repositories_listed":1,"syntology":{"n":13,"n_ran":6,"n_constructed":4,"n_ran_checked":4,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":13,"phrase":"6 ran (of which 4 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) · 7 unverified","sample_list":"/paper/global-inducing-point-variational-posteriors#ran","syntology_url":"https://syntology.ai/paper/2005.08140","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08140"}},"official":{"repos":["LaurenceA/bayesfunc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-robustifying-nli-models-against","slug":"towards-robustifying-nli-models-against","title":"Towards Robustifying NLI Models Against Lexical Dataset Biases","date":"2020-05-10","arxiv_id":"2005.04732","repositories_listed":1,"syntology":{"n":11,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/towards-robustifying-nli-models-against#ran","syntology_url":"https://syntology.ai/paper/2005.04732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04732"}},"official":{"repos":["owenzx/LexicalDebias-ACL2020"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/a-simple-semi-supervised-learning-framework","slug":"a-simple-semi-supervised-learning-framework","title":"A Simple Semi-Supervised Learning Framework for Object Detection","date":"2020-05-10","arxiv_id":"2005.04757","repositories_listed":7,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-simple-semi-supervised-learning-framework#ran","syntology_url":"https://syntology.ai/paper/2005.04757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04757"}},"official":{"repos":["google-research/ssl_detection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autoclint-the-winning-method-in-autocv","slug":"autoclint-the-winning-method-in-autocv","title":"AutoCLINT: The Winning Method in AutoCV Challenge 2019","date":"2020-05-09","arxiv_id":"2005.04373","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/autoclint-the-winning-method-in-autocv#ran","syntology_url":"https://syntology.ai/paper/2005.04373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04373"}},"official":{"repos":["kakaobrain/autoclint"],"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/on-the-generalization-effects-of-linear","slug":"on-the-generalization-effects-of-linear","title":"On the Generalization Effects of Linear Transformations in Data Augmentation","date":"2020-05-02","arxiv_id":"2005.00695","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":1,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-the-generalization-effects-of-linear#ran","syntology_url":"https://syntology.ai/paper/2005.00695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00695"}},"official":{"repos":["SenWu/dauphin"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/teaching-machine-comprehension-with","slug":"teaching-machine-comprehension-with","title":"Teaching Machine Comprehension with Compositional Explanations","date":"2020-05-02","arxiv_id":"2005.00806","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":1,"n_ran_checked":6,"n_instrument":4,"n_unverified":0,"n_honours":4,"n_violates":1,"n_no_contract":1,"n_pointer_only":10,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 6 with no instrument failure: 4 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/teaching-machine-comprehension-with#ran","syntology_url":"https://syntology.ai/paper/2005.00806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00806"}},"official":{"repos":["INK-USC/mrc-explanation","INK-USC/nl-explanation"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":1,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/control-generate-augment-a-scalable-framework","slug":"control-generate-augment-a-scalable-framework","title":"Control, Generate, Augment: A Scalable Framework for Multi-Attribute Text Generation","date":"2020-04-30","arxiv_id":"2004.14983","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/control-generate-augment-a-scalable-framework#ran","syntology_url":"https://syntology.ai/paper/2004.14983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14983"}},"official":null}},{"url":"/paper/reinforcement-learning-with-augmented-data","slug":"reinforcement-learning-with-augmented-data","title":"Reinforcement Learning with Augmented Data","date":"2020-04-30","arxiv_id":"2004.14990","repositories_listed":2,"syntology":{"n":24,"n_ran":21,"n_constructed":8,"n_ran_checked":9,"n_instrument":12,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":21,"phrase":"21 ran (of which 8 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 12 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/reinforcement-learning-with-augmented-data#ran","syntology_url":"https://syntology.ai/paper/2004.14990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14990"}},"official":null}},{"url":"/paper/image-augmentation-is-all-you-need","slug":"image-augmentation-is-all-you-need","title":"Image Augmentation Is All You Need: Regularizing Deep Reinforcement Learning from Pixels","date":"2020-04-28","arxiv_id":"2004.13649","repositories_listed":4,"syntology":{"n":10,"n_ran":6,"n_constructed":3,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":8,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/image-augmentation-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/2004.13649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13649"}},"official":{"repos":["denisyarats/drq"],"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/g-daug-generative-data-augmentation-for","slug":"g-daug-generative-data-augmentation-for","title":"Generative Data Augmentation for Commonsense Reasoning","date":"2020-04-24","arxiv_id":"2004.11546","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/g-daug-generative-data-augmentation-for#ran","syntology_url":"https://syntology.ai/paper/2004.11546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11546"}},"official":{"repos":["yangyiben/G-DAUG-c-Generative-Data-Augmentation-for-Commonsense-Reasoning"],"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/syntactic-data-augmentation-increases","slug":"syntactic-data-augmentation-increases","title":"Syntactic Data Augmentation Increases Robustness to Inference Heuristics","date":"2020-04-24","arxiv_id":"2004.11999","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/syntactic-data-augmentation-increases#ran","syntology_url":"https://syntology.ai/paper/2004.11999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11999"}},"official":{"repos":["aatlantise/syntactic-augmentation-nli"],"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/yolov4-optimal-speed-and-accuracy-of-object","slug":"yolov4-optimal-speed-and-accuracy-of-object","title":"YOLOv4: Optimal Speed and Accuracy of Object Detection","date":"2020-04-23","arxiv_id":"2004.10934","repositories_listed":223,"syntology":{"n":184,"n_ran":142,"n_constructed":0,"n_ran_checked":133,"n_instrument":9,"n_unverified":42,"n_honours":6,"n_violates":0,"n_no_contract":127,"n_pointer_only":21,"phrase":"142 ran (of which 0 constructed an object rather than computing a result; 133 with no instrument failure: 6 honoured, 0 violated, 127 with no contract checked; 9 where Syntology's instrument failed) · 42 unverified","sample_list":"/paper/yolov4-optimal-speed-and-accuracy-of-object#ran","syntology_url":"https://syntology.ai/paper/2004.10934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10934"}},"official":{"repos":["AlexeyAB/darknet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/supervised-contrastive-learning","slug":"supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","arxiv_id":"2004.11362","repositories_listed":26,"syntology":{"n":23,"n_ran":17,"n_constructed":0,"n_ran_checked":14,"n_instrument":3,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":12,"n_pointer_only":5,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 2 honoured, 0 violated, 12 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/supervised-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2004.11362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11362"}},"official":{"repos":["HobbitLong/SupContrast","google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/logic-guided-data-augmentation-and","slug":"logic-guided-data-augmentation-and","title":"Logic-Guided Data Augmentation and Regularization for Consistent Question Answering","date":"2020-04-21","arxiv_id":"2004.10157","repositories_listed":1,"syntology":{"n":18,"n_ran":8,"n_constructed":0,"n_ran_checked":0,"n_instrument":8,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"8 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; 8 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/logic-guided-data-augmentation-and#ran","syntology_url":"https://syntology.ai/paper/2004.10157","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10157"}},"official":{"repos":["AkariAsai/logic_guided_qa"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/incorporating-external-knowledge-through-pre","slug":"incorporating-external-knowledge-through-pre","title":"Incorporating External Knowledge through Pre-training for Natural Language to Code Generation","date":"2020-04-20","arxiv_id":"2004.09015","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/incorporating-external-knowledge-through-pre#ran","syntology_url":"https://syntology.ai/paper/2004.09015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09015"}},"official":{"repos":["neulab/external-knowledge-codegen"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/paraphrase-augmented-task-oriented-dialog","slug":"paraphrase-augmented-task-oriented-dialog","title":"Paraphrase Augmented Task-Oriented Dialog Generation","date":"2020-04-16","arxiv_id":"2004.07462","repositories_listed":1,"syntology":{"n":9,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":9,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/paraphrase-augmented-task-oriented-dialog#ran","syntology_url":"https://syntology.ai/paper/2004.07462","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07462"}},"official":{"repos":["Silin159/PARG"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-few-shot-learning-via","slug":"unsupervised-few-shot-learning-via","title":"Diversity Helps: Unsupervised Few-shot Learning via Distribution Shift-based Data Augmentation","date":"2020-04-13","arxiv_id":"2004.05805","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-few-shot-learning-via#ran","syntology_url":"https://syntology.ai/paper/2004.05805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05805"}},"official":{"repos":["WonderSeven/ULDA"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/toward-subgraph-guided-knowledge-graph","slug":"toward-subgraph-guided-knowledge-graph","title":"Toward Subgraph-Guided Knowledge Graph Question Generation with Graph Neural Networks","date":"2020-04-13","arxiv_id":"2004.06015","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/toward-subgraph-guided-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2004.06015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06015"}},"official":null}},{"url":"/paper/self-supervised-equivariant-attention","slug":"self-supervised-equivariant-attention","title":"Self-supervised Equivariant Attention Mechanism for Weakly Supervised Semantic Segmentation","date":"2020-04-09","arxiv_id":"2004.04581","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":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-equivariant-attention#ran","syntology_url":"https://syntology.ai/paper/2004.04581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04581"}},"official":{"repos":["YudeWang/SEAM"],"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/exemplar-vaes-for-exemplar-based-generation","slug":"exemplar-vaes-for-exemplar-based-generation","title":"Exemplar VAE: Linking Generative Models, Nearest Neighbor Retrieval, and Data Augmentation","date":"2020-04-09","arxiv_id":"2004.04795","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/exemplar-vaes-for-exemplar-based-generation#ran","syntology_url":"https://syntology.ai/paper/2004.04795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04795"}},"official":{"repos":["sajadn/Exemplar-VAE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}}],"record_sha256":"e2eacbedfc1da894fe6a544c281a47bd8945ef3847480f290597140b82c89884","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}