mlsanityData to 7 Oct 2026

Contextual Optimization under Covariate Shift: A Robust Approach by Intersecting Wasserstein Balls

arXiv 2406.02426 ↗First posted 4 Jun 2024math.OC cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

In contextual optimization, a decision-maker leverages contextual information, often referred to as covariates, to better resolve uncertainty and make informed decisions. In this paper, we examine the challenges of contextual decision-making under covariate shift, a phenomenon where the distribution of covariates differs between the training and test environments. Such shifts can lead to inaccurate upstream estimations for test covariates that lie far from the training data, ultimately resulting in suboptimal downstream decisions. To tackle these challenges, we propose a novel approach called Intersection Wasserstein-balls DRO (IW-DRO), which integrates multiple estimation methods into the distributionally robust optimization (DRO) framework. At the core of our approach is an innovative ambiguity set defined as the intersection of two Wasserstein balls, with their centers constructed using appropriate nonparametric and parametric estimators. On the computational side, we reformulate the IW-DRO problem as a tractable convex program and develop an approximate algorithm tailored for large-scale problems to enhance computational efficiency. From a theoretical perspective, we demonstrate that IW-DRO achieves superior performance compared to single Wasserstein-ball DRO models. We further establish performance guarantees by analyzing the coverage of the intersection ambiguity set and the measure concentration of both estimators under the Wasserstein distance. Notably, we derive a finite-sample concentration result for the Nadaraya-Watson kernel estimator under covariate shift. The proposed IW-DRO framework offers practical value for decision-makers operating in uncertain environments affected by covariate shifts.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 58 references that are in the map. First posted on arXiv 4 Jun 2024.

Builds on

20 of 58 references.

References · 20

  1. 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 443
  2. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  3. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  4. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 169
  5. 2014From Predictive to Prescriptive Analyticscited by 142
  6. 2020Distributionally Robust Losses for Latent Covariate Mixturescited by 57
  7. 2021Integrated Conditional Estimation-Optimizationcited by 25
  8. 2020Residuals-based distributionally robust optimization with covariate informationcited by 20
  9. 2020Risk Guarantees for End-to-End Prediction and Optimization Processescited by 20
  10. 2022Holistic Robust Data-Driven Decisionscited by 17
  11. 2019Data-Pooling in Stochastic Optimizationcited by 14
  12. 2019Dynamic optimization with side informationcited by 14
8 more
  1. 2021Sequential Domain Adaptation by Synthesizing Distributionally Robust Expertscited by 14
  2. 2017Bootstrap Robust Prescriptive Analyticscited by 12
  3. 2021Robustifying Conditional Portfolio Decisions via Optimal Transportcited by 12
  4. 2021On Data-Driven Prescriptive Analytics with Side Information: A Regularized Nadaraya-Watson Approachcited by 12
  5. 2022Beyond IID: data-driven decision-making in heterogeneous environmentscited by 9
  6. 2021Distributionally Robust Prescriptive Analytics with Wasserstein Distancecited by 4
  7. 2021Distributionally Robust Optimal Power Flow with Contextual Informationcited by 2
  8. 2022Distributionally Robust Data Joincited by 2

Built on by

Cited by year (2026 to 7 Oct)

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

2 papers.