mlsanityData to 14 Oct 2026

Optimize-via-Predict: Realizing out-of-sample optimality in data-driven optimization

arXiv 2309.11147 ↗First posted 20 Sep 2023math.OC stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We examine a stochastic formulation for data-driven optimization wherein the decision-maker is not privy to the true distribution, but has knowledge that it lies in some hypothesis set and possesses a historical data set, from which information about it can be gleaned. We define a prescriptive solution as a decision rule mapping such a data set to decisions. As there does not exist prescriptive solutions that are generalizable over the entire hypothesis set, we define out-of-sample optimality as a local average over a neighbourhood of hypotheses, and averaged over the sampling distribution. We prove sufficient conditions for local out-of-sample optimality, which reduces to functions of the sufficient statistic of the hypothesis family. We present an optimization problem that would solve for such an out-of-sample optimal solution, and does so efficiently by a combination of sampling and bisection search algorithms. Finally, we illustrate our model on the newsvendor model, and find strong performance when compared against alternatives in the literature. There are potential implications of our research on end-to-end learning and Bayesian optimization.

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

Builds on

2 of 39 references.

References · 2

  1. 2017Wasserstein Distributionally Robust Optimization and Variation Regularizationcited by 25
  2. 2020A Pareto Dominance Principle for Data-Driven Optimizationcited by 7

Built on by

Not cited yet.