mlsanityData to 14 Oct 2026

Drawing Multiple Augmentation Samples Per Image During Training Efficiently Decreases Test Error

arXiv 2105.13343 ↗First posted 27 May 2021cs.LG cs.CVcited by 33

Not on the map. Why?

Abstract (arXiv)

In computer vision, it is standard practice to draw a single sample from the data augmentation procedure for each unique image in the mini-batch. However recent work has suggested drawing multiple samples can achieve higher test accuracies. In this work, we provide a detailed empirical evaluation of how the number of augmentation samples per unique image influences model performance on held out data when training deep ResNets. We demonstrate drawing multiple samples per image consistently enhances the test accuracy achieved for both small and large batch training. Crucially, this benefit arises even if different numbers of augmentations per image perform the same number of parameter updates and gradient evaluations (requiring the same total compute). Although prior work has found variance in the gradient estimate arising from subsampling the dataset has an implicit regularization benefit, our experiments suggest variance which arises from the data augmentation process harms generalization. We apply these insights to the highly performant NFNet-F5, achieving 86.8% top-1 w/o extra data on ImageNet.

Key facts. Cited by 33 papers in the map (data through 14 Oct 2026). Builds on 38 of its 43 references that are in the map. First posted on arXiv 27 May 2021.

Builds on

38 of 43 references.

References · 38

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  4. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
  5. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
  6. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  7. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  8. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
  9. 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
  10. 2014Going Deeper with Convolutionscited by 4,241
  11. 2016Wide Residual Networkscited by 3,070
  12. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
26 more
  1. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,269
  2. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  3. 2016Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learningcited by 1,512
  4. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,492
  5. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
  6. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  7. 2016Deep Networks with Stochastic Depthcited by 979
  8. 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 901
  9. 2021Going deeper with Image Transformerscited by 764
  10. 2021High-Performance Large-Scale Image Recognition Without Normalizationcited by 360
  11. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
  12. 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 279
  13. 2017Three Factors Influencing Minima in SGDcited by 273
  14. 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 184
  15. 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
  16. 2017The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learningcited by 150
  17. 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 135
  18. 2019Which Algorithmic Choices Matter at Which Batch Sizes? Insights From a Noisy Quadratic Modelcited by 117
  19. 2017Stochastic gradient descent performs variational inference, converges to limit cycles for deep networkscited by 109
  20. 2021Characterizing signal propagation to close the performance gap in unnormalized ResNetscited by 88
  21. 2019MultiGrain: a unified image embedding for classes and instancescited by 85
  22. 2020On the Generalization Benefit of Noise in Stochastic Gradient Descentcited by 82
  23. 2020The Implicit and Explicit Regularization Effects of Dropoutcited by 71
  24. 2019Augment your batch: better training with larger batchescited by 37
  25. 2019Faster Neural Network Training with Data Echoingcited by 20
  26. 2019The Effect of Network Width on Stochastic Gradient Descent and Generalization: an Empirical Studycited by 16

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 4; 2022: 10; 2023: 10; 2024: 4; 2025: 3; 2026: 2.

33 papers.

Sort:

By area:

  1. 2022Unlocking High-Accuracy Differentially Private Image Classification through Scalecited by 224
  2. 2021VOLO: Vision Outlooker for Visual Recognitioncited by 165
  3. 2024Rephrasing the Web: A Recipe for Compute and Data-Efficient Language Modelingcited by 161
  4. 2023A Modern Look at the Relationship between Sharpness and Generalizationcited by 92
  5. 2023Differentially Private Diffusion Models Generate Useful Synthetic Imagescited by 86
  6. 2022How Much Data Are Augmentations Worth? An Investigation into Scaling Laws, Invariance, and Implicit Regularizationcited by 40
  7. 2022Compute-Efficient Deep Learning: Algorithmic Trends and Opportunitiescited by 38
  8. 2021Data augmentation in Bayesian neural networks and the cold posterior effectcited by 36
  9. 2022Differentially private training of residual networks with scale normalisationcited by 26
  10. 2022Extreme Masking for Learning Instance and Distributed Visual Representationscited by 21
  11. 2021Using Soft Labels to Model Uncertainty in Medical Image Segmentationcited by 18
  12. 2022Deep AutoAugmentcited by 18
21 more
  1. 2025Optimizers Qualitatively Alter Solutions And We Should Leverage Thiscited by 17
  2. 2023Unlocking Accuracy and Fairness in Differentially Private Image Classificationcited by 16
  3. 2023ConvNets Match Vision Transformers at Scalecited by 16
  4. 2024Ensemble everything everywhere: Multi-scale aggregation for adversarial robustnesscited by 12
  5. 2023Using Diffusion Models to Generate Synthetic Labelled Data for Medical Image Segmentationcited by 10
  6. 2022Regularising for invariance to data augmentation improves supervised learningcited by 9
  7. 2024Poly-View Contrastive Learningcited by 9
  8. 2022Disjoint Masking with Joint Distillation for Efficient Masked Image Modelingcited by 6
  9. 2023Tied-Augment: Controlling Representation Similarity Improves Data Augmentationcited by 5
  10. 2021Encoder-Decoder Architectures for Clinically Relevant Coronary Artery Segmentationcited by 4
  11. 2023Equivariant Differentially Private Deep Learning: Why DP-SGD Needs Sparser Modelscited by 4
  12. 2023A Unified View of Differentially Private Deep Generative Modelingcited by 4
  13. 2023SpliceMix: A Cross-scale and Semantic Blending Augmentation Strategy for Multi-label Image Classificationcited by 4
  14. 2025A Principled Framework for Multi-View Contrastive Learningcited by 4
  15. 2022SmoothNets: Optimizing CNN architecture design for differentially private deep learningcited by 3
  16. 2023Multi-attacks: Many images + the same adversarial attack → many target labelscited by 3
  17. 2025Aligned Contrastive Loss for Long-Tailed Recognitioncited by 1
  18. 2022Adults as Augmentations for Children in Facial Emotion Recognition with Contrastive Learningcited by 0
  19. 2024Preserving Angles Improves Feature Distillationcited by 0
  20. 2026The geometry of invariant learning: an information-theoretic analysis of data augmentation and generalizationcited by 0
  21. 2026The hidden advantage of mask resampling: a theory of masked autoencoderscited by 0