Outlier-Robust Wasserstein DRO
Not on the map. Why?
Abstract (arXiv)
Distributionally robust optimization (DRO) is an effective approach for data-driven decision-making in the presence of uncertainty. Geometric uncertainty due to sampling or localized perturbations of data points is captured by Wasserstein DRO (WDRO), which seeks to learn a model that performs uniformly well over a Wasserstein ball centered around the observed data distribution. However, WDRO fails to account for non-geometric perturbations such as adversarial outliers, which can greatly distort the Wasserstein distance measurement and impede the learned model. We address this gap by proposing a novel outlier-robust WDRO framework for decision-making under both geometric (Wasserstein) perturbations and non-geometric (total variation (TV)) contamination that allows an varepsilon-fraction of data to be arbitrarily corrupted. We design an uncertainty set using a certain robust Wasserstein ball that accounts for both perturbation types and derive minimax optimal excess risk bounds for this procedure that explicitly capture the Wasserstein and TV risks. We prove a strong duality result that enables tractable convex reformulations and efficient computation of our outlier-robust WDRO problem. When the loss function depends only on low-dimensional features of the data, we eliminate certain dimension dependencies from the risk bounds that are unavoidable in the general setting. Finally, we present experiments validating our theory on standard regression and classification tasks.
Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Builds on 34 of its 59 references that are in the map. First posted on arXiv 9 Nov 2023.
Builds on
34 of 59 references.
References · 34
- 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
- 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 364
- 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
- 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
- 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 185
- 2021On the Convergence and Robustness of Adversarial Trainingcited by 130
- 2015Distributionally Robust Logistic Regressioncited by 126
- 2019Recent Advances in Algorithmic High-Dimensional Robust Statisticscited by 101
- 2017Being Robust (in High Dimensions) Can Be Practicalcited by 83
- 2017Regularization via Mass Transportationcited by 81
- 2021DORO: Distributional and Outlier Robust Optimizationcited by 56
- 2020Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionalitycited by 49
22 more
- 2020Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimizationcited by 44
- 2017Resilience: A Criterion for Learning in the Presence of Arbitrary Outlierscited by 43
- 2018Convergence and Concentration of Empirical Measures under Wasserstein Distance in Unbounded Functional Spacescited by 41
- 2018High-Dimensional Robust Mean Estimation in Nearly-Linear Timecited by 39
- 2019Generalized Resilience and Robust Statisticscited by 37
- 2018Theoretical Analysis of Adversarial Learning: A Minimax Approachcited by 31
- 2018Robust Hypothesis Testing Using Wasserstein Uncertainty Setscited by 28
- 2021Outlier-Robust Optimal Transport: Duality, Structure, and Statistical Analysiscited by 27
- 2019Confidence Regions in Wasserstein Distributionally Robust Estimationcited by 24
- 2020Distributionally robust stochastic programs with side information based on trimmings -- Extended versioncited by 19
- 2022Holistic Robust Data-Driven Decisionscited by 18
- 2018Wasserstein Distributionally Robust Kalman Filteringcited by 17
- 2018Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimatorcited by 16
- 2018On Distributionally Robust Chance Constrained Programs with Wasserstein Distancecited by 15
- 2020Principled learning method for Wasserstein distributionally robust optimization with local perturbationscited by 14
- 2021A Unified Theory of Robust and Distributionally Robust Optimization via the Primal-Worst-Equals-Dual-Best Principlecited by 13
- 2019Bridging Bayesian and Minimax Mean Square Error Estimation via Wasserstein Distributionally Robust Optimizationcited by 11
- 2023Certified Robust Neural Networks: Generalization and Corruption Resistancecited by 11
- 2018Data-Driven Chance Constrained Programs over Wasserstein Ballscited by 9
- 2020Distributionally Robust Weighted k-Nearest Neighborscited by 9
- 2023Robust Estimation under the Wasserstein Distancecited by 8
- 2023Nash Equilibria, Regularization and Computation in Optimal Transport-Based Distributionally Robust Optimizationcited by 8
Built on by
Citing papers per year: 2024: 7; 2025: 6; 2026: 3.
16 papers.
Sort:
- 2024Generalized Sobolev Transport for Probability Measures on a Graphcited by 9
- 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendationcited by 9
- 2024A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributionscited by 7
- 2024Robust Distribution Learning with Local and Global Adversarial Corruptionscited by 5
- 2025DRO: A Python Library for Distributionally Robust Optimization in Machine Learningcited by 5
- 2025Improved Stochastic Optimization of LogSumExpcited by 4
- 2025Decision Making under Model Misspecification: DRO with Robust Bayesian Ambiguity Setscited by 2
- 2024Automatic Outlier Rectification via Optimal Transportcited by 1
- 2024On the KL-Divergence-based Robust Satisficing Modelcited by 1
- 2024FDR-SVM: A Federated Distributionally Robust Support Vector Machine via a Mixture of Wasserstein Balls Ambiguity Setcited by 1
- 2025Distributionally Robust Optimization with Adversarial Data Contaminationcited by 1
- 2025Distributionally Robust Federated Learning with Outlier Resiliencecited by 1
4 more
- 2025Estimation of Stochastic Optimal Transport Mapscited by 1
- 2026Bulk-Calibrated Credal Ambiguity Sets: Fast, Tractable Decision Making under Out-of-Sample Contaminationcited by 1
- 2026Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendationcited by 0
- 2026Risk-Averse Wasserstein Distributionally Robust Online Learningcited by 0
- 2026Risk-Averse Wasserstein Distributionally Robust Online Learning23 Feb 2026
- 2026Bulk-Calibrated Credal Ambiguity Sets: Fast, Tractable Decision Making under Out-of-Sample Contamination29 Jan 2026
- 2026Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendation7 Jan 2026
- 2025Estimation of Stochastic Optimal Transport Maps10 Dec 2025
- 2025Improved Stochastic Optimization of LogSumExp29 Sep 2025
- 2025Distributionally Robust Federated Learning with Outlier Resilience29 Sep 2025
- 2025Distributionally Robust Optimization with Adversarial Data Contamination14 Jul 2025
- 2025DRO: A Python Library for Distributionally Robust Optimization in Machine Learning29 May 2025
- 2025Decision Making under Model Misspecification: DRO with Robust Bayesian Ambiguity Sets6 May 2025
- 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation31 Oct 2024
- 2024FDR-SVM: A Federated Distributionally Robust Support Vector Machine via a Mixture of Wasserstein Balls Ambiguity Set4 Oct 2024
- 2024On the KL-Divergence-based Robust Satisficing Model17 Aug 2024
4 more
- 2024Robust Distribution Learning with Local and Global Adversarial Corruptions10 Jun 2024
- 2024A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributions6 May 2024
- 2024Automatic Outlier Rectification via Optimal Transport21 Mar 2024
- 2024Generalized Sobolev Transport for Probability Measures on a Graph7 Feb 2024
- 2024Generalized Sobolev Transport for Probability Measures on a Graphcited by 9
- 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendationcited by 9
- 2024A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributionscited by 7
- 2024Robust Distribution Learning with Local and Global Adversarial Corruptionscited by 5
- 2025DRO: A Python Library for Distributionally Robust Optimization in Machine Learningcited by 5
- 2025Improved Stochastic Optimization of LogSumExpcited by 4
- 2025Decision Making under Model Misspecification: DRO with Robust Bayesian Ambiguity Setscited by 2
- 2024Automatic Outlier Rectification via Optimal Transportcited by 1
- 2024On the KL-Divergence-based Robust Satisficing Modelcited by 1
- 2024FDR-SVM: A Federated Distributionally Robust Support Vector Machine via a Mixture of Wasserstein Balls Ambiguity Setcited by 1
- 2025Distributionally Robust Optimization with Adversarial Data Contaminationcited by 1
- 2025Distributionally Robust Federated Learning with Outlier Resiliencecited by 1
12 most cited of 16 All 16 (JSON)
- 2026Risk-Averse Wasserstein Distributionally Robust Online Learning23 Feb 2026
- 2026Bulk-Calibrated Credal Ambiguity Sets: Fast, Tractable Decision Making under Out-of-Sample Contamination29 Jan 2026
- 2026Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendation7 Jan 2026
- 2025Estimation of Stochastic Optimal Transport Maps10 Dec 2025
- 2025Improved Stochastic Optimization of LogSumExp29 Sep 2025
- 2025Distributionally Robust Federated Learning with Outlier Resilience29 Sep 2025
- 2025Distributionally Robust Optimization with Adversarial Data Contamination14 Jul 2025
- 2025DRO: A Python Library for Distributionally Robust Optimization in Machine Learning29 May 2025
- 2025Decision Making under Model Misspecification: DRO with Robust Bayesian Ambiguity Sets6 May 2025
- 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation31 Oct 2024
- 2024FDR-SVM: A Federated Distributionally Robust Support Vector Machine via a Mixture of Wasserstein Balls Ambiguity Set4 Oct 2024
- 2024On the KL-Divergence-based Robust Satisficing Model17 Aug 2024
12 newest of 16 All 16 (JSON)