SelectAugment: Hierarchical Deterministic Sample Selection for Data Augmentation
Shiqi Lin, Zhizheng Zhang, Xin Li, Zhibo Chen
Abstract
Data augmentation (DA) has been widely investigated to facilitate model optimization in many tasks. However, in most cases, data augmentation is randomly performed for each training sample with a certain probability, which might incur content destruction and visual ambiguities. To eliminate this, in this paper, we propose an effective approach, dubbed SelectAugment, to select samples to be augmented in a deterministic and online manner based on the sample contents and the network training status. Specifically, in each batch, we first determine the augmentation ratio, and then decide whether to augment each training sample under this ratio. We model this process as a two-step Markov decision process and adopt Hierarchical Reinforcement Learning (HRL) to learn the augmentation policy. In this way, the negative effects of the randomness in selecting samples to augment can be effectively alleviated and the effectiveness of DA is improved. Extensive experiments demonstrate that our proposed Selec-tAugment can be adapted upon numerous commonly used DA methods, e.g., Mixup, Cutmix, AutoAugment, etc, and improve their performance on multiple benchmark datasets of image classification and fine-grained image recognition.
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 902fea79-0360-4791-a655-8dd6ecc1da64Cited by top-tier papers2
- Few-Shot Learning from Augmented Label-Uncertain Queries in Bongard-HOIQinqian Lei, Bo Wang, Robby T. TanAAAI 2024 · 4 citations
- When Dynamic Data Selection Meets Data Augmentation: Achieving Enhanced Training AccelerationSuorong Yang, Peng Ye, Furao Shen, Dongzhan ZhouICML 2025
Builds on7
- CutMix: Regularization Strategy to Train Strong Classifiers With Localizable FeaturesSangdoo Yun, Dongyoon Han, Sanghyuk Chun, Seong Joon Oh et al.ICCV 2019 · 5,843 citations
- RandAugment: Practical Automated Data Augmentation with a Reduced Search SpaceEkin Dogus Cubuk, Barret Zoph, Jonathon Shlens, Quoc LeNeurIPS 2020 · 4,453 citations
- Random Erasing Data AugmentationZhun Zhong, Liang Zheng, Guoliang Kang, Shaozi Li et al.AAAI 2020 · 4,134 citations
- Free Lunch for Few-shot Learning: Distribution CalibrationShuo Yang, Lu Liu, Min XuICLR 2021 · 378 citations
- Online Hyper-Parameter Learning for Auto-Augmentation StrategyChen Lin, Minghao Guo, Chuming Li, Xin Yuan et al.ICCV 2019 · 92 citations
Related papers
- Learning Sample-Specific Policies for Sequential Image AugmentationPu Li, Xiaobai Liu, Xiaohui XieACM MM 2021 · 8 citations
- GradMix: Gradient-based Selective Mixup for Robust Data Augmentation in Class-Incremental LearningMinsu Kim, Seonghyeon Hwang, Steven Euijong WhangKDD 2026 · 1 citation
- KeepAugment: A Simple Information-Preserving Data Augmentation ApproachChengyue Gong, Dilin Wang, Meng Li, Vikas Chandra et al.CVPR 2021
- Adversarial AutoMixupHuafeng Qin, Xin Jin, Yun Jiang, Mounîm A. El-Yacoubi et al.ICLR 2024 · 19 citations
- Adversarial AutoAugmentXinyu Zhang, Qiang Wang, Jian Zhang, Zhao ZhongICLR 2020 · 210 citations
