The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Smart “Predict, then Optimize”
Open accessAbstract
Many real-world analytics problems involve two significant challenges: prediction and optimization. Because of the typically complex nature of each challenge, the standard paradigm is predict-then-optimize. By and large, machine learning tools are intended to minimize prediction error and do not account for how the predictions will be used in the downstream optimization problem. In contrast, we propose a new and very general framework, called Smart “Predict, then Optimize” (SPO), which directly leverages the optimization problem structure—that is, its objective and constraints—for designing better prediction models. A key component of our framework is the SPO loss function, which measures the decision error induced by a prediction. Training a prediction model with respect to the SPO loss is computationally challenging, and, thus, we derive, using duality theory, a convex surrogate loss function, which we call the SPO+ loss. Most importantly, we prove that the SPO+ loss is statistically consistent with respect to the SPO loss under mild conditions. Our SPO+ loss function can tractably handle any polyhedral, convex, or even mixed-integer optimization problem with a linear objective. Numerical experiments on shortest-path and portfolio-optimization problems show that the SPO framework can lead to significant improvement under the predict-then-optimize paradigm, in particular, when the prediction model being trained is misspecified. We find that linear models trained using SPO+ loss tend to dominate random-forest algorithms, even when the ground truth is highly nonlinear. This paper was accepted by Yinyu Ye, optimization. Supplemental Material: Data and the online appendix are available at https://doi.org/10.1287/mnsc.2020.3922
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Optimization Methods for Large-Scale Machine Learning
Bottou, L., Curtis, F. E., & Nocedal, J. (2018) · SIAM Review · doi:10.1137/16m1080173 · Cited by 3,128
Optimization—Theory and Applications
Cesari, L. (1983) · Springer eBooks · doi:10.1007/978-1-4613-8165-5 · Cited by 2,559
Dynamic Version of the Economic Lot Size Model
Wagner, H. M., & Whitin, T. M. (1958) · Management Science · doi:10.1287/mnsc.5.1.89 · Cited by 2,061
Dynamic Version of the Economic Lot Size Model
Wagner, H. M., & Whitin, T. M. (2004) · Management Science · doi:10.1287/mnsc.1040.0262 · Cited by 2,056
The Sample Average Approximation Method for Stochastic Discrete Optimization
Kleywegt, A. J., Shapiro, A., & Homem-de-Mello, T. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499363220 · Cited by 1,983
Robust Stochastic Approximation Approach to Stochastic Programming
Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070704277 · Cited by 1,945
Kernel methods in machine learning
Hofmann, T., Schölkopf, B., & Smola, A. J. (2008) · The Annals of Statistics · doi:10.1214/009053607000000677 · Cited by 1,651
KERNEL METHODS IN MACHINE LEARNING
Hofmann, T., Schölkopf, B., & Smola, A. J. (2008) · Cited by 1,408
JuMP: A MODELING LANGUAGE FOR MATHEMATICAL OPTIMIZATION
Dunning, I., Huchette, J., & Lubin, M. (2016) · Cited by 1,355
The Existence of Probability Measures with Given Marginals
Strassen, V. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700153 · Cited by 1,301
JuMP: A Modeling Language for Mathematical Optimization
Dunning, I., Huchette, J., & Lubin, M. (2017) · SIAM Review · doi:10.1137/15m1020575 · Cited by 1,250
Taskar, B., Guestrin, C., & Koller, D. (2003) · Cited by 1,206
Convexity, Classification, and Risk Bounds
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000907 · Cited by 1,037
Molchanov, I. S. (2017) · Probability theory and stochastic modelling · doi:10.1007/978-1-4471-7349-6 · Cited by 826
From Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2020) · Management Science · doi:10.1287/mnsc.2018.3253 · Cited by 784
Data-driven robust optimization
Bertsimas, D., Gupta, V., & Kallus, N. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1125-8 · Cited by 611
Analytics for an Online Retailer: Demand Forecasting and Price Optimization
Ferreira, K. J., Lee, B. H. A., & Simchi-Levi, D. (2016) · Manufacturing & Service Operations Management · doi:10.1287/msom.2015.0561 · Cited by 538
The Big Data Newsvendor: Practical Insights from Machine Learning
Ban, G.-Y., & Rudin, C. (2019) · Operations Research · doi:10.1287/opre.2018.1757 · Cited by 507
Learning structured prediction models: a large margin approach
Taskar, B., Chatalbashev, V., Koller, D., & Guestrin, C. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102464 · Cited by 444
Convex Analysis and Nonlinear Optimization
Borwein, J. M., & Lewis, A. S. (2000) · Springer eBooks · doi:10.1007/978-1-4757-9859-3 · Cited by 394
Machine Learning and Portfolio Optimization
Ban, G.-Y., El Karoui, N., & Lim, A. E. B. (2018) · Management Science · doi:10.1287/mnsc.2016.2644 · Cited by 282
Robust and Data-Driven Optimization: Modern Decision Making Under Uncertainty
Bertsimas, D., & Thiele, A. (2006) · Models, Methods, and Applications for Innovative Decision Making · doi:10.1287/educ.1063.0022 · Cited by 280
Lacoste-Julien, S., Schmidt, M., & Bach, F. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.2002 · Cited by 269
Robust sample average approximation
Bertsimas, D., Gupta, V., & Kallus, N. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1174-z · Cited by 244
Structured Learning and Prediction in Computer Vision
Nowozin, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984579 · Cited by 239
Task-based End-to-end Model Learning in Stochastic OptimizationPreprint
Donti, P. L., Amos, B., & Kolter, J. Z. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.04529 · Cited by 231
Imputing a convex objective function
Keshavarz, A., Wang, Y., & Boyd, S. (2011) · The proceedings of the IEEE Conference on Control Applications/The proceedings of the ... IEEE Conference on Control Applications · doi:10.1109/isic.2011.6045410 · Cited by 229
On the Consistency of Multiclass Classification Methods
Tewari, A., & Bartlett, P. L. (2005) · Lecture Notes in Computer Science · doi:10.1007/11503415_10 · Cited by 228
A practical inventory control policy using operational statistics
Liyanage, L. H., & Shanthikumar, J. G. (2005) · Operations Research Letters · doi:10.1016/j.orl.2004.08.003 · Cited by 215
A note on margin-based loss functions in classification
Lin, Y. (2004) · Statistics & Probability Letters · doi:10.1016/j.spl.2004.03.002 · Cited by 181
Data Analytics in Operations Management: A Review
Mišić, V. V., & Perakis, G. (2020) · Manufacturing & Service Operations Management · doi:10.1287/msom.2019.0805 · Cited by 179
Structured Learning and Prediction in Computer Vision
Nowozin, S., & Lampert, C. H. (2011) · Foundations and Trends in Computer Graphics and Vision · doi:10.1561/0600000033 · Cited by 178
Data-driven estimation in equilibrium using inverse optimization
Bertsimas, D., Gupta, V., & Paschalidis, I. C. (2015) · Mathematical Programming · doi:10.1007/s10107-014-0819-4 · Cited by 165
Inverse Optimization with Noisy Data
Aswani, A. J., Shen, Z. M., & Siddiq, A. (2018) · Operations Research · doi:10.1287/opre.2017.1705 · Cited by 164
Optimizing Intensive Care Unit Discharge Decisions with Patient Readmissions
Chan, C. W., Farias, V. F., Bambos, N., & Escobar, G. J. (2012) · Operations Research · doi:10.1287/opre.1120.1105 · Cited by 164
Support Vector Machines are Universally Consistent
Steinwart, I. (2002) · Journal of Complexity · doi:10.1006/jcom.2002.0642 · Cited by 164
The Impact of Linear Optimization on Promotion Planning
Cohen, M. C., Leung, N.-H. Z., Panchamgam, K., Perakis, G., & Smith, A. A. (2014) · Operations Research · doi:10.1287/opre.2016.1573 · Cited by 138
On the difficulty of approximately maximizing agreements
Ben-David, S., Eiron, N., & Long, P. M. (2003) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(03)00038-2 · Cited by 134
Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy
Chan, T. C. Y., Craig, T., Lee, T., & Sharpe, M. B. (2014) · Operations Research · doi:10.1287/opre.2014.1267 · Cited by 119
Data-driven inverse optimization with imperfect information
Esfahani, P. M., Shafieezadeh-Abadeh, S., Hanasusanto, G. A., & Kühn, D. (2017) · Mathematical Programming · doi:10.1007/s10107-017-1216-6 · Cited by 94
New multicategory boosting algorithms based on multicategory Fisher-consistent losses
Zou, H., Zhu, J., & Hastie, T. J. (2008) · The Annals of Applied Statistics · doi:10.1214/08-aoas198 · Cited by 83
Initial Shipment Decisions for New Products at Zara
Gallien, J., Mersereau, A. J., Garro, A., Mora, A. D., & Vidal, M. N. (2015) · Operations Research · doi:10.1287/opre.2014.1343 · Cited by 77
Optimization in Online Content Recommendation Services: Beyond Click-Through Rates
Besbes, O., Gur, Y., & Zeevi, A. J. (2015) · Manufacturing & Service Operations Management · doi:10.1287/msom.2015.0548 · Cited by 67
OM Forum—OM Research: From Problem-Driven to Data-Driven Research
Simchi‐Levi, D. (2013) · Manufacturing & Service Operations Management · doi:10.1287/msom.2013.0471 · Cited by 62
The limitations of optimization from samples
Balkanski, E., Rubinstein, A., & Singer, Y. (2017) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3055399.3055406 · Cited by 56
Business Analytics for Flexible Resource Allocation Under Random Emergencies
Angalakudati, M., Balwani, S., Calzada, J., Chatterjee, B., Perakis, G., Raad, N., & UICHANCO, J. A. V. (2014) · Management Science · doi:10.1287/mnsc.2014.1919 · Cited by 50
Testing the Validity of a Demand Model: An Operations Perspective
Besbes, O., Phillips, R., & Zeevi, A. (2010) · Manufacturing & Service Operations Management · doi:10.1287/msom.1090.0264 · Cited by 47
Planning for HIV Screening, Testing, and Care at the Veterans Health Administration
Deo, S., Rajaram, K., Rath, S., Karmarkar, U. S., & Goetz, M. B. (2015) · Operations Research · doi:10.1287/opre.2015.1353 · Cited by 37
Kao, Y.-H., Roy, B. V., & Yan, X. (2009) · Cited by 36
Prioritizing Burn-Injured Patients During a Disaster
Chan, C. W., Green, L. V., Lu, Y., Leahy, N. E., & Yurt, R. W. (2012) · Manufacturing & Service Operations Management · doi:10.1287/msom.1120.0412 · Cited by 33
Small-Data, Large-Scale Linear OptimizationPreprint
Gupta, V., & Rusmevichientong, P. (2017) · SSRN Electronic Journal · doi:10.2139/ssrn.3065655 · Cited by 4
Cited by
Forecasting: theory and practice
Petropoulos, F., Apiletti, D., Assimakopoulos, V., Babai, M. Z., Barrow, D. K., Ben Taieb, S., Bergmeir, C., Bessa, R. J., Bijak, J., Boylan, J. E., et al. (2022) · International Journal of Forecasting · doi:10.1016/j.ijforecast.2021.11.001 · Cited by 921
Tackling climate change with machine learning
Rolnick, D., Donti, P. L., Kaack, L. H., Kochanski, K., Lacoste, A., Sankaran, K., Ross, A. S., Milojevic-Dupont, N., Jaques, N., Waldman-Brown, A., et al. (2023) · ACM Computing Surveys · doi:10.1145/3485128 · Cited by 336
Intelligent digital twin (iDT) for supply chain stress-testing, resilience, and viability
Ivanov, D. (2023) · International Journal of Production Economics · doi:10.1016/j.ijpe.2023.108938 · Cited by 270
Bootstrap Robust Prescriptive Analytics
Bertsimas, D., & Van Parys, B. (2017) · arXiv · doi:10.48550/arxiv.1711.09974 · Cited by 51
Predictive and prescriptive analytics toward passenger-centric ground delay programs
Jacquillat, A. (2022) · Transportation Science · doi:10.1287/trsc.2021.1081 · Cited by 18
Metadata
- Authors
- Elmachtoub, A. N., & Grigas, P.
- Venue
- Management Science
- Published
- 2022-01
- Volume
- 68
- Issue
- 1
- Pages
- 9-26
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2766820687
- Cited by
- 773
- References
- 56
- FWCI
- 52.10
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.