mlsanityData to 7 Oct 2026

Optimal Transport as a Defense Against Adversarial Attacks

arXiv 2102.03156 ↗First posted 5 Feb 2021cs.LG cs.CV stat.MLcited by 6

Not on the map. Why?

Abstract (arXiv)

Deep learning classifiers are now known to have flaws in the representations of their class. Adversarial attacks can find a human-imperceptible perturbation for a given image that will mislead a trained model. The most effective methods to defend against such attacks trains on generated adversarial examples to learn their distribution. Previous work aimed to align original and adversarial image representations in the same way as domain adaptation to improve robustness. Yet, they partially align the representations using approaches that do not reflect the geometry of space and distribution. In addition, it is difficult to accurately compare robustness between defended models. Until now, they have been evaluated using a fixed perturbation size. However, defended models may react differently to variations of this perturbation size. In this paper, the analogy of domain adaptation is taken a step further by exploiting optimal transport theory. We propose to use a loss between distributions that faithfully reflect the ground distance. This leads to SAT (Sinkhorn Adversarial Training), a more robust defense against adversarial attacks. Then, we propose to quantify more precisely the robustness of a model to adversarial attacks over a wide range of perturbation sizes using a different metric, the Area Under the Accuracy Curve (AUAC). We perform extensive experiments on both CIFAR-10 and CIFAR-100 datasets and show that our defense is globally more robust than the state-of-the-art.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 24 of its 34 references that are in the map. First posted on arXiv 5 Feb 2021.

Builds on

24 of 34 references.

References · 24

  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. 2013Intriguing properties of neural networkscited by 5,114
  5. 2016Wide Residual Networkscited by 3,057
  6. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  7. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  8. 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
  9. 2016Adversarial Machine Learning at Scalecited by 934
  10. 2017Ensemble Adversarial Training: Attacks and Defensescited by 833
  11. 2015The Limitations of Deep Learning in Adversarial Settingscited by 784
  12. 2020On Adaptive Attacks to Adversarial Example Defensescited by 547
12 more
  1. 2017Countering Adversarial Images using Input Transformationscited by 517
  2. 2017Decision-Based Adversarial Attacks: Reliable Attacks Against Black-Box Machine Learning Modelscited by 459
  3. 2015Return of Frustratingly Easy Domain Adaptationcited by 389
  4. 2017Defense against Adversarial Attacks Using High-Level Representation Guided Denoisercited by 329
  5. 2017Learning Generative Models with Sinkhorn Divergencescited by 310
  6. 2017PixelDefend: Leveraging Generative Models to Understand and Defend against Adversarial Examplescited by 243
  7. 2019Improving Adversarial Robustness via Promoting Ensemble Diversitycited by 213
  8. 2018Stochastic Activation Pruning for Robust Adversarial Defensecited by 171
  9. 2018Decoupling Direction and Norm for Efficient Gradient-Based L2 Adversarial Attacks and Defensescited by 109
  10. 2019Adversarial Defense by Restricting the Hidden Space of Deep Neural Networkscited by 56
  11. 2018Improving the Generalization of Adversarial Training with Domain Adaptationcited by 48
  12. 2018Trust Region Based Adversarial Attack on Neural Networkscited by 11

Built on by

Cited by year

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

6 papers.