mlsanityData to 7 Oct 2026

Deciding When to Decide: Testing Operational Suboptimality Under Distributional Shift

arXiv 2608.29465 ↗First posted 29 Aug 2026stat.ML cs.LG stat.MEcited by 0

Not on the map. Why?

Abstract (arXiv)

Deployed decisions are often optimized once and retained because updates impose operational, regulatory, or switching costs. As operating conditions change, when should such decisions be re-optimized? We study this question for stochastic optimization when the objective's functional form is known but the decision maker's trade-offs are encoded by an unknown preference parameter. Standard distribution-shift tests are poorly aligned with this goal: they can flag detectable yet decision-irrelevant changes without determining whether the incumbent decision has become materially suboptimal. We propose textttRADAR (Regret-based Assessment of Decision Adequacy and Risk), a decision-focused framework that uses inverse optimization to infer latent preferences and tests the deployed decision's optimality gap under the current distribution. By targeting regret, textttRADAR ignores decision-irrelevant shifts while detecting changes that warrant re-optimization. We develop two-sample and sequential changepoint procedures and establish asymptotic guarantees for Type-I error and power. Across synthetic optimization problems, a semi-synthetic capacity allocation task, and police-zone planning, textttRADAR more reliably distinguishes harmful from harmless shifts than decision-agnostic alternatives.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 57 references that are in the map. First posted on arXiv 29 Aug 2026.

Builds on

24 of 57 references.

References · 24

  1. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  2. 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
  3. 2017Smart "Predict, then Optimize"cited by 332
  4. 2016Revisiting Classifier Two-Sample Testscited by 258
  5. 2019Differentiation of Blackbox Combinatorial Solverscited by 224
  6. 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 220
  7. 2014From Predictive to Prescriptive Analyticscited by 142
  8. 2020A Unified View of Label Shift Estimationcited by 119
  9. 2021Decision-Focused Learning: Through the Lens of Learning to Rankcited by 61
  10. 2016Classification accuracy as a proxy for two sample testingcited by 39
  11. 2021Tracking the risk of a deployed model and detecting harmful distribution shiftscited by 38
  12. 2015Inverse Optimization with Noisy Datacited by 34
12 more
  1. 2015Data-driven Inverse Optimization with Imperfect Informationcited by 33
  2. 2013Data-Driven Estimation in Equilibrium Using Inverse Optimizationcited by 32
  3. 2013A Nonparametric Approach for Multiple Change Point Analysis of Multivariate Datacited by 28
  4. 2021Risk Bounds and Calibration for a Smart Predict-then-Optimize Methodcited by 28
  5. 2025Gen-DFL: Decision-Focused Generative Learning for Robust Decision Makingcited by 18
  6. 2020Generalization of Change-Point Detection in Time Series Data Based on Direct Density Ratio Estimationcited by 12
  7. 2018Inverse optimization for the recovery of constraint parameterscited by 9
  8. 2016Inverse Optimization of Convex Risk Functionscited by 7
  9. 2025Keeping Medical AI Healthy and Trustworthy: A Review of Detection and Correction Methods for System Degradationcited by 6
  10. 2025Feasibility-Aware Decision-Focused Learning for Predicting Parameters in the Constraintscited by 5
  11. 2021Data-Driven Optimization for Atlanta Police Zone Designcited by 4
  12. 2023Black-Box Optimization with Implicit Constraints for Public Policycited by 4

Built on by

Not cited yet.