mlsanityData to 14 Oct 2026

Topology-aware Robust Optimization for Out-of-distribution Generalization

arXiv 2307.13943 ↗First posted 26 Jul 2023cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Out-of-distribution (OOD) generalization is a challenging machine learning problem yet highly desirable in many high-stake applications. Existing methods suffer from overly pessimistic modeling with low generalization confidence. As generalizing to arbitrary test distributions is impossible, we hypothesize that further structure on the topology of distributions is crucial in developing strong OOD resilience. To this end, we propose topology-aware robust optimization (TRO) that seamlessly integrates distributional topology in a principled optimization framework. More specifically, TRO solves two optimization objectives: (1) Topology Learning which explores data manifold to uncover the distributional topology; (2) Learning on Topology which exploits the topology to constrain robust optimization for tightly-bounded generalization risks. We theoretically demonstrate the effectiveness of our approach and empirically show that it significantly outperforms the state of the arts in a wide range of tasks including classification, regression, and semantic segmentation. Moreover, we empirically find the data-driven distributional topology is consistent with domain knowledge, enhancing the explainability of our approach.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 31 of its 48 references that are in the map. First posted on arXiv 26 Jul 2023.

Builds on

31 of 48 references.

References · 31

  1. 2021Convex optimizationcited by 2,515
  2. 2019Invariant Risk Minimizationcited by 1,854
  3. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
  4. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
  5. 2020In Search of Lost Domain Generalizationcited by 1,054
  6. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  7. 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 742
  8. 2018Recognition in Terra Incognitacited by 658
  9. 2019Agnostic Federated Learningcited by 456
  10. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
  11. 2020Environment Inference for Invariant Learningcited by 306
  12. 2020Learning to Learn Single Domain Generalizationcited by 296
19 more
  1. 2020Gradient Starvation: A Learning Proclivity in Neural Networkscited by 267
  2. 2020The Risks of Invariant Risk Minimizationcited by 262
  3. 2021Gradient Matching for Domain Generalizationcited by 258
  4. 2020Large-Scale Methods for Distributionally Robust Optimizationcited by 179
  5. 2020Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustnesscited by 121
  6. 2021Model-Based Domain Generalizationcited by 104
  7. 2021Heterogeneous Risk Minimizationcited by 90
  8. 2019Distributionally Robust Optimization and Generalization in Kernel Methodscited by 73
  9. 2021Uncertainty-guided Model Generalization to Unseen Domainscited by 41
  10. 2018Robust Optimization over Multiple Domainscited by 34
  11. 2016Minimizing the Maximal Loss: How and Why?cited by 30
  12. 2019Incorporating Unlabeled Data into Distributionally Robust Learningcited by 20
  13. 2022Graph-Relational Domain Adaptationcited by 19
  14. 2021Diffusion Earth Mover's Distance and Distribution Embeddingscited by 18
  15. 2021Out-of-Domain Generalization from a Single Source: An Uncertainty Quantification Approachcited by 18
  16. 2018Wasserstein Distributionally Robust Kalman Filteringcited by 17
  17. 2023Are Data-driven Explanations Robust against Out-of-distribution Data?cited by 14
  18. 2019Rethinking Kernel Methods for Node Representation Learning on Graphscited by 7
  19. 2021Deep Learning for Spatiotemporal Modeling of Urbanizationcited by 5

Built on by

Cited by year (2026 to 14 Oct)

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

7 papers.