mlsanityData to 14 Oct 2026

Learning Risk Scores Robust to Unobserved Confounders

arXiv 2609.27144 ↗First posted 22 Sep 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We consider the problem of learning risk scores to prioritize individuals for scarce resources or interventions, from historical observational data affected by unobserved confounding. Decisions about who receives scarce resources are often guided by risk scores based on recorded characteristics, such as responses to a survey. These risk scores are increasingly being learned directly from observational data: historical records of individuals' characteristics, allocation decisions, and outcomes. Standard methods such as inverse propensity weighting (IPW), which corrects for the bias introduced by the historical allocation policy, can be used to learn accurate risk scores if the historical decision process is fully explained by the recorded characteristics. In practice, however, historical decisions often depend on unrecorded information, causing learned risk scores to systematically under-prioritize exactly the individuals whose unrecorded circumstances drove past prioritization. We propose a method for learning risk scores that are robust to this kind of unobserved confounding, building on IPW. Since propensity weights cannot be reliably estimated under unobserved confounding, we instead treat them as belonging to an uncertainty set determined by the observable data and domain-informed estimates of the degree of confounding, combining sensitivity analysis from causal inference with Wasserstein distributionally robust optimization. The resulting robust risk score learning problem admits a sample-based approximation that we reformulate as an exponential cone program compatible with off-the-shelf solvers. We demonstrate the effectiveness of our approach on semi-synthetic data derived from datasets in the UCI Machine Learning Repository. Our method improves calibration by up to 29.2% over traditional benchmarks and up to 11.1% over the state of the art, without compromising other metrics.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 30 references that are in the map. First posted on arXiv 22 Sep 2026.

Builds on

11 of 30 references.

References · 11

  1. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
  2. 2015Distributionally Robust Logistic Regressioncited by 126
  3. 2016Learning Optimized Risk Scorescited by 47
  4. 2020In Pursuit of Interpretable, Fair and Accurate Machine Learning for Criminal Recidivism Predictioncited by 42
  5. 2018Bounds on the conditional and average treatment effect with unobserved confounding factorscited by 39
  6. 2021Sharp Sensitivity Analysis for Inverse Propensity Weighting via Quantile Balancingcited by 32
  7. 2021Doubly-Valid/Doubly-Sharp Sensitivity Analysis for Causal Inference with Unmeasured Confoundingcited by 28
  8. 2022Learning from a Biased Samplecited by 14
  9. 2017Robust Covariate Shift Prediction with General Losses and Feature Viewscited by 4
  10. 2022Distributionally Robust Causal Inference with Observational Datacited by 2
  11. 2025Enhanced Marginal Sensitivity Model and Boundscited by 1

Built on by

Not cited yet.