MetaAugment: Sample-Aware Data Augmentation Policy Learning

Abstract

Automated data augmentation has shown superior performance in image recognition. Existing works search for dataset-level augmentation policies without considering individual sample variations, which are likely to be sub-optimal. On the other hand, learning different policies for different samples naively could greatly increase the computing cost. In this paper, we learn a sample-aware data augmentation policy efficiently by formulating it as a sample reweighting problem. Specifically, an augmentation policy network takes a transformation and the corresponding augmented image as inputs, and outputs a weight to adjust the augmented image loss computed by a task network. At training stage, the task network minimizes the weighted losses of augmented training images, while the policy network minimizes the loss of the task network on a validation set via meta-learning. We theoretically prove the convergence of the training procedure and further derive the exact convergence rate. Superior performance is achieved on widely-used benchmarks including CIFAR-10/100, Omniglot, and ImageNet.

Accepted by AAAI2021

References in corpus (13)

• Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
• mixup: Beyond Empirical Risk Minimization
• Improved Regularization of Convolutional Neural Networks with Cutout
• Wide Residual Networks
• DARTS: Differentiable Architecture Search
• Training Very Deep Networks
• Meta-SGD: Learning to Learn Quickly for Few-Shot Learning
• Shake-Shake regularization
• ShakeDrop Regularization for Deep Residual Learning
• Population Based Augmentation: Efficient Learning of Augmentation Policy Schedules
• Adversarial AutoAugment
• Learning to Teach with Dynamic Loss Functions
• Optimizing Data Usage via Differentiable Rewards