A Group-Theoretic Framework for Data Augmentation
Shuxiao Chen, Edgar Dobriban, Jane H. Lee
Abstract
Data augmentation is a widely used trick when training deep neural networks: in addition to the original data, properly transformed data are also added to the training set. However, to the best of our knowledge, a clear mathematical framework to explain the performance benefits of data augmentation is not available. In this paper, we develop such a theoretical framework. We show data augmentation is equivalent to an averaging operation over the orbits of a certain group that keeps the data distribution approximately invariant. We prove that it leads to variance reduction. We study empirical risk minimization, and the examples of exponential families, linear regression, and certain two-layer neural networks. We also discuss how data augmentation could be used in problems with symmetry where other approaches are prevalent, such as in cryo-electron microscopy (cryo-EM).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a0653ac1-6d08-4142-b59e-a8fdfd11a3d5Cited by top-tier papers66
- Self-Supervised Learning with Data Augmentations Provably Isolates Content from StyleJulius von Kügelgen, Yash Sharma, Luigi Gresele, Wieland Brendel et al.NeurIPS 2021 · 421 citations
- Toward Understanding the Feature Learning Process of Self-supervised Contrastive LearningZixin Wen, Yuanzhi LiICML 2021 · 162 citations
- The Effects of Regularization and Data Augmentation are Class DependentRandall Balestriero, Léon Bottou, Yann LeCunNeurIPS 2022 · 124 citations
- AutoBalance: Optimized Loss Functions for Imbalanced DataMingchen Li, Xuechen Zhang, Christos Thrampoulidis, Jiasi Chen et al.NeurIPS 2021 · 89 citations
- Lossy Compression for Lossless PredictionYann Dubois, Benjamin Bloem-Reddy, Karen Ullrich, Chris J. MaddisonNeurIPS 2021 · 82 citations
Builds on5
- Random Erasing Data AugmentationZhun Zhong, Liang Zheng, Guoliang Kang, Shaozi Li et al.AAAI 2020 · 4,134 citations
- Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networksZiwei Ji, Matus TelgarskyICLR 2020 · 193 citations
- Equivariant Multi-View NetworksCarlos Esteves, Yinshuang Xu, Christine Allen-Blanchette, Kostas DaniilidisICCV 2019 · 108 citations
- Bad Global Minima Exist and SGD Can Reach ThemShengchao Liu, Dimitris S. Papailiopoulos, Dimitris AchlioptasNeurIPS 2020 · 89 citations
- How Much Over-parameterization Is Sufficient to Learn Deep ReLU Networks?Zixiang Chen, Yuan Cao, Difan Zou, Quanquan GuICLR 2021 · 29 citations
Related papers
- Learning Invariances in Neural Networks from Training DataGregory W. Benton, Marc Finzi, Pavel Izmailov, Andrew Gordon WilsonNeurIPS 2020 · 78 citations
- Invariance Learning in Deep Neural Networks with Differentiable Laplace ApproximationsAlexander Immer, Tycho F. A. van der Ouderaa, Gunnar Rätsch, Vincent Fortuin et al.NeurIPS 2022 · 56 citations
- Symmetries in Overparametrized Neural Networks: A Mean Field ViewJavier Maass Martínez, Joaquín FontbonaNeurIPS 2024 · 4 citations
- Diagonal Symmetrization of Neural Network Solvers for the Many-Electron Schrödinger EquationKevin Han Huang, Ni Zhan, Elif Ertekin, Peter Orbanz et al.ICML 2025
- Generalizing Convolutional Neural Networks for Equivariance to Lie Groups on Arbitrary Continuous DataMarc Finzi, Samuel Stanton, Pavel Izmailov, Andrew Gordon WilsonICML 2020 · 372 citations
