EconBase
← All papers

Eigenvalue-Decomposition Cost Denoising as an Alternative to Predict-then-Optimize for Shortest-Path Problems

Henry Aldridge-Krawciw, Irene Aldridge

arXiv 14 Sep 2026 · Econometrics

arXiv:2609.15111 · PDF · Extracted main text

Abstract

Predict-then-optimize methods such as Smart "Predict, then Optimize" (SPO+) of Elmachtoub and Grigas (2022) learn a mapping from contextual features to unknown edge costs and then solve the induced combinatorial problem on the predicted costs. This approach is powerful but relies on the predictive model being well specified: when the true cost-generating process is nonlinear in the features and the predictor is linear, SPO+'s performance degrades as the misspecification grows. We propose and evaluate a structurally different remedy for a specific but common setting: when the decision-maker observes many noisy realizations of the same underlying cost process, the realized cost vectors themselves can be treated as a noisy signal and denoised directly, via eigenvalue decomposition (equivalently, Principal Component Analysis) of their covariance matrix, before ever invoking a predictive model. We instantiate this idea on the $5\times5$ grid shortest-path benchmark introduced by Elmachtoub and Grigas (2022), retaining only the top-$k$ eigenvectors of the training cost covariance matrix and projecting new noisy cost observations onto that subspace prior to solving with Dijkstra's (1959) algorithm. We find that the choice of $k$ is decisive: keeping only $k{=}2$ eigenvectors discards real signal and underperforms even the naive noisy-cost baseline, while setting $k{=}5$ to match the true latent feature dimension makes eigenvalue-denoised Dijkstra the best-performing method at every misspecification level tested, outperforming SPO+ by a wide margin under high misspecification.

Citation extraction

14
references
37
in-text mentions
14
distinct cited
2
self-citations
2,985
main-text words

appendix boundary found by none_found · 100% 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.00094100%
2Gavish, Matan and Donoho, David L (2014) The Optimal Hard Threshold for Singular Values is $4/ 3$0.92844100%
3Aldridge, Irene (2026) Regret Equals Covariance: A Closed-Form Characterization for Stochastic Optimization self0.84333100%
4Aldridge, Irene (2025) Optimize, Then Predict self0.64422100%
5Ban, Gah-Yi and Rudin, Cynthia (2019) The Big Data Newsvendor: Practical Insights from Machine Learning0.64422100%
6Bertsimas, Dimitris and Kallus, Nathan (2020) From Predictive to Prescriptive Analytics0.64422100%
7Chen, Shigang and Song, Meongchul and Sahni, Sartaj (2004) Two Techniques for Fast Computation of Constrained Shortest Paths0.64422100%
8Dijkstra, Edsger W (1959) A Note on Two Problems in Connexion with Graphs0.64422100%
9Donti, Priya and Amos, Brandon and Kolter, J. Zico (2017) Task-Based End-to-End Model Learning in Stochastic Optimization0.64422100%
10Hotelling, Harold (1933) Analysis of a Complex of Statistical Variables into Principal Components0.64422100%

Showing the top 10 of 14 scored citations.