mlsanityData to 7 Oct 2026

Learning and Decision-Making with Data: Optimal Formulations and Phase Transitions

arXiv 2109.06911 ↗First posted 14 Sep 2021stat.ML cs.LG math.OCcited by 7

Not on the map. Why?

Abstract (arXiv)

We study the problem of designing optimal learning and decision-making formulations when only historical data is available. Prior work typically commits to a particular class of data-driven formulation and subsequently tries to establish out-of-sample performance guarantees. We take here the opposite approach. We define first a sensible yard stick with which to measure the quality of any data-driven formulation and subsequently seek to find an optimal such formulation. Informally, any data-driven formulation can be seen to balance a measure of proximity of the estimated cost to the actual cost while guaranteeing a level of out-of-sample performance. Given an acceptable level of out-of-sample performance, we construct explicitly a data-driven formulation that is uniformly closer to the true cost than any other formulation enjoying the same out-of-sample performance. We show the existence of three distinct out-of-sample performance regimes (a superexponential regime, an exponential regime and a subexponential regime) between which the nature of the optimal data-driven formulation experiences a phase transition. The optimal data-driven formulations can be interpreted as a classically robust formulation in the superexponential regime, an entropic distributionally robust formulation in the exponential regime and finally a variance penalized formulation in the subexponential regime. This final observation unveils a surprising connection between these three, at first glance seemingly unrelated, data-driven formulations which until now remained hidden.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 14 of its 49 references that are in the map. First posted on arXiv 14 Sep 2021.

Builds on

14 of 49 references.

References · 14

  1. 2017Smart "Predict, then Optimize"cited by 332
  2. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  3. 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 182
  4. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 169
  5. 2016Variance-based regularization with convex objectivescited by 153
  6. 2013Data-Driven Robust Optimizationcited by 84
  7. 2017From Data to Decisions: Distributionally Robust Optimization is Optimalcited by 36
  8. 2016Recovering Best Statistical Guarantees via the Empirical Divergence-based Distributionally Robust Optimizationcited by 33
  9. 2014Robust Sample Average Approximationcited by 25
  10. 2017Wasserstein Distributionally Robust Optimization and Variation Regularizationcited by 25
  11. 2021How Big Should Your Data Really Be? Data-Driven Newsvendor: Learning One Sample at a Timecited by 9
  12. 2017Calibration of Distributionally Robust Empirical Optimization Modelscited by 6
2 more
  1. 2021Efficient Learning of a Linear Dynamical System with Stability Guaranteescited by 3
  2. 2021Topological Linear System Identification via Moderate Deviations Theorycited by 2

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 2; 2023: 3; 2024: 0; 2025: 1.

7 papers.