mlsanityData to 14 Oct 2026

From Predictions to Prescriptions in Multistage Optimization Problems

arXiv 1904.11637 ↗First posted 26 Apr 2019stat.ML cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

In this paper, we introduce a framework for solving finite-horizon multistage optimization problems under uncertainty in the presence of auxiliary data. We assume the joint distribution of the uncertain quantities is unknown, but noisy observations, along with observations of auxiliary covariates, are available. We utilize effective predictive methods from machine learning (ML), including k-nearest neighbors regression (kNN), classification and regression trees (CART), and random forests (RF), to develop specific methods that are applicable to a wide variety of problems. We demonstrate that our solution methods are asymptotically optimal under mild conditions. Additionally, we establish finite sample guarantees for the optimality of our method with kNN weight functions. Finally, we demonstrate the practicality of our approach with computational examples. We see a significant decrease in cost by taking into account the auxiliary data in the multistage setting.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Apr 2019.

Builds on

No reference list yet.

Built on by

Cited by year

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

7 papers.