LA3: Efficient Label-Aware AutoAugment

Mingjun Zhao, Shan Lu, Zixuan Wang, Xiaoli Wang, Di Niu
4/20/2023
cs.CVcs.AI

No official code found. Best implementation: Simpleple/LA3-Label-Aware-AutoAugment (4 stars, last commit 2022-07-16).

Abstract

Automated augmentation is an emerging and effective technique to search for data augmentation policies to improve generalizability of deep neural network training. Most existing work focuses on constructing a unified policy applicable to all data samples in a given dataset, without considering sample or class variations. In this paper, we propose a novel two-stage data augmentation algorithm, named Label-Aware AutoAugment (LA3), which takes advantage of the label information, and learns augmentation policies separately for samples of different labels. LA3 consists of two learning stages, where in the first stage, individual augmentation methods are evaluated and ranked for each label via Bayesian Optimization aided by a neural predictor, which allows us to identify effective augmentation techniques for each label under a low search cost. And in the second stage, a composite augmentation policy is constructed out of a selection of effective as well as complementary augmentations, which produces significant performance boost and can be easily deployed in typical model training. Extensive experiments demonstrate that LA3 achieves excellent performance matching or surpassing existing methods on CIFAR-10 and CIFAR-100, and achieves a new state-of-the-art ImageNet accuracy of 79.97% on ResNet-50 among auto-augmentation methods, while maintaining a low computational cost.

View on arXivView PDF

Code Implementations(1)

41PythonJul 16, 20224 years ago

Similar Papers

Cite this paper

@article{zhao2023la,
  title  = {LA3: Efficient Label-Aware AutoAugment},
  author = {Mingjun Zhao and Shan Lu and Zixuan Wang and Xiaoli Wang and Di Niu},
  year   = {2023},
  eprint = {2304.10310},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.10310v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.10310.svg)](https://codeofpaper.com/paper/2304.10310)

Discussion