arXiv 13 May 2026 · Econometrics
arXiv:2605.14019 · PDF · DOI · OpenAlex · Extracted main text
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.
appendix boundary found by appendix_command · 80% of the source is main text. Read the extracted text to check this.
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.
| Reference | Intensity | Mentions | Sections | Main text | |
|---|---|---|---|---|---|
| 1 | Elmachtoub, Adam N. and Grigas, Paul (2022) Smart “Predict, then Optimize” | 1.000 | 11 | 4 | 100% |
| 2 | Kleywegt, Anton J. and Shapiro, Alexander and Homem-de-Mello, Tito (2002) The Sample Average Approximation Method for Stochastic Discrete Optimization | 0.737 | 3 | 2 | 100% |
| 3 | King, Alan J and Wallace, Stein W (2012) Modeling with stochastic programming | 0.737 | 3 | 2 | 100% |
| 4 | Shapiro, A Inference of statistical bounds for multistage stochastic programming problems. | 0.644 | 2 | 2 | 100% |
| 5 | Hazan, Elad (2016) Introduction to Online Convex Optimization | 0.511 | 2 | 1 | 100% |
| 6 | Lam, Henry and Zhou, Enlu (2023) Confidence Regions in Wasserstein Distributionally Robust Estimation | 0.511 | 2 | 1 | 100% |
| 7 | Shalev-Shwartz, Shai (2012) Online Learning and Online Convex Optimization | 0.511 | 2 | 1 | 100% |
| 8 | Bayraksan, Güzin and Love, David K (2015) Separability and decomposition in SAA for stochastic mixed-integer programming | 0.511 | 2 | 1 | 100% |
| 9 | Chen, Zhiwei Steven and Kuhn, Daniel and Pang, Wolfram (2023) Finite-sample guarantees for Wasserstein distributionally robust optimization: Breaking the curse of dimensionality | 0.511 | 2 | 1 | 100% |
| 10 | Donti, Priya L and Amos, Brandon and Kolter, J Zico (2017) Task-based end-to-end model learning in stochastic optimization | 0.511 | 2 | 1 | 100% |
Showing the top 10 of 97 scored citations.
arXiv econ.EM papers that cite this one, ranked by how heavily they lean on it.
| Citing paper | Intensity | Mentions | Sections | |
|---|---|---|---|---|
| 1 | Evaluating AI Investment Strategies | 0.928 | 4 | 4 |
| 2 | Liquidity-Based Audit of Algorithmic Trading Strategies | 0.405 | 1 | 1 |