mlsanityData to 7 Oct 2026

SAGE: Saliency-Guided Mixup with Optimal Rearrangements

arXiv 2211.00113 ↗First posted 31 Oct 2022cs.LG cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

Data augmentation is a key element for training accurate models by reducing overfitting and improving generalization. For image classification, the most popular data augmentation techniques range from simple photometric and geometrical transformations, to more complex methods that use visual saliency to craft new training examples. As augmentation methods get more complex, their ability to increase the test accuracy improves, yet, such methods become cumbersome, inefficient and lead to poor out-of-domain generalization, as we show in this paper. This motivates a new augmentation technique that allows for high accuracy gains while being simple, efficient (i.e., minimal computation overhead) and generalizable. To this end, we introduce Saliency-Guided Mixup with Optimal Rearrangements (SAGE), which creates new training examples by rearranging and mixing image pairs using visual saliency as guidance. By explicitly leveraging saliency, SAGE promotes discriminative foreground objects and produces informative new images useful for training. We demonstrate on CIFAR-10 and CIFAR-100 that SAGE achieves better or comparable performance to the state of the art while being more efficient. Additionally, evaluations in the out-of-distribution setting, and few-shot learning on mini-ImageNet, show that SAGE achieves improved generalization performance without trading off robustness.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 21 of its 27 references that are in the map. First posted on arXiv 31 Oct 2022.

Builds on

21 of 27 references.

References · 21

  1. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  2. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  3. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  4. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  5. 2013Intriguing properties of neural networkscited by 5,114
  6. 2016Wide Residual Networkscited by 3,057
  7. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
  8. 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,540
  9. 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
  10. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
  11. 2016Matching Networks for One Shot Learningcited by 2,246
  12. 2016Identity Mappings in Deep Residual Networkscited by 1,960
9 more
  1. 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
  2. 2020RobustBench: a standardized adversarial robustness benchmarkcited by 659
  3. 2020Simple Copy-Paste is a Strong Data Augmentation Method for Instance Segmentationcited by 595
  4. 2020Puzzle Mix: Exploiting Saliency and Local Statistics for Optimal Mixupcited by 260
  5. 2020SaliencyMix: A Saliency Guided Data Augmentation Strategy for Better Regularizationcited by 149
  6. 2021Co-Mixup: Saliency Guided Joint Mixup with Supermodular Diversitycited by 127
  7. 2019InstaBoost: Boosting Instance Segmentation via Probability Map Guided Copy-Pastingcited by 95
  8. 2019Diversity with Cooperation: Ensemble Methods for Few-Shot Classificationcited by 70
  9. 2020KeepAugment: A Simple Information-Preserving Data Augmentation Approachcited by 52

Built on by

Cited by year

Citing papers per year: 2023: 4; 2024: 1; 2025: 1.

6 papers.