SelectAugment: Hierarchical Deterministic Sample Selection for Data Augmentation
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 SelectAugment 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.
Code (0)
등록된 구현이 없습니다.
Tasks
Data AugmentationFine-Grained Image RecognitionHierarchical Reinforcement Learningimage-classificationImage ClassificationModel OptimizationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Bayesian selection for the l2-Potts model regularization parameter: 1D piecewise constant signal denoising
Piecewise constant denoising can be solved either by deterministic optimization approaches, based on the Potts model, or by stochastic Bayesian procedures. The former lead to low computational time but require the select…
DenoisingiHAS: Instance-wise Hierarchical Architecture Search for Deep Learning Recommendation Models
Current recommender systems employ large-sized embedding tables with uniform dimensions for all features, leading to overfitting, high computational cost, and suboptimal generalizing performance. Many techniques aim to s…
Clusteringfeature selectionNeural Architecture SearchRecommendation SystemsHierarchical Reinforced Trader (HRT): A Bi-Level Approach for Optimizing Stock Selection and Execution
Leveraging Deep Reinforcement Learning (DRL) in automated stock trading has shown promising results, yet its application faces significant challenges, including the curse of dimensionality, inertia in trading actions, an…
Deep Reinforcement LearningHierarchical Reinforcement Learningreinforcement-learningReinforcement LearningMulti-group Learning for Hierarchical Groups
The multi-group learning model formalizes the learning scenario in which a single predictor must generalize well on multiple, possibly overlapping subgroups of interest. We extend the study of multi-group learning to the…
Hierarchical Ensemble-Based Feature Selection for Time Series Forecasting
We introduce a novel ensemble approach for feature selection based on hierarchical stacking for non-stationarity and/or a limited number of samples with a large number of features. Our approach exploits the co-dependency…
Feature Importancefeature selectionTime SeriesTime Series Forecasting