Sample-aware RandAugment: Search-free Automatic Data Augmentation for Effective Image Recognition
Anqi Xiao, and Weichen Yu, and Hongyuan Yu

TL;DR
Sample-aware RandAugment (SRA) introduces a simple, search-free data augmentation method that dynamically adapts to individual samples, improving image recognition accuracy and compatibility across tasks without extensive tuning.
Contribution
SRA is a novel, search-free AutoDA approach that uses a heuristic scoring module and asymmetric augmentation to enhance performance and practicality.
Findings
Achieves 78.31% Top-1 accuracy on ImageNet with ResNet-50.
Narrowed performance gap between search-based and search-free AutoDA methods.
Demonstrates strong generalization and compatibility across tasks.
Abstract
Automatic data augmentation (AutoDA) plays an important role in enhancing the generalization of neural networks. However, mainstream AutoDA methods often encounter two challenges: either the search process is excessively time-consuming, hindering practical application, or the performance is suboptimal due to insufficient policy adaptation during training. To address these issues, we propose Sample-aware RandAugment (SRA), an asymmetric, search-free AutoDA method that dynamically adjusts augmentation policies while maintaining straightforward implementation. SRA incorporates a heuristic scoring module that evaluates the complexity of the original training data, enabling the application of tailored augmentations for each sample. Additionally, an asymmetric augmentation strategy is employed to maximize the potential of this scoring module. In multiple experimental settings, SRA narrows the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
