Data augmentation doesn't improve robustness, contrary to belief.
problem The effectiveness of data augmentation in improving model robustness is questioned.
method Taking a Domain Generalization viewpoint, the study examines the robustness of augmented representations.
result Augmented representations are not robust to distortions used during training.
This work investigates image augmentations for GAN training, improving image quality.
problem Improving the accuracy and robustness of GAN models for image synthesis.
method Systematic study of various image augmentation techniques for GAN training.
result Vanilla GANs can achieve state-of-the-art generation quality with image augmentations.
Automatically learns optimal data augmentation for image classification.
problem Finding optimal data augmentation hyperparameters is computationally demanding and requires domain knowledge.
method Proposes an online bilevel optimization framework to learn data augmentation parameters directly.
result Jointly trained method achieves comparable or better classification accuracy than hand-crafted data augmentation without an external validation loop.
Data augmentation has been widely applied as an effective methodology to improve generalization in particular when training deep neural networks. Recently, researchers proposed a few intensive data augmentation techniques, which indeed improved accuracy, yet we notice that these methods augment data have also caused a …
Expert augmentation improves hybrid model generalization.
problem Limited generalization of hybrid models outside training distribution.
method Introducing expert augmentation to improve hybrid model performance.
result Expert augmentation improves generalization of hybrid models.
WeMix improves data augmentation by correcting bias in deep learning.
problem Data augmentation's effectiveness is limited by data bias.
method Developed AugDrop and MixLoss algorithms to correct data bias.
result WeMix improves data augmentation performance through bias correction.
Study fully augmented links in thickened torus, generalizing S3 results.
problem Classify and describe geometric properties of fully augmented links in thickened torus.
method Geometric analysis and decomposition of link complements into ideal right-angled torihedra.
result Proves Volume Density Conjecture for fully augmented links in thickened torus.
A key challenge in leveraging data augmentation for neural network training is choosing an effective augmentation policy from a large search space of candidate operations. Properly chosen augmentation policies can lead to significant generalization improvements; however, state-of-the-art approaches such as AutoAugment …
Data augmentation can achieve the same statistical benefits as full augmentation up to an approximation error.
problem Data augmentation in learning problems
method Using Fourier analysis and representation theory of finite groups
result Partial data augmentation achieves the same minimax rates as full augmentation
Augmentation improves machine learning model performance on small datasets.
problem Suboptimal generalization performance of machine learning models on small datasets.
method Data augmentation to increase sample size and diversity.
result Augmentation improves AUC by 15.55% on average for small datasets.
We describe a correspondence between augmentations and certain representations of the knot group. The correspondence makes the 2-variable augmentation polynomial into a generalization of the classical A-polynomial. It also associates to an augmentation a rank, which is bounded by the bridge number and shares its beha…
Aug-Gen improves music generation by augmenting training data with model-produced examples.
problem Lack of high-quality training data for specific musical styles.
method Dataset augmentation using generated examples during training.
result Aug-Gen improves both training duration and quality of generated music.
New framework explains data augmentation's role in machine learning.
problem Understanding how data augmentation affects generalization and invariance learning.
method Information-theoretic framework based on mutual information bounds and orbit-averaged loss functions.
result Derives a new generalization bound decomposing the generalization gap into three interpretable terms.
A recurring problem faced when training neural networks is that there is typically not enough data to maximize the generalization capability of deep neural networks(DNN). There are many techniques to address this, including data augmentation, dropout, and transfer learning. In this paper, we introduce an additional met…
This paper proposes synthetic augmentation for nuclei image segmentation in medical pathology.
problem Rare and time-consuming labeling of tumor nuclei images for semantic segmentation.
method Label-to-image translation to generate synthetic images.
result Synthetic augmentation improves segmentation accuracy.
Though data augmentation has become a standard component of deep neural network training, the underlying mechanism behind the effectiveness of these techniques remains poorly understood. In practice, augmentation policies are often chosen using heuristics of either distribution shift or augmentation diversity. Inspired…
Large-batch SGD is important for scaling training of deep neural networks. However, without fine-tuning hyperparameter schedules, the generalization of the model may be hampered. We propose to use batch augmentation: replicating instances of samples within the same batch with different data augmentations. Batch augment…
New framework explains diverse impacts of data augmentation.
problem Understanding the varied effects of data augmentation on model performance.
method Developed a theoretical framework to characterize DA's impact on linear models.
result Data augmentation induces implicit spectral regularization through two effects.
Graph Neural Networks struggle with generalization, especially OOD data; GRATIN solves this with Gaussian Mixture Model-based augmentation.
problem Graph Neural Networks struggle with generalization, particularly to unseen or out-of-distribution data.
method Theoretical framework using Rademacher complexity to compute a regret bound on generalization error. GRATIN algorithm leveraging Gaussian Mixture Models for efficient data augmentation.
result GRATIN outperforms existing augmentation techniques in terms of generalization and offers improved time complexity.
VFlow enhances generative flows by augmenting data dimensions for better expressiveness.
problem Tractable generative flows have limited expressiveness due to fixed intermediate dimensions.
method Augment data with extra dimensions and learn a generative flow for both original and augmented data using variational inference.
result VFlow achieves state-of-the-art performance on CIFAR-10 with improved compactness.
This paper tackles confounding biases in data augmentation.
problem Mitigating spurious correlations and confounding variables in training data.
method Formal analysis and counterfactual data augmentation.
result Removing confounding biases leads to invariant features and better generalization.
Survey of data augmentation techniques for time series classification with neural networks.
problem Small datasets in time series recognition.
method Four families of data augmentation: transformation-based, pattern mixing, generative models, and decomposition methods.
result Empirical evaluation of 12 data augmentation methods on 128 datasets.
Augments graph node features to improve GNN performance.
problem Improving graph neural networks' performance on large-scale datasets.
method Iteratively augments node features with gradient-based adversarial perturbations.
result Boosts model performance in node classification, link prediction, and graph classification tasks.
Online data augmentation improves forecasting performance in deep learning.
problem Insufficient training data for forecasting tasks.
method An online data augmentation framework that generates synthetic samples during training.
result Online data augmentation leads to better forecasting performance.
Paper proposes SiSTA for single-shot domain adaptation using target-aware generative augmentation.
problem Adapting models from source to target domains with limited target data.
method Fine-tunes a generative model on a single-shot target and uses novel sampling strategies for synthetic data.
result Improves performance by up to 20% over existing baselines in face attribute detection.
PiNGDA learns beneficial noise for graph augmentation stability.
problem Challenges in generating effective and stable graph augmentations.
method PiNGDA uses positive-incentive noise to scientifically analyze and generate beneficial graph augmentations.
result PiNGDA improves GCL performance by learning beneficial noise on graph topology and attributes.
The paper explains how data augmentation can improve domain generalization by weakening spurious correlations.
problem Machine learning models trained with observational data fail to generalize to unseen domains due to spurious correlations.
method Developed a causal perspective to explain the success of data augmentation and derived an algorithm to select effective augmentation techniques.
result Data augmentation can be used to simulate interventional data, leading to better domain generalization.
This paper studies the problem of learning with augmented classes (LAC), where augmented classes unobserved in the training data might emerge in the testing phase. Previous studies generally attempt to discover augmented classes by exploiting geometric properties, achieving inspiring empirical performance yet lacking t…
This work analyzes the role of data augmentation in self-supervised learning using RKHS approximation and regression.
problem Limited theoretical understanding of the role of data augmentation in self-supervised learning.
method Geometric characterization of the target function given by augmentation, proving generalization bounds.
result Two generalization bounds are derived, one free of model complexity, the other specific to near-optimal encoders.
New findings on hyperbolicity of augmented links in thickened surfaces.
problem Proving hyperbolicity of links in thickened surfaces.
method Extending hyperbolicity results to generalized augmented cellular alternating links.
result Generalized augmented cellular alternating links in thickened surfaces are hyperbolic.
This work analyzes benefits and limitations of data augmentation and feature averaging in deep learning models.
problem Theoretical understanding of incorporating invariance into deep learning models is lacking.
method Data augmentation and feature averaging are analyzed in the context of invariance in deep learning.
result Training with data augmentation leads to better estimates of risk and gradients, and feature averaging reduces generalization error with convex losses.
This work characterizes how data augmentation shapes neural representations.
problem Understanding the impact of data augmentation on neural network representations.
method Embedding neural network hidden representations into a metric space invariant to transformations, analyzing shape-space trajectories.
result Increasing data augmentation strength leads to well-behaved trajectories in the embedded space, and different augmentation types steer representations in distinct directions.
Unified theory explains how data augmentation improves deep learning models.
problem Understanding why data augmentation improves model generalization.
method Unified theoretical framework explaining two key effects: partial semantic feature removal and feature mixing.
result Data augmentation enhances generalization through partial semantic feature removal and feature mixing.
Counterfactual data augmentations may not ensure OOD robustness if performed by a context-guessing machine.
problem Deep learning models lack out-of-distribution robustness due to reliance on spurious features.
method Theoretical analysis and demonstration of counterfactual data augmentations performed by a context-guessing machine.
result Counterfactual data augmentations by a context-guessing machine do not lead to robust OOD classifiers.
The paper explains how data augmentation improves semi-supervised learning efficiency.
problem Improving accuracy from a small fraction of labeled data.
method Data augmentation induces a similarity graph, which is graph-Laplacian-regularized for downstream learning.
result A fast transductive rate of O(1/nL) is achieved, reducing the number of labels needed. PANDA augments data to regularize GLM estimation and inference.
problem Regularizing estimation and inference in GLMs with noisy data.
method Iteratively optimizes augmented noise data to converge to regularized model estimates.
result Established convergence and asymptotic distributions for regularized parameters.
Exemplar VAEs link generative models with nearest neighbor retrieval and data augmentation.
problem Improving generative model performance and data augmentation effectiveness.
method Exemplar VAEs with Parzen window prior, retrieval augmented training, exemplar leave-one-out, and subsampling.
result Generative data augmentation reduces classification error on MNIST and Fashion MNIST.
Effective training of neural networks requires much data. In the low-data regime, parameters are underdetermined, and learnt networks generalise poorly. Data Augmentation alleviates this by using existing data more effectively. However standard data augmentation produces only limited plausible alternative data. Given t…
Generalizes fully augmented links to doubled 3-manifolds with geometric bounds.
problem Understanding the geometry of fully augmented links in doubled 3-manifolds.
method Constructing fully augmented links on the reflection surface of doubled 3-manifolds and finding bounds on cusp shapes and volumes.
result Bounds on cusp shapes and volumes of hyperbolic links in doubled 3-manifolds.
Generative data augmentation boosts learning performance in various tasks.
problem Theoretical understanding of generative data augmentation's effect.
method Established a stability bound for non-i.i.d. settings, analyzed Gaussian mixture models and generative adversarial nets.
result Generative data augmentation can improve learning guarantees, especially in small train sets.
LcGAN generates synthetic CT images for hemorrhagic lesion segmentation.
problem Scarce training data for hemorrhagic lesion segmentation.
method Lesion conditional Generative Adversarial Network (LcGAN) for synthetic image generation.
result Segmentation improved by 12.8% with synthetic data augmentation.
Associated to Legendrian links in the standard contact three-space, Ruling polynomials are Legendrian isotopy invariants, which also compute augmentation numbers, that is, the points-counting of augmentation varieties for Legendrian links (up to a normalized factor) \cite{HR15}. In this article, we generalize this pict…
Augmented alternating links are links obtained by adding trivial components that bound twice-punctured disks to non-split reduced non-2-braid prime alternating projections. These links are known to be hyperbolic. Here, we extend to show that generalized augmented alternating links, which allow for new trivial component…
Develops a statistical framework for self-supervised representation learning using data augmentation.
problem Lack of theoretical understanding of data augmentation in nonlinear settings.
method Augmentation invariant manifold learning framework and stochastic optimization algorithm.
result Improves downstream analysis by exploiting manifold's geometric structure and invariant property of augmented data.
Data augmentation impacts adversarial risk; careful application recommended.
problem Understanding how data augmentation affects adversarial risk in deep learning.
method Empirical analysis using three measures of adversarial risk.
result Data augmentation does not always improve adversarial risk; augmented data influences models more.
In this article, associated to a (bordered) Legendrian graph, we study and show the equivalence between two categorical Legendrian isotopy invariants: the augmentation category, a unital A∞-category, which lifts the set of augmentations of the associated Chekanov-Eliashberg DGA, and a DG category of construct…
Synthetic augmentation helps but not always in imbalanced learning.
problem Imbalanced learning causes poor performance on rare classes.
method Developed a statistical framework for synthetic augmentation in imbalanced learning.
result Synthetic augmentation is not always beneficial and depends on the imbalance regime.
Bayesian model selection optimizes data augmentation for improved machine learning robustness.
problem Choosing optimal data augmentation parameters is challenging and often done through trial and error.
method Interprets augmentation parameters as model hyperparameters and uses Bayesian model selection to optimize them.
result Our approach improves calibration and robust performance on various tasks.