mlsanityData to 14 Oct 2026

The good, the bad and the ugly sides of data augmentation: An implicit spectral regularization perspective

arXiv 2210.05021 ↗First posted 10 Oct 2022cs.LG stat.MLcited by 24

Not on the map. Why?

Abstract (arXiv)

Data augmentation (DA) is a powerful workhorse for bolstering performance in modern machine learning. Specific augmentations like translations and scaling in computer vision are traditionally believed to improve generalization by generating new (artificial) data from the same distribution. However, this traditional viewpoint does not explain the success of prevalent augmentations in modern machine learning (e.g. randomized masking, cutout, mixup), that greatly alter the training data distribution. In this work, we develop a new theoretical framework to characterize the impact of a general class of DA on underparameterized and overparameterized linear model generalization. Our framework reveals that DA induces implicit spectral regularization through a combination of two distinct effects: a) manipulating the relative proportion of eigenvalues of the data covariance matrix in a training-data-dependent manner, and b) uniformly boosting the entire spectrum of the data covariance matrix through ridge regression. These effects, when applied to popular augmentations, give rise to a wide variety of phenomena, including discrepancies in generalization between over-parameterized and under-parameterized regimes and differences between regression and classification tasks. Our framework highlights the nuanced and sometimes surprising impacts of DA on generalization, and serves as a testbed for novel augmentation design.

Key facts. Cited by 24 papers in the map (data through 14 Oct 2026). Builds on 53 of its 73 references that are in the map. First posted on arXiv 10 Oct 2022.

Builds on

53 of 73 references.

References · 53

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  2. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
  3. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  4. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
  5. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,838
  6. 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,628
  7. 2016Group Equivariant Convolutional Networkscited by 1,165
  8. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  9. 2019Benign Overfitting in Linear Regressioncited by 549
  10. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
  11. 2021A Survey of Data Augmentation Approaches for NLPcited by 409
  12. 2022Masked Siamese Networks for Label-Efficient Learningcited by 302
38 more
  1. 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 297
  2. 2020Time Series Data Augmentation for Deep Learning: A Surveycited by 226
  3. 2019Two models of double descent for weak featurescited by 195
  4. 2020Benign overfitting in ridge regressioncited by 153
  5. 2020Evaluation of Neural Architectures Trained with Square Loss vs Cross-Entropy in Classification Taskscited by 138
  6. 2019Harmless interpolation of noisy data in regressioncited by 121
  7. 2020Optimal Regularization Can Mitigate Double Descentcited by 109
  8. 2018A Kernel Theory of Modern Data Augmentationcited by 106
  9. 2020On the Optimal Weighted ℓ2 Regularization in Overparameterized Linear Regressioncited by 98
  10. 2020Classification vs regression in overparameterized regimes: Does the loss function matter?cited by 97
  11. 2017Learning to Compose Domain-Specific Transformations for Data Augmentationcited by 91
  12. 2021Learning with invariances in random features and kernel modelscited by 89
  13. 2019A Model of Double Descent for High-dimensional Binary Linear Classificationcited by 81
  14. 2020Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regimecited by 81
  15. 2021A Simple Baseline for Semi-supervised Semantic Segmentation with Strong Data Augmentationcited by 79
  16. 2019Enhanced Convolutional Neural Tangent Kernelscited by 76
  17. 2021Benign Overfitting of Constant-Stepsize SGD for Linear Regressioncited by 71
  18. 2021A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learningcited by 57
  19. 2018Optimal ridge penalty for real-world high-dimensional data can be zero or negative due to the implicit ridge regularizationcited by 53
  20. 2021Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian Mixturescited by 49
  21. 2020On the Generalization Effects of Linear Transformations in Data Augmentationcited by 47
  22. 2021Negative Data Augmentationcited by 46
  23. 2020Affinity and Diversity: Quantifying Mechanisms of Data Augmentationcited by 45
  24. 2018Deep Knockoffscited by 41
  25. 2022The Implicit Bias of Benign Overfittingcited by 38
  26. 2021Mine Your Own vieW: Self-Supervised Learning Through Across-Sample Predictioncited by 36
  27. 2021How rotational invariance of common kernels prevents generalization in high dimensionscited by 32
  28. 2015Dropout as data augmentationcited by 27
  29. 2020Binary Classification of Gaussian Mixtures: Abundance of Support Vectors, Benign Overfitting and Regularizationcited by 27
  30. 2018On the Implicit Bias of Dropoutcited by 22
  31. 2022Boosting Robustness of Image Matting with Context Assembling and Strong Data Augmentationcited by 22
  32. 2019Invariance-inducing regularization using worst-case transformations suffices to boost accuracy and spatial robustnesscited by 18
  33. 2021Drop, Swap, and Generate: A Self-Supervised Approach for Generating Neural Activitycited by 18
  34. 2022Data Augmentation as Feature Manipulationcited by 18
  35. 2020How Data Augmentation affects Optimization for Linear Regressioncited by 15
  36. 2017Dropout as a Low-Rank Regularizer for Matrix Factorizationcited by 14
  37. 2021Harmless interpolation in regression and classification with structured featurescited by 14
  38. 2015Learning with Group Invariant Features: A Kernel Perspectivecited by 13

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 7; 2024: 5; 2025: 6; 2026: 6.

