mlsanityData to 7 Oct 2026

Decision-Focused Evaluation of Worst-Case Distribution Shift

arXiv 2407.03557 ↗First posted 4 Jul 2024cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

Distribution shift is a key challenge for predictive models in practice, creating the need to identify potentially harmful shifts in advance of deployment. Existing work typically defines these worst-case shifts as ones that most degrade the individual-level accuracy of the model. However, when models are used to make a downstream population-level decision like the allocation of a scarce resource, individual-level accuracy may be a poor proxy for performance on the task at hand. We introduce a novel framework that employs a hierarchical model structure to identify worst-case distribution shifts in predictive resource allocation settings by capturing shifts both within and across instances of the decision problem. This task is more difficult than in standard distribution shift settings due to combinatorial interactions, where decisions depend on the joint presence of individuals in the allocation task. We show that the problem can be reformulated as a submodular optimization problem, enabling efficient approximations of worst-case loss. Applying our framework to real data, we find empirical evidence that worst-case shifts identified by one metric often significantly diverge from worst-case distributions identified by other metrics.

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

Builds on

24 of 46 references.

References · 24

  1. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
  2. 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 443
  3. 2018Confounding variables can degrade generalization performance of radiological deep learning modelscited by 374
  4. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 334
  5. 2017Smart "Predict, then Optimize"cited by 332
  6. 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 220
  7. 2020Large-Scale Methods for Distributionally Robust Optimizationcited by 179
  8. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 169
  9. 2023Change is Hard: A Closer Look at Subpopulation Shiftcited by 119
  10. 2019Smart Predict-and-Optimize for Hard Combinatorial Optimization Problemscited by 88
  11. 2020Decision Trees for Decision-Making under the Predict-then-Optimize Frameworkcited by 52
  12. 2020Contrastive Losses and Solution Caching for Predict-and-Optimizecited by 52
12 more
  1. 2022PyEPO: A PyTorch-based End-to-End Predict-then-Optimize Library for Linear and Integer Programmingcited by 32
  2. 2020Learning Optimal Distributionally Robust Individualized Treatment Rulescited by 28
  3. 2017Continuous DR-submodular Maximization: Structure and Algorithmscited by 24
  4. 2017Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gapcited by 21
  5. 2022The Two Dimensions of Worst-case Training and the Integrated Effect for Out-of-domain Generalizationcited by 21
  6. 2018Distributionally Robust Submodular Maximizationcited by 12
  7. 2021A comparison of approaches to improve worst-case predictive model performance over patient subpopulationscited by 12
  8. 2022Evaluating Robustness to Dataset Shift via Parametric Robustness Setscited by 10
  9. 2023Machine Learning Who to Nudge: Causal vs Predictive Targeting in a Field Experiment on Student Financial Aid Renewalcited by 8
  10. 2024Auditing Fairness under Unobserved Confoundingcited by 6
  11. 2024Evaluating Model Performance Under Worst-case Subpopulationscited by 5
  12. 2020How Does Momentum Help Frank Wolfe?cited by 3

Built on by

Cited by year (2026 to 7 Oct)

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

4 papers.