EconBase
← All papers

Regret Equals Covariance: A Closed-Form Characterization for Stochastic Optimization

Irene Aldridge

arXiv 13 May 2026 · Econometrics

arXiv:2605.14019 · PDF · DOI · OpenAlex · Extracted main text

Abstract

Regret is the cost of uncertainty in algorithmic decision-making. Quantifying regret typically requires computationally expensive simulation via Sample Average Approximation (SAA), with complexity $\mathcal{O}(Bn^{2}d^{3})$ in the number of scenarios $B$, variables $n$, and constraints $d$. % This paper proves that expected regret in any stochastic optimization problem admits the exact decomposition % \begin{equation*} Regret(c) = Cov(c,\,π^{*}(c)) + R(c), \end{equation*} % where $c$ is the vector of uncertain parameters, $π^{*}(c)$ is the optimal decision, and $R(c)$ is a residual whose magnitude we bound explicitly under Lipschitz, smooth, and strongly convex conditions. % For linear programs and unconstrained quadratic programs, including the classical Markowitz portfolio problem, we prove $R(c)=0$ exactly, so that $Regret(c) = Cov(c,π^{*}(c))$ holds without approximation. % When historical cost-decision pairs ${(c_i, π^*(c_i))}$ are available, the covariance can be estimated in $\mathcal{O}(nd^{2})$ time, which is orders of magnitude faster than SAA. The estimation is performed by a single pass through the data. % We derive concentration bounds, a central limit theorem, and an asymptotically unbiased residual estimator, and we validate all results on synthetic LP, QP, and integer programming instances and on a rolling-window portfolio experiment using ten years of CRSP equity data.

Citation extraction

97
references
122
in-text mentions
97
distinct cited
0
self-citations
12,590
main-text words

appendix boundary found by appendix_command · 80% of the source is main text. Read the extracted text to check this.

Most heavily cited references

The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.

ReferenceIntensityMentionsSectionsMain text
1Elmachtoub, Adam N. and Grigas, Paul (2022) Smart “Predict, then Optimize”1.000114100%
2Kleywegt, Anton J. and Shapiro, Alexander and Homem-de-Mello, Tito (2002) The Sample Average Approximation Method for Stochastic Discrete Optimization0.73732100%
3King, Alan J and Wallace, Stein W (2012) Modeling with stochastic programming0.73732100%
4Shapiro, A Inference of statistical bounds for multistage stochastic programming problems.0.64422100%
5Hazan, Elad (2016) Introduction to Online Convex Optimization0.51121100%
6Lam, Henry and Zhou, Enlu (2023) Confidence Regions in Wasserstein Distributionally Robust Estimation0.51121100%
7Shalev-Shwartz, Shai (2012) Online Learning and Online Convex Optimization0.51121100%
8Bayraksan, Güzin and Love, David K (2015) Separability and decomposition in SAA for stochastic mixed-integer programming0.51121100%
9Chen, Zhiwei Steven and Kuhn, Daniel and Pang, Wolfram (2023) Finite-sample guarantees for Wasserstein distributionally robust optimization: Breaking the curse of dimensionality0.51121100%
10Donti, Priya L and Amos, Brandon and Kolter, J Zico (2017) Task-based end-to-end model learning in stochastic optimization0.51121100%

Showing the top 10 of 97 scored citations.

Cited by, within the corpus

arXiv econ.EM papers that cite this one, ranked by how heavily they lean on it.

Citing paperIntensityMentionsSections
1Evaluating AI Investment Strategies0.92844
2Liquidity-Based Audit of Algorithmic Trading Strategies0.40511