mlsanityData to 7 Oct 2026

Interpolation for Robust Learning: Data Augmentation on Wasserstein Geodesics

arXiv 2302.02092 ↗First posted 4 Feb 2023cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

We propose to study and promote the robustness of a model as per its performance through the interpolation of training data distributions. Specifically, (1) we augment the data by finding the worst-case Wasserstein barycenter on the geodesic connecting subpopulation distributions of different categories. (2) We regularize the model for smoother performance on the continuous geodesic path connecting subpopulation distributions. (3) Additionally, we provide a theoretical guarantee of robustness improvement and investigate how the geodesic location and the sample size contribute, respectively. Experimental validations of the proposed strategy on textitfour datasets, including CIFAR-100 and ImageNet, establish the efficacy of our method, e.g., our method improves the baselines' certifiable robustness on CIFAR10 up to 7.7%, with 16.8% on empirical robustness on CIFAR-100. Our work provides a new perspective of model robustness through the lens of Wasserstein geodesic-based interpolation with a practical off-the-shelf strategy that can be combined with existing robust training methods.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 89 of its 118 references that are in the map. First posted on arXiv 4 Feb 2023.

Builds on

89 of 118 references.

References · 89

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  4. 2022Hierarchical Text-Conditional Image Generation with CLIP Latentscited by 6,539
  5. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  6. 2022Generative Adversarial Networkscited by 5,603
  7. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  8. 2013Intriguing properties of neural networkscited by 5,114
  9. 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,530
  10. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  11. 2013Auto-Encoding Variational Bayescited by 3,980
  12. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,550
38 more
  1. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  2. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
  3. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  4. 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
  5. 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
  6. 2016Adversarial Machine Learning at Scalecited by 934
  7. 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 897
  8. 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
  9. 2019Unlabeled Data Improves Adversarial Robustnesscited by 415
  10. 2017A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasetscited by 374
  11. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 334
  12. 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 328
  13. 2018Adversarially Robust Generalization Requires More Datacited by 318
  14. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  15. 2020Puzzle Mix: Exploiting Saliency and Local Statistics for Optimal Mixupcited by 260
  16. 2019Optimal transport mapping via input convex neural networkscited by 202
  17. 2022Improving Out-of-Distribution Robustness via Selective Augmentationcited by 202
  18. 2020How Does Mixup Help With Robustness and Generalization?cited by 193
  19. 2021Data Augmentation Can Improve Robustnesscited by 193
  20. 2020Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Datacited by 179
  21. 2018Certified Adversarial Robustness with Additive Noisecited by 178
  22. 2018Robustness via curvature regularization, and vice versacited by 174
  23. 2020Geometric Dataset Distances via Optimal Transportcited by 157
  24. 2020SaliencyMix: A Saliency Guided Data Augmentation Strategy for Better Regularizationcited by 149
  25. 2019Robust Learning with Jacobian Regularizationcited by 127
  26. 2021Co-Mixup: Saliency Guided Joint Mixup with Supermodular Diversitycited by 127
  27. 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 123
  28. 2022Neural Optimal Transportcited by 123
  29. 2017Large-Scale Optimal Transport and Mapping Estimationcited by 120
  30. 2020MACER: Attack-free and Scalable Robust Training via Maximizing Certified Radiuscited by 114
  31. 2021Robust Learning Meets Generative Models: Can Proxy Distributions Improve Adversarial Robustness?cited by 113
  32. 2019Defense Against Adversarial Attacks Using Feature Scattering-based Adversarial Trainingcited by 95
  33. 2020SSMBA: Self-Supervised Manifold Based Data Augmentation for Improving Out-of-Domain Robustnesscited by 94
  34. 2020Convex Potential Flows: Universal Probability Distributions with Optimal Transport and Convex Optimizationcited by 89
  35. 2021Entropic estimation of optimal transport mapscited by 87
  36. 2019Learning with minibatch Wasserstein : asymptotic and gradient propertiescited by 83
  37. 2014Convolutional Neural Networks at Constrained Time Costcited by 81
  38. 2020Adversarial Distributional Training for Robust Deep Learningcited by 79

50 most cited of 89 All 89 (JSON)

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 2.

3 papers.