Pith. sign in

REVIEW 1 cited by

Optimizer's Information Criterion: Dissecting and Correcting Bias in Data-Driven Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.10081 v4 pith:KOD5HPG6 submitted 2023-06-16 cs.LG math.OC

classification cs.LGmath.OC
keywords optimizationbiasdata-drivenperformanceapproachcriterioninformationoptimizer
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DRO: A Python Library for Distributionally Robust Optimization in Machine Learning

    cs.LG 2025-05 conditional novelty 6.0 of 10

    The dro library provides a unified implementation of 14 DRO formulations across 9 model backbones, with claims of large speedups from vectorization and approximation.

Pith tools