{"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":"/method/autoaugment","slug":"autoaugment","name":"AutoAugment","full_name":"AutoAugment","full_name_withheld":false,"description_markdown":"**AutoAugment** is an automated approach to find data augmentation policies from data. It formulates the problem of finding the best augmentation policy as a discrete search problem. It consists of two components: a search algorithm and a search space. \r\n\r\nAt a high level, the search algorithm (implemented as a controller RNN) samples a data augmentation policy $S$, which has information about what image processing operation to use, the probability of using the operation in each batch, and the magnitude of the operation. The policy $S$ is used to train a neural network with a fixed architecture, whose validation accuracy $R$ is sent back to update the controller. Since $R$ is not differentiable, the controller will be updated by policy gradient methods. \r\n\r\nThe operations used are from PIL, a popular Python image library: all functions in PIL that accept an image as input and output an image. It additionally uses two other augmentation techniques: [Cutout](https://paperswithcode.com/method/cutout) and SamplePairing. The operations searched over are ShearX/Y, TranslateX/Y, Rotate, AutoContrast, Invert, Equalize, Solarize, Posterize, Contrast, Color, Brightness, Sharpness, Cutout and Sample Pairing.","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"http://arxiv.org/abs/1805.09501v3","title":"AutoAugment: Learning Augmentation Policies from Data","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Image Data Augmentation","url":"/methods/category/image-data-augmentation","pwc_aliases":[]}],"n_papers_tagged":60,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"data-augmentation-for-small-object-using-fast","title":"Data Augmentation For Small Object using Fast AutoAugment","date":"2025-06-10","arxiv_id":"2506.08956","n_code_links":0,"syntology":null},{"paper":"/paper/learning-tree-structured-composition-of-data","slug":"learning-tree-structured-composition-of-data","title":"Learning Tree-Structured Composition of Data Augmentation","date":"2024-08-26","arxiv_id":"2408.14381","n_code_links":1,"syntology":null},{"paper":"/paper/segstrong-c-segmenting-surgical-tools","slug":"segstrong-c-segmenting-surgical-tools","title":"SegSTRONG-C: Segmenting Surgical Tools Robustly On Non-adversarial Generated Corruptions -- An EndoVis'24 Challenge","date":"2024-07-16","arxiv_id":"2407.11906","n_code_links":1,"syntology":null},{"paper":"/paper/autoaugment-is-what-you-need-enhancing-rule","slug":"autoaugment-is-what-you-need-enhancing-rule","title":"AutoAugment Is What You Need: Enhancing Rule-based Augmentation Methods in Low-resource Regimes","date":"2024-02-08","arxiv_id":"2402.05584","n_code_links":1,"syntology":null},{"paper":null,"slug":"autoaugment-input-transformation-for-highly","title":"AutoAugment Input Transformation for Highly Transferable Targeted Attacks","date":"2023-12-21","arxiv_id":"2312.14218","n_code_links":0,"syntology":null},{"paper":"/paper/la3-efficient-label-aware-autoaugment","slug":"la3-efficient-label-aware-autoaugment","title":"LA3: Efficient Label-Aware AutoAugment","date":"2023-04-20","arxiv_id":"2304.10310","n_code_links":1,"syntology":null},{"paper":"/paper/rangeaugment-efficient-online-augmentation","slug":"rangeaugment-efficient-online-augmentation","title":"RangeAugment: Efficient Online Augmentation with Range Learning","date":"2022-12-20","arxiv_id":"2212.10553","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-and-effective-augmentation-strategy","slug":"efficient-and-effective-augmentation-strategy","title":"Efficient and Effective Augmentation Strategy for Adversarial Training","date":"2022-10-27","arxiv_id":"2210.15318","n_code_links":2,"syntology":{"ran":7,"of":7,"n_ran_checked":6,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["val-iisc/dajat"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-self-regularized-adversarial-views","slug":"learning-self-regularized-adversarial-views","title":"Learning Self-Regularized Adversarial Views for Self-Supervised Vision Transformers","date":"2022-10-16","arxiv_id":"2210.08458","n_code_links":1,"syntology":null},{"paper":"/paper/ultra-fast-image-categorization-in-vivo-and","slug":"ultra-fast-image-categorization-in-vivo-and","title":"Ultrafast Image Categorization in Biology and Neural Models","date":"2022-05-07","arxiv_id":"2205.03635","n_code_links":1,"syntology":null},{"paper":"/paper/deep-autoaugment-1","slug":"deep-autoaugment-1","title":"Deep AutoAugment","date":"2022-03-11","arxiv_id":"2203.06172","n_code_links":1,"syntology":null},{"paper":null,"slug":"selectaugment-hierarchical-deterministic","title":"SelectAugment: Hierarchical Deterministic Sample Selection for Data Augmentation","date":"2021-12-06","arxiv_id":"2112.02862","n_code_links":0,"syntology":null},{"paper":null,"slug":"challenges-of-adversarial-image-augmentations","title":"Challenges of Adversarial Image Augmentations","date":"2021-11-24","arxiv_id":"2111.12427","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-augmentation-distributions-using","title":"Learning Augmentation Distributions using Transformed Risk Minimization","date":"2021-11-16","arxiv_id":"2111.08190","n_code_links":0,"syntology":null},{"paper":"/paper/improving-model-generalization-by-agreement","slug":"improving-model-generalization-by-agreement","title":"Improving Model Generalization by Agreement of Learned Representations from Data Augmentation","date":"2021-10-20","arxiv_id":"2110.10536","n_code_links":1,"syntology":null},{"paper":"/paper/text-autoaugment-learning-compositional","slug":"text-autoaugment-learning-compositional","title":"Text AutoAugment: Learning Compositional Augmentation Policy for Text Classification","date":"2021-09-01","arxiv_id":"2109.00523","n_code_links":1,"syntology":null},{"paper":"/paper/direct-differentiable-augmentation-search","slug":"direct-differentiable-augmentation-search","title":"Direct Differentiable Augmentation Search","date":"2021-04-09","arxiv_id":"2104.04282","n_code_links":1,"syntology":null},{"paper":null,"slug":"relating-adversarially-robust-generalization","title":"Relating Adversarially Robust Generalization to Flat Minima","date":"2021-04-09","arxiv_id":"2104.04448","n_code_links":0,"syntology":null},{"paper":"/paper/robust-and-accurate-object-detection-via","slug":"robust-and-accurate-object-detection-via","title":"Robust and Accurate Object Detection via Adversarial Learning","date":"2021-03-23","arxiv_id":"2103.13886","n_code_links":3,"syntology":null},{"paper":"/paper/patch-autoaugment","slug":"patch-autoaugment","title":"Local Patch AutoAugment with Multi-Agent Collaboration","date":"2021-03-20","arxiv_id":"2103.11099","n_code_links":2,"syntology":null},{"paper":"/paper/autodo-robust-autoaugment-for-biased-data","slug":"autodo-robust-autoaugment-for-biased-data","title":"AutoDO: Robust AutoAugment for Biased Data with Label Noise via Scalable Probabilistic Implicit Differentiation","date":"2021-03-10","arxiv_id":"2103.05863","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":4,"n_instrument":2,"unverified":1,"pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["gudovskiy/autodo"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"faster-and-smarter-autoaugment-augmentation","title":"Faster and Smarter AutoAugment: Augmentation Policy Search Based on Dynamic Data-Clustering","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"nose-augment-fast-and-effective-data","title":"NOSE Augment: Fast and Effective Data Augmentation Without Searching","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"semantic-aware-data-augmentation-for-cell","title":"Semantic Aware Data Augmentation for Cell Nuclei Microscopical Images With Artificial Neural Networks","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"imclr-implicit-contrastive-learning-for-image-1","title":"StackMix: A complementary Mix algorithm","date":"2020-11-25","arxiv_id":"2011.12618","n_code_links":0,"syntology":null},{"paper":"/paper/keepaugment-a-simple-information-preserving","slug":"keepaugment-a-simple-information-preserving","title":"KeepAugment: A Simple Information-Preserving Data Augmentation Approach","date":"2020-11-23","arxiv_id":"2011.11778","n_code_links":1,"syntology":null},{"paper":"/paper/an-efficient-and-scalable-deep-learning","slug":"an-efficient-and-scalable-deep-learning","title":"An Efficient and Scalable Deep Learning Approach for Road Damage Detection","date":"2020-11-18","arxiv_id":"2011.09577","n_code_links":2,"syntology":null},{"paper":"/paper/regularizing-neural-networks-via-adversarial","slug":"regularizing-neural-networks-via-adversarial","title":"Regularizing Neural Networks via Adversarial Model Perturbation","date":"2020-10-10","arxiv_id":"2010.04925","n_code_links":1,"syntology":{"ran":8,"of":12,"n_ran_checked":8,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["hiyouga/AMP-Regularizer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-technical-report-for-vipriors-image","title":"A Technical Report for VIPriors Image Classification Challenge","date":"2020-07-17","arxiv_id":"2007.08722","n_code_links":0,"syntology":null},{"paper":null,"slug":"hypernetwork-based-augmentation","title":"Hypernetwork-Based Augmentation","date":"2020-06-11","arxiv_id":"2006.06320","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"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","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"]}}},{"paper":"/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","n_code_links":2,"syntology":{"ran":6,"of":9,"n_ran_checked":6,"n_instrument":0,"unverified":3,"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","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"]}}},{"paper":"/paper/remixmatch-semi-supervised-learning-with","slug":"remixmatch-semi-supervised-learning-with","title":"ReMixMatch: Semi-Supervised Learning with Distribution Matching and Augmentation Anchoring","date":"2020-05-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/supervised-contrastive-learning","slug":"supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","arxiv_id":"2004.11362","n_code_links":26,"syntology":{"ran":17,"of":23,"n_ran_checked":12,"n_instrument":5,"unverified":6,"pointer_only":5,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","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"]}}},{"paper":"/paper/resnest-split-attention-networks","slug":"resnest-split-attention-networks","title":"ResNeSt: Split-Attention Networks","date":"2020-04-19","arxiv_id":"2004.08955","n_code_links":36,"syntology":{"ran":28,"of":48,"n_ran_checked":21,"n_instrument":7,"unverified":20,"pointer_only":23,"phrase":"28 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 7 where Syntology's instrument failed) · 20 unverified","official":{"repos":["zhanghang1989/ResNeSt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/uniformaugment-a-search-free-probabilistic","slug":"uniformaugment-a-search-free-probabilistic","title":"UniformAugment: A Search-free Probabilistic Data Augmentation Approach","date":"2020-03-31","arxiv_id":"2003.14348","n_code_links":1,"syntology":null},{"paper":"/paper/tresnet-high-performance-gpu-dedicated","slug":"tresnet-high-performance-gpu-dedicated","title":"TResNet: High Performance GPU-Dedicated Architecture","date":"2020-03-30","arxiv_id":"2003.13630","n_code_links":3,"syntology":null},{"paper":"/paper/circumventing-outliers-of-autoaugment-with","slug":"circumventing-outliers-of-autoaugment-with","title":"Circumventing Outliers of AutoAugment with Knowledge Distillation","date":"2020-03-25","arxiv_id":"2003.11342","n_code_links":1,"syntology":null},{"paper":"/paper/supermix-supervising-the-mixing-data","slug":"supermix-supervising-the-mixing-data","title":"SuperMix: Supervising the Mixing Data Augmentation","date":"2020-03-10","arxiv_id":"2003.05034","n_code_links":2,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["alldbi/SuperMix"],"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"]}}},{"paper":"/paper/dada-differentiable-automatic-data","slug":"dada-differentiable-automatic-data","title":"DADA: Differentiable Automatic Data Augmentation","date":"2020-03-08","arxiv_id":"2003.03780","n_code_links":1,"syntology":{"ran":8,"of":9,"n_ran_checked":5,"n_instrument":3,"unverified":1,"pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["VDIGPKU/DADA"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/compounding-the-performance-improvements-of","slug":"compounding-the-performance-improvements-of","title":"Compounding the Performance Improvements of Assembled Techniques in a Convolutional Neural Network","date":"2020-01-17","arxiv_id":"2001.06268","n_code_links":1,"syntology":{"ran":3,"of":11,"n_ran_checked":2,"n_instrument":1,"unverified":8,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","official":{"repos":["clovaai/assembled-cnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]}}},{"paper":"/paper/gridmask-data-augmentation","slug":"gridmask-data-augmentation","title":"GridMask Data Augmentation","date":"2020-01-13","arxiv_id":"2001.04086","n_code_links":7,"syntology":null},{"paper":"/paper/adversarial-autoaugment-1","slug":"adversarial-autoaugment-1","title":"Adversarial AutoAugment","date":"2019-12-24","arxiv_id":"1912.11188","n_code_links":0,"syntology":null},{"paper":"/paper/adversarial-examples-improve-image","slug":"adversarial-examples-improve-image","title":"Adversarial Examples Improve Image Recognition","date":"2019-11-21","arxiv_id":"1911.09665","n_code_links":6,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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","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"]}}},{"paper":"/paper/remixmatch-semi-supervised-learning-with-1","slug":"remixmatch-semi-supervised-learning-with-1","title":"ReMixMatch: Semi-Supervised Learning with Distribution Alignment and Augmentation Anchoring","date":"2019-11-21","arxiv_id":"1911.09785","n_code_links":3,"syntology":{"ran":1,"of":4,"n_ran_checked":0,"n_instrument":1,"unverified":3,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["google-research/remixmatch","google-research/mixmatch"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["unlocated"]}}},{"paper":"/paper/faster-autoaugment-learning-augmentation","slug":"faster-autoaugment-learning-augmentation","title":"Faster AutoAugment: Learning Augmentation Strategies using Backpropagation","date":"2019-11-16","arxiv_id":"1911.06987","n_code_links":1,"syntology":{"ran":6,"of":9,"n_ran_checked":6,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/randaugment-practical-data-augmentation-with","slug":"randaugment-practical-data-augmentation-with","title":"RandAugment: Practical automated data augmentation with a reduced search space","date":"2019-09-30","arxiv_id":"1909.13719","n_code_links":19,"syntology":{"ran":58,"of":65,"n_ran_checked":7,"n_instrument":51,"unverified":7,"pointer_only":17,"phrase":"58 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 51 where Syntology's instrument failed) · 7 unverified","official":null}},{"paper":"/paper/automatically-learning-data-augmentation","slug":"automatically-learning-data-augmentation","title":"Automatically Learning Data Augmentation Policies for Dialogue Tasks","date":"2019-09-27","arxiv_id":"1909.12868","n_code_links":1,"syntology":null},{"paper":"/paper/scarletnas-bridging-the-gap-between","slug":"scarletnas-bridging-the-gap-between","title":"SCARLET-NAS: Bridging the Gap between Stability and Scalability in Weight-sharing Neural Architecture Search","date":"2019-08-16","arxiv_id":"1908.06022","n_code_links":1,"syntology":null},{"paper":"/paper/greedy-autoaugment","slug":"greedy-autoaugment","title":"Greedy AutoAugment","date":"2019-08-02","arxiv_id":"1908.00704","n_code_links":2,"syntology":null},{"paper":null,"slug":"a-fourier-perspective-on-model-robustness-in","title":"A Fourier Perspective on Model Robustness in Computer Vision","date":"2019-06-21","arxiv_id":"1906.08988","n_code_links":0,"syntology":null},{"paper":"/paper/improving-robustness-without-sacrificing","slug":"improving-robustness-without-sacrificing","title":"Improving Robustness Without Sacrificing Accuracy with Patch Gaussian Augmentation","date":"2019-06-06","arxiv_id":"1906.02611","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":null}},{"paper":"/paper/autoaugment-learning-augmentation-strategies","slug":"autoaugment-learning-augmentation-strategies","title":"AutoAugment: Learning Augmentation Strategies From Data","date":"2019-06-01","arxiv_id":null,"n_code_links":3,"syntology":null},{"paper":"/paper/efficientnet-rethinking-model-scaling-for","slug":"efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","arxiv_id":"1905.11946","n_code_links":144,"syntology":{"ran":198,"of":302,"n_ran_checked":157,"n_instrument":41,"unverified":104,"pointer_only":113,"phrase":"198 ran (of which 73 constructed an object rather than computing a result; 157 with no instrument failure: 26 honoured, 2 violated, 129 with no contract checked; 41 where Syntology's instrument failed) · 104 unverified","official":{"repos":["tensorflow/tpu"],"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"]}}},{"paper":"/paper/190505393","slug":"190505393","title":"Population Based Augmentation: Efficient Learning of Augmentation Policy Schedules","date":"2019-05-14","arxiv_id":"1905.05393","n_code_links":3,"syntology":{"ran":11,"of":18,"n_ran_checked":11,"n_instrument":0,"unverified":7,"pointer_only":18,"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) · 7 unverified","official":{"repos":["arcelien/pba"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/fast-autoaugment","slug":"fast-autoaugment","title":"Fast AutoAugment","date":"2019-05-01","arxiv_id":"1905.00397","n_code_links":11,"syntology":{"ran":37,"of":40,"n_ran_checked":21,"n_instrument":16,"unverified":3,"pointer_only":7,"phrase":"37 ran (of which 2 constructed an object rather than computing a result; 21 with no instrument failure: 2 honoured, 0 violated, 19 with no contract checked; 16 where Syntology's instrument failed) · 3 unverified","official":{"repos":["kakaobrain/fast-autoaugment"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/soft-conditional-computation","slug":"soft-conditional-computation","title":"CondConv: Conditionally Parameterized Convolutions for Efficient Inference","date":"2019-04-10","arxiv_id":"1904.04971","n_code_links":9,"syntology":null},{"paper":"/paper/multigrain-a-unified-image-embedding-for","slug":"multigrain-a-unified-image-embedding-for","title":"MultiGrain: a unified image embedding for classes and instances","date":"2019-02-14","arxiv_id":"1902.05509","n_code_links":3,"syntology":{"ran":4,"of":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["facebookresearch/multigrain"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"learning-data-augmentation-policies-using","title":"Learning data augmentation policies using augmented random search","date":"2018-11-12","arxiv_id":"1811.04768","n_code_links":0,"syntology":null},{"paper":"/paper/autoaugment-learning-augmentation-policies","slug":"autoaugment-learning-augmentation-policies","title":"AutoAugment: Learning Augmentation Policies from Data","date":"2018-05-24","arxiv_id":"1805.09501","n_code_links":33,"syntology":{"ran":25,"of":43,"n_ran_checked":22,"n_instrument":3,"unverified":18,"pointer_only":4,"phrase":"25 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 1 honoured, 2 violated, 19 with no contract checked; 3 where Syntology's instrument failed) · 18 unverified","official":{"repos":["tensorflow/models"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":60,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":60,"with_a_code_link":45,"where_syntology_ran_a_sample":20,"not_listed_spam_title":0,"listed":60,"listed_where_code_ran":20,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":3,"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"},"papers_where_code_ran":20,"papers_where_code_ran_first_page":"/method/autoaugment/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/autoaugment/papers/ran/1","json":"/method/autoaugment/papers/ran/1.json","rows":20}],"tasks":[{"task":"/task/data-augmentation","name":"Data Augmentation","papers":41},{"task":"/task/image-classification","name":"Image Classification","papers":25},{"task":"/task/object-detection","name":"Object Detection","papers":14},{"task":"/task/image-classification","name":"image-classification","papers":13},{"task":"/task/object-detection-1","name":"object-detection","papers":11},{"task":"/task/classification","name":"General Classification","papers":8},{"task":"/task/domain-generalization","name":"Domain Generalization","papers":6},{"task":null,"name":"GPU","papers":5},{"task":"/task/image-augmentation","name":"Image Augmentation","papers":5},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":5},{"task":"/task/automl","name":"AutoML","papers":4},{"task":"/task/diversity","name":"Diversity","papers":4},{"task":"/task/fine-grained-image-classification","name":"Fine-Grained Image Classification","papers":4},{"task":"/task/classification-1","name":"Classification","papers":3},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":3},{"task":"/task/image-retrieval","name":"Image Retrieval","papers":3},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":3},{"task":"/task/object","name":"Object","papers":3},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":3},{"task":"/task/retrieval","name":"Retrieval","papers":3}],"tasks_shown":20,"n_tasks":68,"usage_by_year":[{"year":"2018","papers":2},{"year":"2019","papers":16},{"year":"2020","papers":18},{"year":"2021","papers":13},{"year":"2022","papers":5},{"year":"2023","papers":2},{"year":"2024","papers":3},{"year":"2025","papers":1}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/autoaugment"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=AutoAugment","read_at":"2026-10-05T00:52:53+00:00","query":"AutoAugment","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"1805.09501"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":33,"in_graph":33,"list_truncated":false,"strongest_link":"official"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='1805.09501')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1805.09501","citations":2003},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'AutoAugment'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1805.09501","page":"/paper/autoaugment-learning-augmentation-policies","syntology_url":"https://syntology.ai/paper/1805.09501","in_graph_layer":true,"samples":43,"ran":25,"n_ran_checked":22,"n_instrument":3,"unverified":18,"phrase":"25 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 1 honoured, 2 violated, 19 with no contract checked; 3 where Syntology's instrument failed) · 18 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 33 listed of 33 in the graph, strongest link: official. The lookup matched a paper by its title, arXiv:1805.09501, not a method entry. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:1805.09501) is about this method is not checked.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"a17d92dbccf43cbce5ac8b7c9e90acebc3c471fdada75d588fb21d866112a4f2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}