Table of Contents
Fetching ...

Gaussian and Non-Gaussian Universality of Data Augmentation

Kevin Han Huang, Peter Orbanz, Morgane Austern

TL;DR

This work establishes a universal framework for understanding data augmentation by proving that, under a noise-stability condition, augmented estimators have limiting distributions determined solely by first two moments of the augmented data, yielding Gaussian or non-Gaussian universality regimes. The theory covers a broad class of estimators, from empirical averages to ridge and ridgeless regressions, and extends to neural networks and bagging via a unified Lindeberg-type argument for block-dependent data. It reveals that augmentation can both reduce and increase variance, or shift double-descent phenomena, depending on the interaction between sample size, dimensionality, and the number of augmentations, rather than on distributional invariance alone. The results provide practical guidance for guaranteeing and quantifying uncertainty under augmentation, including explicit surrogate-based risk expressions and confidence-interval constructions. Overall, the paper clarifies when augmentation acts as a stabilizer or a destabilizer, and shows how universality can simplify the analysis of augmented learning systems across linear, high-dimensional, and nonlinear models.

Abstract

We provide universality results that quantify how data augmentation affects the variance and limiting distribution of estimates through simple surrogates, and analyze several specific models in detail. The results confirm some observations made in machine learning practice, but also lead to unexpected findings: Data augmentation may increase rather than decrease the uncertainty of estimates, such as the empirical prediction risk. It can act as a regularizer, but fails to do so in certain high-dimensional problems, and it may shift the double-descent peak of an empirical risk. Overall, the analysis shows that several properties data augmentation has been attributed with are not either true or false, but rather depend on a combination of factors -- notably the data distribution, the properties of the estimator, and the interplay of sample size, number of augmentations, and dimension. As our main theoretical tool, we develop an adaptation of Lindeberg's technique for block dependence. The resulting universality regime may be Gaussian or non-Gaussian.

Gaussian and Non-Gaussian Universality of Data Augmentation

TL;DR

This work establishes a universal framework for understanding data augmentation by proving that, under a noise-stability condition, augmented estimators have limiting distributions determined solely by first two moments of the augmented data, yielding Gaussian or non-Gaussian universality regimes. The theory covers a broad class of estimators, from empirical averages to ridge and ridgeless regressions, and extends to neural networks and bagging via a unified Lindeberg-type argument for block-dependent data. It reveals that augmentation can both reduce and increase variance, or shift double-descent phenomena, depending on the interaction between sample size, dimensionality, and the number of augmentations, rather than on distributional invariance alone. The results provide practical guidance for guaranteeing and quantifying uncertainty under augmentation, including explicit surrogate-based risk expressions and confidence-interval constructions. Overall, the paper clarifies when augmentation acts as a stabilizer or a destabilizer, and shows how universality can simplify the analysis of augmented learning systems across linear, high-dimensional, and nonlinear models.

Abstract

We provide universality results that quantify how data augmentation affects the variance and limiting distribution of estimates through simple surrogates, and analyze several specific models in detail. The results confirm some observations made in machine learning practice, but also lead to unexpected findings: Data augmentation may increase rather than decrease the uncertainty of estimates, such as the empirical prediction risk. It can act as a regularizer, but fails to do so in certain high-dimensional problems, and it may shift the double-descent peak of an empirical risk. Overall, the analysis shows that several properties data augmentation has been attributed with are not either true or false, but rather depend on a combination of factors -- notably the data distribution, the properties of the estimator, and the interplay of sample size, number of augmentations, and dimension. As our main theoretical tool, we develop an adaptation of Lindeberg's technique for block dependence. The resulting universality regime may be Gaussian or non-Gaussian.
Paper Structure (73 sections, 726 equations, 14 figures)

This paper contains 73 sections, 726 equations, 14 figures.

