mlsanityData to 14 Oct 2026

On Certifying and Improving Generalization to Unseen Domains

arXiv 2206.12364 ↗First posted 24 Jun 2022cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Domain Generalization (DG) aims to learn models whose performance remains high on unseen domains encountered at test-time by using data from multiple related source domains. Many existing DG algorithms reduce the divergence between source distributions in a representation space to potentially align the unseen domain close to the sources. This is motivated by the analysis that explains generalization to unseen domains using distributional distance (such as the Wasserstein distance) to the sources. However, due to the openness of the DG objective, it is challenging to evaluate DG algorithms comprehensively using a few benchmark datasets. In particular, we demonstrate that the accuracy of the models trained with DG methods varies significantly across unseen domains, generated from popular benchmark datasets. This highlights that the performance of DG methods on a few benchmark datasets may not be representative of their performance on unseen domains in the wild. To overcome this roadblock, we propose a universal certification framework based on distributionally robust optimization (DRO) that can efficiently certify the worst-case performance of any DG method. This enables a data-independent evaluation of a DG method complementary to the empirical evaluations on benchmark datasets. Furthermore, we propose a training algorithm that can be used with any DG method to provably improve their certified performance. Our empirical evaluation demonstrates the effectiveness of our method at significantly improving the worst-case loss (i.e., reducing the risk of failure of these models in the wild) without incurring a significant performance drop on benchmark datasets.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 60 of its 79 references that are in the map. First posted on arXiv 24 Jun 2022.

Builds on

60 of 79 references.

References · 60

  1. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  2. 2013Intriguing properties of neural networkscited by 5,155
  3. 2015Domain-Adversarial Training of Neural Networkscited by 3,044
  4. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
  5. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
  6. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  7. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  8. 2019Invariant Risk Minimizationcited by 1,854
  9. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
  10. 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
  11. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
  12. 2020In Search of Lost Domain Generalizationcited by 1,054
38 more
  1. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  2. 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 901
  3. 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 766
  4. 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 742
  5. 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 567
  6. 2017Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methodscited by 546
  7. 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 468
  8. 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
  9. 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 364
  10. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
  11. 2019Bridging Theory and Algorithm for Domain Adaptationcited by 332
  12. 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 330
  13. 2017Learning Generative Models with Sinkhorn Divergencescited by 314
  14. 2020Learning to Learn Single Domain Generalizationcited by 296
  15. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
  16. 2015Domain Generalization for Object Recognition with Multi-task Autoencoderscited by 253
  17. 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 214
  18. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 189
  19. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 185
  20. 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 183
  21. 2018Certified Adversarial Robustness with Additive Noisecited by 180
  22. 2018Semidefinite relaxations for certifying robustness to adversarial examplescited by 179
  23. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 170
  24. 2020Geometric Dataset Distances via Optimal Transportcited by 158
  25. 2019MNIST-C: A Robustness Benchmark for Computer Visioncited by 138
  26. 2016Technical Report on the CleverHans v2.1.0 Adversarial Examples Librarycited by 124
  27. 2020MACER: Attack-free and Scalable Robust Training via Maximizing Certified Radiuscited by 114
  28. 2021Robust Learning Meets Generative Models: Can Proxy Distributions Improve Adversarial Robustness?cited by 113
  29. 2019Generalizing to unseen domains via distribution matchingcited by 110
  30. 2018Benchmarking Neural Network Robustness to Common Corruptions and Surface Variationscited by 99
  31. 2021Towards Principled Disentanglement for Domain Generalizationcited by 91
  32. 2021AugMax: Adversarial Composition of Random Augmentations for Robust Trainingcited by 90
  33. 2019Support and Invertibility in Domain-Invariant Representationscited by 87
  34. 2013Data-Driven Robust Optimizationcited by 85
  35. 2017Regularization via Mass Transportationcited by 81
  36. 2019Distributionally Robust Optimization and Generalization in Kernel Methodscited by 73
  37. 2021On the effectiveness of adversarial training against common corruptionscited by 71
  38. 2020On the Transfer of Disentangled Representations in Realistic Settingscited by 63

50 most cited of 60 All 60 (JSON)

Built on by

Cited by year

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

4 papers.