ParticleAugment: Sampling-Based Data Augmentation
Not on the map. Why?
Abstract (arXiv)
We present an automated data augmentation approach for image classification. We formulate the problem as Monte Carlo sampling where our goal is to approximate the optimal augmentation policies. We propose a particle filtering scheme for the policy search where the probability of applying a set of augmentation operations forms the state of the filter. We measure the policy performance based on the loss function difference between a reference and the actual model, which we afterwards use to re-weight the particles and finally update the policy. In our experiments, we show that our formulation for automated augmentation reaches promising results on CIFAR-10, CIFAR-100, and ImageNet datasets using the standard network architectures for this problem. By comparing with the related work, our method reaches a balance between the computational cost of policy search and the model performance. Our code will be made publicly available.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 43 references that are in the map. First posted on arXiv 16 Jun 2021.
Builds on
29 of 43 references.
References · 29
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,829
- 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,239
- 2016Wide Residual Networkscited by 3,057
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
- 2018YOLOv3: An Incremental Improvementcited by 2,652
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
- 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
17 more
- 2018AutoAugment: Learning Augmentation Policies from Datacited by 728
- 2020Rethinking Pre-training and Self-trainingcited by 352
- 2017Data Augmentation Generative Adversarial Networkscited by 278
- 2019Fast AutoAugmentcited by 243
- 2020Neural Architecture Search without Trainingcited by 241
- 2019Population Based Augmentation: Efficient Learning of Augmentation Policy Schedulescited by 153
- 2019Adversarial AutoAugmentcited by 111
- 2019Faster AutoAugment: Learning Augmentation Strategies using Backpropagationcited by 96
- 2017Learning to Compose Domain-Specific Transformations for Data Augmentationcited by 91
- 2017Shake-Shake regularizationcited by 87
- 2019Online Hyper-parameter Learning for Auto-Augmentation Strategycited by 38
- 2020Circumventing Outliers of AutoAugment with Knowledge Distillationcited by 29
- 2020Improving Auto-Augment via Augmentation-Wise Weight Sharingcited by 28
- 2016RenderGAN: Generating Realistic Labeled Datacited by 20
- 2017Data Augmentation in Emotion Classification Using Generative Adversarial Networkscited by 19
- 2020Few-Shot Microscopy Image Cell Segmentationcited by 11
- 2020Joint Detection and Tracking in Videos with Identification Featurescited by 4
Built on by
Citing papers per year: 2025: 1.
1 paper.