mlsanityData to 7 Oct 2026

Optimal Transport Model Distributional Robustness

arXiv 2306.04178 ↗First posted 7 Jun 2023cs.LG cs.CGcited by 5

Not on the map. Why?

Abstract (arXiv)

Distributional robustness is a promising framework for training deep learning models that are less vulnerable to adversarial examples and data distribution shifts. Previous works have mainly focused on exploiting distributional robustness in the data space. In this work, we explore an optimal transport-based distributional robustness framework in model spaces. Specifically, we examine a model distribution within a Wasserstein ball centered on a given model distribution that maximizes the loss. We have developed theories that enable us to learn the optimal robust center model distribution. Interestingly, our developed theories allow us to flexibly incorporate the concept of sharpness awareness into training, whether it's a single model, ensemble models, or Bayesian Neural Networks, by considering specific forms of the center model distribution. These forms include a Dirac delta distribution over a single model, a uniform distribution over several models, and a general Bayesian Neural Network. Furthermore, we demonstrate that Sharpness-Aware Minimization (SAM) is a specific case of our framework when using a Dirac delta distribution over a single model, while our framework can be seen as a probabilistic extension of SAM. To validate the effectiveness of our framework in the aforementioned settings, we conducted extensive experiments, and the results reveal remarkable improvements compared to the baselines.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 51 of its 72 references that are in the map. First posted on arXiv 7 Jun 2023.

Builds on

51 of 72 references.

References · 51

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  3. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  4. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  5. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  6. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  7. 2017Deep Mutual Learningcited by 621
  8. 2017Exploring Generalization in Deep Learningcited by 595
  9. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
  10. 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 555
  11. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
  12. 2019Fantastic Generalization Measures and Where to Find Themcited by 507
38 more
  1. 2019Be Your Own Teacher: Improve the Performance of Convolutional Neural Networks via Self Distillationcited by 491
  2. 2015Variational Dropout and the Local Reparameterization Trickcited by 489
  3. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  4. 2017Regularizing Neural Networks by Penalizing Confident Output Distributionscited by 461
  5. 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 431
  6. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
  7. 2017Snapshot Ensembles: Train 1, get M for freecited by 349
  8. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 333
  9. 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
  10. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  11. 2017Three Factors Influencing Minima in SGDcited by 270
  12. 2021When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentationscited by 259
  13. 2020Pitfalls of In-Domain Uncertainty Estimation and Ensembling in Deep Learningcited by 208
  14. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  15. 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 182
  16. 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 171
  17. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 169
  18. 2022Towards Understanding Sharpness-Aware Minimizationcited by 145
  19. 2022Generalized Federated Learning via Sharpness Aware Minimizationcited by 144
  20. 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
  21. 2015Distributionally Robust Logistic Regressioncited by 124
  22. 2020Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustnesscited by 121
  23. 2021Sharpness-Aware Minimization Improves Language Model Generalizationcited by 108
  24. 2022Sharpness-Aware Training for Freecited by 95
  25. 2020Relative Flatness and Generalizationcited by 88
  26. 2022Fisher SAM: Information Geometry and Sharpness Aware Minimisationcited by 84
  27. 2022When Do Flat Minima Optimizers Work?cited by 78
  28. 2020The Implicit and Explicit Regularization Effects of Dropoutcited by 71
  29. 2015Distributional Smoothing with Virtual Adversarial Trainingcited by 61
  30. 2022Sharp-MAML: Sharpness-Aware Model-Agnostic Meta Learningcited by 57
  31. 2019Emergent properties of the local geometry of neural loss landscapescited by 46
  32. 2021Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsitycited by 44
  33. 2022SAM as an Optimal Relaxation of Bayescited by 40
  34. 2022A Unified Wasserstein Distributional Robustness Framework for Adversarial Trainingcited by 36
  35. 2018Wasserstein Distributionally Robust Stochastic Control: A Data-Driven Approachcited by 27
  36. 2017Wasserstein Distributionally Robust Optimization and Variation Regularizationcited by 25
  37. 2022Stochastic Multiple Target Sampling Gradient Descentcited by 14
  38. 2017Semi-supervised Learning based on Distributionally Robust Optimizationcited by 12

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 2; 2026: 2.

5 papers.