mlsanityData to 14 Oct 2026

Dealing with the Evil Twins: Improving Random Augmentation by Addressing Catastrophic Forgetting of Diverse Augmentations

arXiv 2506.08240 ↗First posted 9 Jun 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Data augmentation is a promising tool for enhancing out-of-distribution generalization, where the key is to produce diverse, challenging variations of the source domain via costly targeted augmentations that maximize its generalization effect. Conversely, random augmentation is inexpensive but is deemed suboptimal due to its limited effect. In this paper, we revisit random augmentation and explore methods to address its shortcomings. We show that the stochastic nature of random augmentation can produce a set of colliding augmentations that distorts the learned features, similar to catastrophic forgetting. We propose a simple solution that improves the generalization effect of random augmentation by addressing forgetting, which displays strong generalization performance across various single source domain generalization (sDG) benchmarks.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 38 of its 50 references that are in the map. First posted on arXiv 9 Jun 2025.

Builds on

38 of 50 references.

References · 38

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  3. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  4. 2015Domain-Adversarial Training of Neural Networkscited by 3,044
  5. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,269
  6. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  7. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  8. 2019Similarity of Neural Network Representations Revisitedcited by 1,755
  9. 2020Gradient Surgery for Multi-Task Learningcited by 1,256
  10. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  11. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
  12. 2018Experience Replay for Continual Learningcited by 1,095
26 more
  1. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  2. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
  3. 2018AutoAugment: Learning Augmentation Policies from Datacited by 730
  4. 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 722
  5. 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
  6. 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
  7. 2020Learning to Learn Single Domain Generalizationcited by 296
  8. 2022FOSTER: Feature Boosting and Compression for Class-Incremental Learningcited by 229
  9. 2020Just Pick a Sign: Optimizing Deep Multitask Models with Gradient Sign Dropoutcited by 201
  10. 2021Learning to Diversify for Single Domain Generalizationcited by 170
  11. 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
  12. 2020Domain Generalization for Medical Imaging Classification with Linear-Dependency Regularizationcited by 123
  13. 2020Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustnesscited by 121
  14. 2021Progressive Domain Expansion Network for Single Domain Generalizationcited by 97
  15. 2021Adversarially Adaptive Normalization for Single Domain Generalizationcited by 85
  16. 2019Complementary Learning for Overcoming Catastrophic Forgetting Using Experience Replaycited by 51
  17. 2023Weighted Ensemble Models Are Strong Continual Learnerscited by 42
  18. 2022How Much Data Are Augmentations Worth? An Investigation into Scaling Laws, Invariance, and Implicit Regularizationcited by 40
  19. 2023Continual Learning with Scaled Gradient Projectioncited by 34
  20. 2019Data Augmentation Revisited: Rethinking the Distribution Gap between Clean and Augmented Datacited by 33
  21. 2023AdvST: Revisiting Data Augmentations for Single Domain Generalizationcited by 16
  22. 2024Continual Learning with Weight Interpolationcited by 13
  23. 2025PEER pressure: Model-to-Model Regularization for Single Source Domain Generalizationcited by 7
  24. 2023Domain Generalization by Rejecting Extreme Augmentationscited by 5
  25. 2024Crafting Distribution Shifts for Validation and Training in Single Source Domain Generalizationcited by 4
  26. 2023Out-of-distribution forgetting: vulnerability of continual learning to intra-class distribution shiftcited by 3

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.