24 papers.

Sort:

By area:

  1. 2025Joint Embedding vs Reconstruction: Provable Benefits of Latent Space Prediction for Self Supervised Learningcited by 36
  2. 2023Half-Hop: A graph upsampling approach for slowing down message passingcited by 13
  3. 2023Understanding the Detrimental Class-level Effects of Data Augmentationcited by 13
  4. 2023Generalized equivalences between subsampling and ridge regularizationcited by 10
  5. 2023Data Optimization in Deep Learning: A Surveycited by 6
  6. 2023LatentDR: Improving Model Generalization Through Sample-Aware Latent Degradation and Restorationcited by 4
  7. 2025A Principled Framework for Multi-View Contrastive Learningcited by 4
  8. 2026Data Augmentation: A Fourier Analysis Perspectivecited by 4
  9. 2024Balanced Data, Imbalanced Spectra: Unveiling Class Disparities with Spectral Imbalancecited by 2
  10. 2024Error-driven Data-efficient Large Multimodal Model Tuningcited by 2
  11. 2023Flat Minima in Linear Estimation and an Extended Gauss Markov Theoremcited by 1
  12. 2024Training on Irrelevant States Implies Data Augmentation: Generalization in Contextual MDPscited by 1
12 more
  1. 2025Learning to Substitute Components for Compositional Generalizationcited by 1
  2. 2025Residual Feature Integration is Sufficient to Prevent Negative Transfercited by 1
  3. 2025How Ensembles of Distilled Policies Improve Generalisation in Reinforcement Learningcited by 1
  4. 2025ADAPT: A Pseudo-labeling Approach to Combat Concept Drift in Malware Detectioncited by 1
  5. 2026Sparse Data Augmentation for Optimization with Provable Guaranteescited by 1
  6. 2023Improving Deep Representation Learning via Auxiliary Learnable Target Codingcited by 0
  7. 2024Explore-Go: Leveraging Exploration for Generalisation in Deep Reinforcement Learningcited by 0
  8. 2024SAFLEX: Self-Adaptive Augmentation via Feature Label Extrapolationcited by 0
  9. 2026The geometry of invariant learning: an information-theoretic analysis of data augmentation and generalizationcited by 0
  10. 2026Characterizing the Generalization Error of Random Feature Regression with Arbitrary Data-Augmentationcited by 0
  11. 2026Covariance Shrinkage via Stochastic Interpolationcited by 0
  12. 2026Diagonal Attenuation: A Finite-Sample Correction for PCAcited by 0