mlsanityData to 7 Oct 2026

Adversarial Examples can be Effective Data Augmentation for Unsupervised Machine Learning

arXiv 2103.01895 ↗First posted 2 Mar 2021cs.LG cs.CVcited by 16

Not on the map. Why?

Abstract (arXiv)

Adversarial examples causing evasive predictions are widely used to evaluate and improve the robustness of machine learning models. However, current studies focus on supervised learning tasks, relying on the ground-truth data label, a targeted objective, or supervision from a trained classifier. In this paper, we propose a framework of generating adversarial examples for unsupervised models and demonstrate novel applications to data augmentation. Our framework exploits a mutual information neural estimator as an information-theoretic similarity measure to generate adversarial examples without supervision. We propose a new MinMax algorithm with provable convergence guarantees for efficient generation of unsupervised adversarial examples. Our framework can also be extended to supervised adversarial examples. When using unsupervised adversarial examples as a simple plug-in data augmentation tool for model retraining, significant improvements are consistently observed across different unsupervised tasks and datasets, including data reconstruction, representation learning, and contrastive learning. Our results show novel methods and considerable advantages in studying and improving unsupervised machine learning via adversarial examples.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 31 of its 40 references that are in the map. First posted on arXiv 2 Mar 2021.

Builds on

31 of 40 references.

References · 31

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  3. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  4. 2013Intriguing properties of neural networkscited by 5,114
  5. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  6. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
  7. 2018Demystifying MMD GANscited by 1,268
  8. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
  9. 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
  10. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 918
  11. 2016Practical Black-Box Attacks against Machine Learningcited by 893
  12. 2018Robustness May Be at Odds with Accuracycited by 873
19 more
  1. 2018MINE: Mutual Information Neural Estimationcited by 680
  2. 2017ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Modelscited by 656
  3. 2017Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methodscited by 542
  4. 2017Decision-Based Adversarial Attacks: Reliable Attacks Against Black-Box Machine Learning Modelscited by 459
  5. 2019Unlabeled Data Improves Adversarial Robustnesscited by 415
  6. 2017Wild Patterns: Ten Years After the Rise of Adversarial Machine Learningcited by 411
  7. 2015Adversarial Autoencoderscited by 359
  8. 2019S4L: Self-Supervised Semi-Supervised Learningcited by 335
  9. 2018Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approachcited by 181
  10. 2018Disentangling Adversarial Robustness and Generalizationcited by 171
  11. 2019Are Labels Required for Improving Adversarial Robustness?cited by 162
  12. 2018Is Robustness the Cost of Accuracy? -- A Comprehensive Study on the Robustness of 18 Deep Image Classification Modelscited by 135
  13. 2019Defense Against Adversarial Attacks Using Feature Scattering-based Adversarial Trainingcited by 95
  14. 2020Contrastive Learning with Adversarial Examplescited by 91
  15. 2019Concrete Autoencoders for Differentiable Feature Selection and Reconstructioncited by 90
  16. 2019Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applicationscited by 55
  17. 2020Non-convex Min-Max Optimization: Applications, Challenges, and Recent Theoretical Advancescited by 37
  18. 2020Learning Adversarially Robust Representations via Worst-Case Mutual Information Maximizationcited by 6
  19. 2018Unsupervised representation learning using convolutional and stacked auto-encoders: a domain and cross-domain feature space analysiscited by 5

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 1; 2023: 6; 2024: 6; 2025: 2.

16 papers.

Sort: