journal article·2023-07-19Open access

A Deficiency of the Weighted Sample Average Approximation (wSAA) Framework: Unveiling the Gap between Data-Driven Policies and Oracles

Shuaian Wang, Xuecheng Tian

Applied Sciences· Volume 13· Issue 14

Abstract

This paper critically examines the weighted sample average approximation (wSAA) framework, a widely used approach in prescriptive analytics for managing uncertain optimization problems featuring non-linear objectives. Our research pinpoints a key deficiency of the wSAA framework: when data samples are limited, the minimum relative regret—the discrepancy between the expected optimal profit realized by an oracle aware of the genuine distribution, and the maximum expected out-of-sample profit garnered by the data-driven policy, normalized by the former profit—can approach towards one. To validate this assertion, we scrutinize two distinct contextual stochastic optimization problems—the production decision-making problem and the ship maintenance optimization problem—within the wSAA framework. Our study exposes a potential deficiency of the wSAA framework: its decision performance markedly deviates from the full-information optimal solution under limited data samples. This finding offers valuable insights to both researchers and practitioners employing the wSAA framework.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Risk and Portfolio Optimization · Multi-Criteria Decision Making · Water resources management and optimization

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Faculty of Business, The Hong Kong Polytechnic University, Hung Hom, Hong Kong

References (20)

Show source-provided references
1. Tutorial on prescriptive analytics for logistics: What to predict and how to predict10.3934/era.2023116 ↗
2. Data-driven optimization: A Reproducing Kernel Hilbert Space approach10.1287/opre.2020.2069 ↗
3. Birge, J., and Louveaux, F. (2011). Introduction to Stochatic Programming, Springer.10.1007/978-1-4614-0237-4 ↗
4. Ben-Tal, A., EL Ghaoui, L., and Nemirovski, A. (2009). Robust Programming, Princeton University Press.
5. Theory and applications of robust optimization10.1137/080734510 ↗
6. Qi, M., and Shen, Z. (2022). Tutorials in Operations Research: Emerging and Impactful Topics in Operations, INFORMS.
7. The sample average approximation for stochastic discrete optimization10.1137/S1052623499363220 ↗
8. Data-driven robust optimization10.1007/s10107-017-1125-8 ↗
9. Distributionally robust optimization under moment uncertainty with application to data-driven problems10.1287/opre.1090.0741 ↗
10. From predictive to prescriptive analytics10.1287/mnsc.2018.3253 ↗
11. Stochastic optimization forests10.1287/mnsc.2022.4458 ↗
12. The big data newsvendor: Practical insights from machine learning10.1287/opre.2018.1757 ↗
13. Smart “predict, then optimize”10.1287/mnsc.2020.3922 ↗
14. Prescriptive analytics for flexible capacity management10.1287/mnsc.2020.3867 ↗
15. A smart predict-then-optimize method for targeted and cost-effective maritime transportation10.1016/j.trb.2023.03.009 ↗
16. Robust defibrillator deployment under cardiac arrest location uncertainty via row-and-column generation10.1287/opre.2017.1660 ↗
17. On estimating regression10.1137/1109020 ↗
18. Smooth regression analysis
19. El Balghiti, O., Elmachtoub, A.N., Grigas, P., and Tewari, A. (2023). Generalization bounds in the predict-then-optimize framework. Math. Oper. Res., in press.10.1287/moor.2022.1330 ↗
20. Besbes, O., and Mouchtaki, O. (2023). How big should your data really be? Data-driven newsvendor: Learning one sample at a time. Manag. Sci., in press.10.1287/mnsc.2023.4725 ↗