mlsanityData to 7 Oct 2026

Adversarial Unlearning: Reducing Confidence Along Adversarial Directions

arXiv 2206.01367 ↗First posted 3 Jun 2022cs.LG cs.CRcited by 14

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

Supervised learning methods trained with maximum likelihood objectives often overfit on training data. Most regularizers that prevent overfitting look to increase confidence on additional examples (e.g., data augmentation, adversarial training), or reduce it on training data (e.g., label smoothing). In this work we propose a complementary regularization strategy that reduces confidence on self-generated examples. The method, which we call RCAD (Reducing Confidence along Adversarial Directions), aims to reduce confidence on out-of-distribution examples lying along directions adversarially chosen to increase training loss. In contrast to adversarial training, RCAD does not try to robustify the model to output the original label, but rather regularizes it to have reduced confidence on points generated using much larger perturbations than in conventional adversarial training. RCAD can be easily integrated into training pipelines with a few lines of code. Despite its simplicity, we find on many classification benchmarks that RCAD can be added to existing techniques (e.g., label smoothing, MixUp training) to increase test accuracy by 1-3% in absolute value, with more significant gains in the low data regime. We also provide a theoretical analysis that helps to explain these benefits in simplified settings, showing that RCAD can provably help the model unlearn spurious features in the training data.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 45 of its 72 references that are in the map. First posted on arXiv 3 Jun 2022.

Builds on

45 of 72 references.

References · 45

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  3. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  4. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
  5. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  6. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  7. 2016Wide Residual Networkscited by 3,057
  8. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  9. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
  10. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  11. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  12. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
33 more
  1. 2019Invariant Risk Minimizationcited by 1,832
  2. 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
  3. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
  4. 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
  5. 2019When Does Label Smoothing Help?cited by 985
  6. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
  7. 2016Adversarial Machine Learning at Scalecited by 934
  8. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 918
  9. 2018Robustness May Be at Odds with Accuracycited by 873
  10. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
  11. 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
  12. 2015Causal inference using invariant prediction: identification and confidence intervalscited by 533
  13. 2017Regularizing Neural Networks by Penalizing Confident Output Distributionscited by 461
  14. 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
  15. 2019On Evaluating Adversarial Robustnesscited by 442
  16. 2019Your Classifier is Secretly an Energy Based Model and You Should Treat it Like Onecited by 402
  17. 2019Why gradient clipping accelerates training: A theoretical justification for adaptivitycited by 335
  18. 2019Semi-supervised Domain Adaptation via Minimax Entropycited by 333
  19. 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
  20. 2019Uniform convergence may be unable to explain generalization in deep learningcited by 223
  21. 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 221
  22. 2019SGD on Neural Networks Learns Functions of Increasing Complexitycited by 203
  23. 2020Understanding and Mitigating the Tradeoff Between Robustness and Accuracycited by 148
  24. 2019Adversarial Training Can Hurt Generalizationcited by 131
  25. 2020Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustnesscited by 121
  26. 2021Salient ImageNet: How to discover spurious features in Deep Learning?cited by 114
  27. 2016Semi-Supervised Learning with Generative Adversarial Networkscited by 103
  28. 2014Optimizing the CVaR via Samplingcited by 98
  29. 2020Self-training Avoids Using Spurious Features Under Domain Shiftcited by 69
  30. 2018Maximum-Entropy Fine-Grained Classificationcited by 64
  31. 2015Adversarial Manipulation of Deep Representationscited by 56
  32. 2021Robustness and Generalization via Generative Adversarial Trainingcited by 20
  33. 2021Training on Test Data with Bayesian Adaptation for Covariate Shiftcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 7; 2024: 2; 2025: 3; 2026: 1.

14 papers.

Sort:

By area: