Optimal Transport Regularized Divergences: Application to Adversarial Robustness
Not on the map. Why?
Abstract (arXiv)
We introduce a new class of optimal-transport-regularized divergences, Dc, constructed via an infimal convolution between an information divergence, D, and an optimal-transport (OT) cost, C, and study their use in distributionally robust optimization (DRO). In particular, we propose the ARMORD methods as novel approaches to enhancing the adversarial robustness of deep learning models. These DRO-based methods are defined by minimizing the maximum expected loss over a Dc-neighborhood of the empirical distribution of the training data. Viewed as a tool for constructing adversarial samples, our method allows samples to be both transported, according to the OT cost, and re-weighted, according to the information divergence; the addition of a principled and dynamical adversarial re-weighting on top of adversarial sample transport is a key innovation of ARMORD. ARMORD can be viewed as a generalization of the best-performing loss functions and OT costs in the adversarial training literature; we demonstrate this flexibility by using ARMORD to augment the UDR, TRADES, and MART methods and obtain improved performance on CIFAR-10 and CIFAR-100 image recognition. Specifically, augmenting with ARMORD leads to 1.9% and 2.1% improvement against AutoAttack, a powerful ensemble of adversarial attacks, on CIFAR-10 and CIFAR-100 respectively. To foster reproducibility, we made the code accessible at https://github.com/star-ailab/ARMOR.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 33 of its 60 references that are in the map. First posted on arXiv 7 Sep 2023.
Builds on
33 of 60 references.
References · 33
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,268
- 2016Practical Black-Box Attacks against Machine Learningcited by 903
- 2015The Limitations of Deep Learning in Adversarial Settingscited by 790
- 2017Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methodscited by 546
- 2019On Evaluating Adversarial Robustnesscited by 447
- 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
21 more
- 2018Certified Defenses against Adversarial Examplescited by 306
- 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
- 2020Geometry-aware Instance-reweighted Adversarial Trainingcited by 198
- 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 185
- 2017Regularization via Mass Transportationcited by 81
- 2020Adversarial Distributional Training for Robust Deep Learningcited by 79
- 2019Distributionally Robust Optimization: A Reviewcited by 76
- 2019Distributionally Robust Optimization and Generalization in Kernel Methodscited by 73
- 2021Sinkhorn Distributionally Robust Optimizationcited by 38
- 2022A Unified Wasserstein Distributional Robustness Framework for Adversarial Trainingcited by 36
- 2016Recovering Best Statistical Guarantees via the Empirical Divergence-based Distributionally Robust Optimizationcited by 33
- 2022Learning to Re-weight Examples with Optimal Transport for Imbalanced Classificationcited by 23
- 2023Unifying Distributionally Robust Optimization via Optimal Transport Theorycited by 13
- 2022A Short and General Duality Proof for Wasserstein Distributionally Robust Optimizationcited by 12
- 2019Formulation and properties of a divergence used to compare probability measures without absolute continuitycited by 11
- 2022Regularization for Wasserstein Distributionally Robust Optimizationcited by 9
- 2022Function-space regularized R'enyi divergencescited by 7
- 2023Smoothed f-Divergence Distributionally Robust Optimizationcited by 7
- 2022On Generalization and Regularization via Wasserstein Distributionally Robust Optimizationcited by 6
- 2022Improving Adversarial Robustness via Joint Classification and Multiple Explicit Detection Classescited by 4
- 2022A General Wasserstein Framework for Data-driven Distributionally Robust Optimization: Tractability and Applicationscited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.