mlsanityData to 7 Oct 2026

Holistic Robust Data-Driven Decisions

arXiv 2207.09560 ↗First posted 19 Jul 2022stat.ML cs.LGcited by 17

Not on the map. Why?

Abstract (arXiv)

The design of data-driven formulations for machine learning and decision-making with good out-of-sample performance is a key challenge. The observation that good in-sample performance does not guarantee good out-of-sample performance is generally known as overfitting. Practical overfitting can typically not be attributed to a single cause but is caused by several factors simultaneously. We consider here three overfitting sources: (i) statistical error as a result of working with finite sample data, (ii) data noise, which occurs when the data points are measured only with finite precision, and finally, (iii) data misspecification in which a small fraction of all data may be wholly corrupted. Although existing data-driven formulations may be robust against one of these three sources in isolation, they do not provide holistic protection against all overfitting sources simultaneously. We design a novel data-driven formulation that guarantees such holistic protection and is computationally viable. Our distributionally robust optimization formulation can be interpreted as a novel combination of a Kullback-Leibler and L'evy-Prokhorov robust optimization formulation. In the context of classification and regression problems, we show that several popular regularized and robust formulations naturally reduce to a particular case of our proposed novel formulation. Finally, we apply the proposed HR formulation to two real-life applications and study it alongside several benchmarks: (1) training neural networks on healthcare data, where we analyze various robustness and generalization properties in the presence of noise, labeling errors, and scarce data, (2) a portfolio selection problem with real stock data, and analyze the risk/return tradeoff under the natural severe distribution shift of the application.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). Builds on 22 of its 63 references that are in the map. First posted on arXiv 19 Jul 2022.

Builds on

22 of 63 references.

References · 22

  1. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  2. 2020Overfitting in adversarially robust deep learningcited by 504
  3. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 333
  4. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  5. 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
  6. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  7. 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 182
  8. 2020Dataset Security for Machine Learning: Data Poisoning, Backdoor Attacks, and Defensescited by 171
  9. 2016Variance-based regularization with convex objectivescited by 153
  10. 2019Recent Advances in Algorithmic High-Dimensional Robust Statisticscited by 100
  11. 2013Data-Driven Robust Optimizationcited by 84
  12. 2021Sinkhorn Distributionally Robust Optimizationcited by 38
10 more
  1. 2019Generalized Resilience and Robust Statisticscited by 37
  2. 2017From Data to Decisions: Distributionally Robust Optimization is Optimalcited by 36
  3. 2016Recovering Best Statistical Guarantees via the Empirical Divergence-based Distributionally Robust Optimizationcited by 33
  4. 2014Robust Sample Average Approximationcited by 25
  5. 2013Likelihood Robust Optimization for Data-driven Problemscited by 13
  6. 2020Distributionally Robust Local Non-parametric Conditional Estimationcited by 13
  7. 2021On the power of adaptivity in statistical adversariescited by 12
  8. 2021Learning and Decision-Making with Data: Optimal Formulations and Phase Transitionscited by 7
  9. 2019Two-stage sample robust optimizationcited by 3
  10. 2019Tractable Reformulations of Distributionally Robust Two-stage Stochastic Programs with ∞-Wasserstein Distancecited by 3

Built on by

Cited by year

Citing papers per year: 2023: 7; 2024: 6; 2025: 4.

17 papers.

Sort:

  1. 2023Outlier-Robust Wasserstein DROcited by 16
  2. 2023Unifying Distributionally Robust Optimization via Optimal Transport Theorycited by 12
  3. 2023Certified Robust Neural Networks: Generalization and Corruption Resistancecited by 11
  4. 2024Generalization Bound and New Algorithm for Clean-Label Backdoor Attackcited by 11
  5. 2025Conformal Prediction under Levy-Prokhorov Distribution Shifts: Robustness to Local and Global Perturbationscited by 11
  6. 2024Towards Fairness-Aware Adversarial Learningcited by 10
  7. 2023Smoothed f-Divergence Distributionally Robust Optimizationcited by 6
  8. 2023Geometry-Calibrated DRO: Combating Over-Pessimism with Free Energy Implicationscited by 5
  9. 2024Robust Distribution Learning with Local and Global Adversarial Corruptionscited by 5
  10. 2025DRO: A Python Library for Distributionally Robust Optimization in Machine Learningcited by 5
  11. 2023Ensemble Modeling for Time Series Forecasting: an Adaptive Robust Optimization Approachcited by 2
  12. 2024Contextual Optimization under Covariate Shift: A Robust Approach by Intersecting Wasserstein Ballscited by 2
5 more
  1. 2023Responsible AI (RAI) Games and Ensemblescited by 1
  2. 2024From Distributional Robustness to Robust Statistics: A Confidence Sets Perspectivecited by 1
  3. 2025Distributionally Robust Optimization with Adversarial Data Contaminationcited by 1
  4. 2024Distributionally and Adversarially Robust Logistic Regression via Intersecting Wasserstein Ballscited by 0
  5. 2025Provable Robust Overfitting Mitigation in Wasserstein Distributionally Robust Optimizationcited by 0