ReSmooth: Detecting and Utilizing OOD Samples when Training with Data Augmentation
Not on the map. Why?
Abstract (arXiv)
Data augmentation (DA) is a widely used technique for enhancing the training of deep neural networks. Recent DA techniques which achieve state-of-the-art performance always meet the need for diversity in augmented training samples. However, an augmentation strategy that has a high diversity usually introduces out-of-distribution (OOD) augmented samples and these samples consequently impair the performance. To alleviate this issue, we propose ReSmooth, a framework that firstly detects OOD samples in augmented samples and then leverages them. To be specific, we first use a Gaussian mixture model to fit the loss distribution of both the original and augmented samples and accordingly split these samples into in-distribution (ID) samples and OOD samples. Then we start a new training where ID and OOD samples are incorporated with different smooth labels. By treating ID samples and OOD samples unequally, we can make better use of the diverse augmented data. Further, we incorporate our ReSmooth framework with negative data augmentation strategies. By properly handling their intentionally created OOD samples, the classification performance of negative data augmentations is largely ameliorated. Experiments on several classification benchmarks show that ReSmooth can be easily extended to existing augmentation strategies (such as RandAugment, rotate, and jigsaw) and improve on them. Our code is available at https://github.com/Chenyang4/ReSmooth.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 40 of its 54 references that are in the map. First posted on arXiv 25 May 2022.
Builds on
40 of 54 references.
References · 40
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2016Wide Residual Networkscited by 3,070
- 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,385
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,269
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,085
- 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,628
- 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,591
- 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,485
- 2016Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzlescited by 1,382
- 2020Energy-based Out-of-distribution Detectioncited by 1,299
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
28 more
- 2019When Does Label Smoothing Help?cited by 988
- 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 901
- 2021Generalized Out-of-Distribution Detection: A Surveycited by 802
- 2018AutoAugment: Learning Augmentation Policies from Datacited by 730
- 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 692
- 2018Invariant Information Clustering for Unsupervised Image Classification and Segmentationcited by 455
- 2020SCAN: Learning to Classify Images without Labelscited by 352
- 2019Unsupervised Label Noise Modeling and Loss Correctioncited by 328
- 2020Combating noisy labels by agreement: A joint training method with co-regularizationcited by 289
- 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 261
- 2019Fast AutoAugmentcited by 243
- 2017Decoupling "when to update" from "how to update"cited by 230
- 2019What Do Compressed Deep Neural Networks Forget?cited by 171
- 2019Population Based Augmentation: Efficient Learning of Augmentation Policy Schedulescited by 154
- 2020On Robustness and Transferability of Convolutional Neural Networkscited by 98
- 2019Faster AutoAugment: Learning Augmentation Strategies using Backpropagationcited by 96
- 2019InstaBoost: Boosting Instance Segmentation via Probability Map Guided Copy-Pastingcited by 95
- 2017Learning to Compose Domain-Specific Transformations for Data Augmentationcited by 91
- 2020KeepAugment: A Simple Information-Preserving Data Augmentation Approachcited by 52
- 2021Self-Damaging Contrastive Learningcited by 48
- 2021Negative Data Augmentationcited by 46
- 2020Affinity and Diversity: Quantifying Mechanisms of Data Augmentationcited by 45
- 2022TeachAugment: Data Augmentation Optimization Using Teacher Knowledgecited by 37
- 2020Circumventing Outliers of AutoAugment with Knowledge Distillationcited by 29
- 2021Seeking the Shape of Sound: An Adaptive Framework for Learning Voice-Face Associationcited by 21
- 2021Reweighting Augmented Samples by Minimizing the Maximal Expected Losscited by 21
- 2021AutoDO: Robust AutoAugment for Biased Data with Label Noise via Scalable Probabilistic Implicit Differentiationcited by 14
- 2020Does Data Augmentation Benefit from Split BatchNormscited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 2.
3 papers.