Adversarial AutoAugment
Xinyu Zhang, Qiang Wang, Jian Zhang, Zhao Zhong
Abstract
Data augmentation (DA) has been widely utilized to improve generalization in training deep neural networks. Recently, human-designed data augmentation has been gradually replaced by automatically learned augmentation policy. Through finding the best policy in well-designed search space of data augmentation, Au-toAugment (Cubuk et al., 2018) can significantly improve validation accuracy on image classification tasks. However, this approach is not computationally practical for large-scale problems. In this paper, we develop an adversarial method to arrive at a computationally-affordable solution called Adversarial AutoAugment, which can simultaneously optimize target related object and augmentation policy search loss. The augmentation policy network attempts to increase the training loss of a target network through generating adversarial augmentation policies, while the target network can learn more robust features from harder examples to improve the generalization. In contrast to prior work, we reuse the computation in target network training for policy evaluation, and dispense with the retraining of the target network. Compared to AutoAugment, this leads to about 12× reduction in computing cost and 11× shortening in time overhead on ImageNet. We show experimental results of our approach on CIFAR-10/CIFAR-100, ImageNet, and demonstrate significant performance improvements over state-of-the-art. On CIFAR-10, we achieve a top-1 test error of 1.36%, which is the currently best performing single model. On ImageNet, we achieve a leading performance of top-1 accuracy 79.40% on ResNet-50 and 80.00% on ResNet-50-D without extra data.
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 91d76428-b5b6-4436-8d01-37714ba8782fCited by top-tier papers19
- TrivialAugment: Tuning-free Yet State-of-the-Art Data AugmentationSamuel G. Müller, Frank HutterICCV 2021 · 384 citations
- LAS-AT: Adversarial Training with Learnable Attack StrategyXiaojun Jia, Yong Zhang, Baoyuan Wu, Ke Ma et al.CVPR 2022 · 140 citations
- Enhance the Visual Representation via Discrete Adversarial TrainingXiaofeng Mao, Yuefeng Chen, Ranjie Duan, Yao Zhu et al.NeurIPS 2022 · 48 citations
- MetaAugment: Sample-Aware Data Augmentation Policy LearningFengwei Zhou, Jiawei Li, Chuanlong Xie, Fei Chen et al.AAAI 2021 · 35 citations
- AutoLoss-GMS: Searching Generalized Margin-based Softmax Loss Function for Person Re-identificationHongyang Gu, Jianmin Li, Guangyuan Fu, Chifong Wong et al.CVPR 2022 · 33 citations
Builds on1
Related papers
- RandAugment: Practical Automated Data Augmentation with a Reduced Search SpaceEkin Dogus Cubuk, Barret Zoph, Jonathon Shlens, Quoc LeNeurIPS 2020 · 4,453 citations
- AdaAug: Learning Class- and Instance-adaptive Data Augmentation PoliciesTsz-Him Cheung, Dit-Yan YeungICLR 2022 · 31 citations
- TeachAugment: Data Augmentation Optimization Using Teacher KnowledgeTeppei SuzukiCVPR 2022 · 57 citations
- Adversarial AutoMixupHuafeng Qin, Xin Jin, Yun Jiang, Mounîm A. El-Yacoubi et al.ICLR 2024 · 19 citations
- When to Learn What: Model-Adaptive Data Augmentation CurriculumChengkai Hou, Jieyu Zhang, Tianyi ZhouICCV 2023 · 25 citations
