UniformAugment: A Search-free Probabilistic Data Augmentation Approach

• URL: http://arxiv.org/abs/2003.14348v1
• Date: Tue, 31 Mar 2020 16:32:18 GMT
• Title: UniformAugment: A Search-free Probabilistic Data Augmentation Approach
• Authors: Tom Ching LingChen, Ava Khonsari, Amirreza Lashkari, Mina Rafi Nazari, Jaspreet Singh Sambee, Mario A. Nascimento
• Abstract summary: Augmenting training datasets has been shown to improve the learning effectiveness for several computer vision tasks. Some techniques, such as AutoAugment and Fast AutoAugment, have introduced a search phase to find a set of suitable augmentation policies. We propose UniformAugment, an automated data augmentation approach that completely avoids a search phase.
• Score: 0.019573380763700708
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Augmenting training datasets has been shown to improve the learning effectiveness for several computer vision tasks. A good augmentation produces an augmented dataset that adds variability while retaining the statistical properties of the original dataset. Some techniques, such as AutoAugment and Fast AutoAugment, have introduced a search phase to find a set of suitable augmentation policies for a given model and dataset. This comes at the cost of great computational overhead, adding up to several thousand GPU hours. More recently RandAugment was proposed to substantially speedup the search phase by approximating the search space by a couple of hyperparameters, but still incurring non-negligible cost for tuning those. In this paper we show that, under the assumption that the augmentation space is approximately distribution invariant, a uniform sampling over the continuous space of augmentation transformations is sufficient to train highly effective models. Based on that result we propose UniformAugment, an automated data augmentation approach that completely avoids a search phase. In addition to discussing the theoretical underpinning supporting our approach, we also use the standard datasets, as well as established models for image classification, to show that UniformAugment's effectiveness is comparable to the aforementioned methods, while still being highly efficient by virtue of not requiring any search.

Related papers

• A Simple Background Augmentation Method for Object Detection with Diffusion Model [53.32935683257045]
  In computer vision, it is well-known that a lack of data diversity will impair model performance. We propose a simple yet effective data augmentation approach by leveraging advancements in generative models. Background augmentation, in particular, significantly improves the models' robustness and generalization capabilities.
  arXiv  Detail & Related papers  (2024-08-01T07:40:00Z)
• DualAug: Exploiting Additional Heavy Augmentation with OOD Data Rejection [77.6648187359111]
  We propose a novel data augmentation method, named textbfDualAug, to keep the augmentation in distribution as much as possible at a reasonable time and computational cost. Experiments on supervised image classification benchmarks show that DualAug improve various automated data augmentation method.
  arXiv  Detail & Related papers  (2023-10-12T08:55:10Z)
• Tied-Augment: Controlling Representation Similarity Improves Data Augmentation [18.446051824487792]
  We propose a framework called Tied-Augment to improve data augmentation in a wide range of applications. Tied-Augment can improve state-of-the-art methods from data augmentation (e.g. RandAugment, mixup), optimization (e.g. SAM), and semi-supervised learning (e.g. FixMatch)
  arXiv  Detail & Related papers  (2023-05-22T22:23:40Z)
• Time Series Contrastive Learning with Information-Aware Augmentations [57.45139904366001]
  A key component of contrastive learning is to select appropriate augmentations imposing some priors to construct feasible positive samples. How to find the desired augmentations of time series data that are meaningful for given contrastive learning tasks and datasets remains an open question. We propose a new contrastive learning approach with information-aware augmentations, InfoTS, that adaptively selects optimal augmentations for time series representation learning.
  arXiv  Detail & Related papers  (2023-03-21T15:02:50Z)
• Direct Differentiable Augmentation Search [25.177623230408656]
  We propose an efficient differentiable search algorithm called Direct Differentiable Augmentation Search (DDAS) It exploits meta-learning with one-step gradient update and continuous relaxation to the expected training loss for efficient search. Our DDAS achieves state-of-the-art performance and efficiency tradeoff while reducing the search cost dramatically.
  arXiv  Detail & Related papers  (2021-04-09T10:02:24Z)
• Scale-aware Automatic Augmentation for Object Detection [63.087930708444695]
  We propose Scale-aware AutoAug to learn data augmentation policies for object detection. In experiments, Scale-aware AutoAug yields significant and consistent improvement on various object detectors.
  arXiv  Detail & Related papers  (2021-03-31T17:11:14Z)
• Adaptive Weighting Scheme for Automatic Time-Series Data Augmentation [79.47771259100674]
  We present two sample-adaptive automatic weighting schemes for data augmentation. We validate our proposed methods on a large, noisy financial dataset and on time-series datasets from the UCR archive. On the financial dataset, we show that the methods in combination with a trading strategy lead to improvements in annualized returns of over 50$%$, and on the time-series data we outperform state-of-the-art models on over half of the datasets, and achieve similar performance in accuracy on the others.
  arXiv  Detail & Related papers  (2021-02-16T17:50:51Z)
• DecAug: Augmenting HOI Detection via Decomposition [54.65572599920679]
  Current algorithms suffer from insufficient training samples and category imbalance within datasets. We propose an efficient and effective data augmentation method called DecAug for HOI detection. Experiments show that our method brings up to 3.3 mAP and 1.6 mAP improvements on V-COCO and HICODET dataset.
  arXiv  Detail & Related papers  (2020-10-02T13:59:05Z)
• Learning Data Augmentation with Online Bilevel Optimization for Image Classification [14.488360021440448]
  We propose an efficient approach to automatically train a network that learns an effective distribution of transformations to improve its generalization. We show that our joint training method produces an image classification accuracy comparable to or better than carefully hand-crafted data augmentation.
  arXiv  Detail & Related papers  (2020-06-25T21:01:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.