Figures (14)

  • Figure 1: Effect of augmentation on the variability of estimates. Left: On an empirical average. Right: On a ridge regression estimator. Each point is an estimate computed from a single simulation experiment, and the dashed lines are the 95% 2d quantiles of the empirical distribution over 1000 simulations. Augmentation reduces the variability in the left plot, but increases the uncertainty of the estimate in the right plot. See Remark \ref{['remark:ridge']} in Section \ref{['sectn:ridge_regression']} for details on the plotted experiments.
  • Figure 2: Effect of an oracle choice of augmentation on the limiting risk of a high-dimensional ridgeless regressor under the asymptotic $d/n \rightarrow \gamma$. A regularization effect is observed around $\gamma = 1$, whereas a new double-descent peak shows up at $\gamma = 5 = k$, the number of augmentations. See \ref{['sec:triple:descent:oracle']} for the detailed setup.
  • Figure 3: Left: The standard deviation $\sqrt{V(s)} \coloneqq \sqrt{\text{\rm Var}[f_{\rm toy}(\mathcal{Z})]} = \sqrt{\text{\rm Var}[ g_{\rm toy}( s \xi + \mathbb{E}[\mathbf{X}_1])]}$ as a function of $s$. Right: The difference $D(s)$ between the $0.025$-th and the $0.975$-th quantiles for $g_{\rm toy}( s \xi + \mathbb{E}[\mathbf{X}_1])$ as a function of $s$. The functions are calculated analytically in Proposition 20. Since neither is monotonic, the parameter space contains regions where data augmentation is beneficial (green example), and where it is detrimental (red example). Notably, ${\vartheta(f)<1}$ is possible even if $\sigma$, standard deviation of the augmented average, is smaller than $\tilde{\sigma}$, standard deviation of the unaugmented average.
  • Figure 4: A simple ridge regression example, where variance of the risk is not monotonic in data variance despite invariance. Variance of $R^Z$ in Lemma \ref{['lem:ridge:toy']} is plotted as a function of the augmented covariance $\nu \coloneqq \text{\rm Cov}[(\pi_{11}\mathbf{V}_1)^2, (\pi_{12}\mathbf{V}_1)^2]$ for ${\lambda=0.1}$ and ${\mathbb{E}[\mathbf{V}_1^2]=0.1}$. As no closed-form formula is available, the plot is generated by a simulation over 10k random seeds.
  • Figure 5: Augmentation can decrease the variance of an estimator, but at the same time increase the variance of its risk: Shown are simulations for ridge regression under \ref{['eqn:ridge:toy:model']} with $\mu=0$ and varying $k$. The augmentations on each pair of $\mathbf{V}_{ij}$ and $\mathbf{Y}_{ij}$ are set to be the same, i.e. $\pi_{ij} = \tau_{ij}$. For random cropping, $n=200$ and $\Sigma = \left(10.50.51\right)$. For uniform rotations, $n=50$ and $\Sigma = \mathbf{I}_d$, $c=2$, $\lambda=9$. Top Left. Standard deviation of $(\hat{B}(\Phi\mathcal{X}))_{11}$, first coordinate of ridge regression estimate under random cropping. Top Right. Standard deviation of $R(\hat{B}(\Phi\mathcal{X}))$ under random cropping. Bottom Left. $\text{Std }(\hat{B}(\Phi\mathcal{X}))_{11}$ under uniform rotations. Bottom Right. $\text{Std } R(\hat{B}(\Phi\mathcal{X}))$ under uniform rotations.
  • ...and 9 more figures

Theorems & Definitions (42)

  • proof : Proof of \ref{['thm:main']}
  • proof : Proof of \ref{['cor:variance:convergence']}
  • proof : Proof of \ref{['cor:d_H:convergence']}
  • proof : Proof of Lemma \ref{['lem:d_H']}
  • proof
  • proof : Proof of \ref{['lem:d_H:centering']}
  • proof
  • proof
  • proof
  • proof
  • ...and 32 more