Optimizer's Information Criterion: Dissecting and Correcting Bias in Data-Driven Optimization
Not on the map. Why?
Abstract (arXiv)
In data-driven optimization, the sample performance of the obtained decision typically incurs an optimistic bias against the true performance, a phenomenon commonly known as the Optimizer's Curse and intimately related to overfitting in machine learning. Common techniques to correct this bias, such as cross-validation, require repeatedly solving additional optimization problems and are therefore computationally expensive. We develop a general bias correction approach, building on what we call Optimizer's Information Criterion (OIC), that directly approximates the first-order bias and does not require solving any additional optimization problems. Our OIC generalizes the celebrated Akaike Information Criterion to evaluate the objective performance in data-driven optimization, which crucially involves not only model fitting but also its interplay with the downstream optimization. As such it can be used for decision selection instead of only model selection. We apply our approach to a range of data-driven optimization formulations comprising empirical and parametric models, their regularized counterparts, and furthermore contextual optimization. Finally, we provide numerical validation on the superior performance of our approach under synthetic and real-world datasets.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 27 of its 81 references that are in the map. First posted on arXiv 16 Jun 2023.
Builds on
27 of 81 references.
References · 27
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 580
- 2019Differentiable Convex Optimization Layerscited by 465
- 2017Smart "Predict, then Optimize"cited by 339
- 2018Sensitivity and Generalization in Neural Networks: an Empirical Studycited by 189
- 2018Representer Point Selection for Explaining Deep Neural Networkscited by 187
- 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 185
- 2016Variance-based regularization with convex objectivescited by 155
- 2014From Predictive to Prescriptive Analyticscited by 143
- 2021Post-processing for Individual Fairnesscited by 61
- 2020Distributionally Robust Losses for Latent Covariate Mixturescited by 58
- 2018A Swiss Army Infinitesimal Jackknifecited by 54
15 more
- 2019Generalization Bounds in the Predict-then-Optimize Frameworkcited by 54
- 2019On the interplay between noise and curvature and its effect on optimization and generalizationcited by 44
- 2020Fast Rates for Contextual Linear Optimizationcited by 43
- 2016Asymptotic Optimality in Stochastic Optimizationcited by 38
- 2018Individual Fairness in Hindsightcited by 33
- 2018Distributionally Robust Mean-Variance Portfolio Selection with Wasserstein Distancescited by 25
- 2020Stochastic Optimization Forestscited by 20
- 2018Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensionscited by 15
- 2019Data-Pooling in Stochastic Optimizationcited by 14
- 2020Approximate Cross-validation: Guarantees for Model Assessment and Selectioncited by 14
- 2017On Optimal Generalizability in Parametric Learningcited by 12
- 2017Bootstrap Robust Prescriptive Analyticscited by 12
- 2021On Data-Driven Prescriptive Analytics with Side Information: A Regularized Nadaraya-Watson Approachcited by 12
- 2021Debiasing In-Sample Policy Performance for Small-Data, Large-Scale Optimizationcited by 10
- 2021On the Impossibility of Statistically Improving Empirical Optimization: A Second-Order Stochastic Dominance Perspectivecited by 6
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025Dissecting the Impact of Model Misspecification in Data-driven Optimizationcited by 10
- 2025DRO: A Python Library for Distributionally Robust Optimization in Machine Learningcited by 5
- 2026LLM-Inspired Pretrain-Then-Finetune for Small-Data, Large-Scale Optimizationcited by 1
- 2026When May a Model Replace the Experiment? Audits, Licenses, and the Price of Trust in Surrogate-Driven Designcited by 0
- 2026When May a Model Replace the Experiment? Audits, Licenses, and the Price of Trust in Surrogate-Driven Design2 Aug 2026
- 2026LLM-Inspired Pretrain-Then-Finetune for Small-Data, Large-Scale Optimization3 Feb 2026
- 2025DRO: A Python Library for Distributionally Robust Optimization in Machine Learning29 May 2025
- 2025Dissecting the Impact of Model Misspecification in Data-driven Optimization1 Mar 2025