IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v68y2022i6p4236-4245.html
   My bibliography  Save this article

Fast Rates for Contextual Linear Optimization

Author

Listed:
  • Yichun Hu

    (School of Operations Research and Information Engineering and Cornell Tech, Cornell University, New York, New York 10044)

  • Nathan Kallus

    (School of Operations Research and Information Engineering and Cornell Tech, Cornell University, New York, New York 10044)

  • Xiaojie Mao

    (School of Economics and Management, Tsinghua University, Beijing 100084, China)

Abstract

Incorporating side observations in decision making can reduce uncertainty and boost performance, but it also requires that we tackle a potentially complex predictive relationship. Although one may use off-the-shelf machine learning methods to separately learn a predictive model and plug it in, a variety of recent methods instead integrate estimation and optimization by fitting the model to directly optimize downstream decision performance. Surprisingly, in the case of contextual linear optimization, we show that the naïve plug-in approach actually achieves regret convergence rates that are significantly faster than methods that directly optimize downstream decision performance. We show this by leveraging the fact that specific problem instances do not have arbitrarily bad near-dual-degeneracy. Although there are other pros and cons to consider as we discuss and illustrate numerically, our results highlight a nuanced landscape for the enterprise to integrate estimation and optimization. Our results are overall positive for practice: predictive models are easy and fast to train using existing tools; simple to interpret; and, as we show, lead to decisions that perform very well.

Suggested Citation

  • Yichun Hu & Nathan Kallus & Xiaojie Mao, 2022. "Fast Rates for Contextual Linear Optimization," Management Science, INFORMS, vol. 68(6), pages 4236-4245, June.
  • Handle: RePEc:inm:ormnsc:v:68:y:2022:i:6:p:4236-4245
    DOI: 10.1287/mnsc.2022.4383
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2022.4383
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2022.4383?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Gah-Yi Ban & Cynthia Rudin, 2019. "The Big Data Newsvendor: Practical Insights from Machine Learning," Operations Research, INFORMS, vol. 67(1), pages 90-108, January.
    2. Hamsa Bastani & Mohsen Bayati, 2020. "Online Decision Making with High-Dimensional Covariates," Operations Research, INFORMS, vol. 68(1), pages 276-294, January.
    3. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pan Zhao & Yifan Cui, 2023. "A Semiparametric Instrumented Difference-in-Differences Approach to Policy Learning," Papers 2310.09545, arXiv.org.
    2. Nathan Kallus & Xiaojie Mao, 2023. "Stochastic Optimization Forests," Management Science, INFORMS, vol. 69(4), pages 1975-1994, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yinchu Zhu & Ilya O. Ryzhov, 2022. "Optimal data-driven hiring with equity for underrepresented groups," Papers 2206.09300, arXiv.org.
    2. Viet Anh Nguyen & Fan Zhang & Shanshan Wang & Jose Blanchet & Erick Delage & Yinyu Ye, 2021. "Robustifying Conditional Portfolio Decisions via Optimal Transport," Papers 2103.16451, arXiv.org, revised Apr 2024.
    3. Meng Qi & Ying Cao & Zuo-Jun (Max) Shen, 2022. "Distributionally Robust Conditional Quantile Prediction with Fixed Design," Management Science, INFORMS, vol. 68(3), pages 1639-1658, March.
    4. Jos'e-Manuel Pe~na & Fernando Su'arez & Omar Larr'e & Domingo Ram'irez & Arturo Cifuentes, 2023. "A Modified CTGAN-Plus-Features Based Method for Optimal Asset Allocation," Papers 2302.02269, arXiv.org, revised Feb 2023.
    5. Yang, Cheng-Hu & Wang, Hai-Tang & Ma, Xin & Talluri, Srinivas, 2023. "A data-driven newsvendor problem: A high-dimensional and mixed-frequency method," International Journal of Production Economics, Elsevier, vol. 266(C).
    6. Adam N. Elmachtoub & Paul Grigas, 2022. "Smart “Predict, then Optimize”," Management Science, INFORMS, vol. 68(1), pages 9-26, January.
    7. Christian Mandl & Selvaprabu Nadarajah & Stefan Minner & Srinagesh Gavirneni, 2022. "Data‐driven storage operations: Cross‐commodity backtest and structured policies," Production and Operations Management, Production and Operations Management Society, vol. 31(6), pages 2438-2456, June.
    8. Andrew Butler & Roy H. Kwon, 2021. "Integrating prediction in mean-variance portfolio optimization," Papers 2102.09287, arXiv.org, revised Nov 2022.
    9. Shaochong Lin & Youhua (Frank) Chen & Yanzhi Li & Zuo‐Jun Max Shen, 2022. "Data‐Driven Newsvendor Problems Regularized by a Profit Risk Constraint," Production and Operations Management, Production and Operations Management Society, vol. 31(4), pages 1630-1644, April.
    10. Susan Athey & Stefan Wager, 2021. "Policy Learning With Observational Data," Econometrica, Econometric Society, vol. 89(1), pages 133-161, January.
    11. Nam Ho-Nguyen & Fatma Kılınç-Karzan, 2022. "Risk Guarantees for End-to-End Prediction and Optimization Processes," Management Science, INFORMS, vol. 68(12), pages 8680-8698, December.
    12. Liu, Congzheng & Letchford, Adam N. & Svetunkov, Ivan, 2022. "Newsvendor problems: An integrated method for estimation and optimisation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 590-601.
    13. Corredera, Alberto & Ruiz, Carlos, 2023. "Prescriptive selection of machine learning hyperparameters with applications in power markets: Retailer’s optimal trading," European Journal of Operational Research, Elsevier, vol. 306(1), pages 370-388.
    14. Shuaian Wang & Xuecheng Tian, 2023. "A Deficiency of the Predict-Then-Optimize Framework: Decreased Decision Quality with Increased Data Size," Mathematics, MDPI, vol. 11(15), pages 1-9, July.
    15. Long He & Sheng Liu & Zuo‐Jun Max Shen, 2022. "Smart urban transport and logistics: A business analytics perspective," Production and Operations Management, Production and Operations Management Society, vol. 31(10), pages 3771-3787, October.
    16. Thais de Castro Moraes & Jiancheng Qin & Xue-Ming Yuan & Ek Peng Chew, 2023. "Evolving Hybrid Deep Neural Network Models for End-to-End Inventory Ordering Decisions," Logistics, MDPI, vol. 7(4), pages 1-18, November.
    17. Erkip, Nesim Kohen, 2023. "Can accessing much data reshape the theory? Inventory theory under the challenge of data-driven systems," European Journal of Operational Research, Elsevier, vol. 308(3), pages 949-959.
    18. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    19. Notz, Pascal M. & Wolf, Peter K. & Pibernik, Richard, 2023. "Prescriptive analytics for a multi-shift staffing problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 887-901.
    20. Muñoz, M.A. & Pineda, S. & Morales, J.M., 2022. "A bilevel framework for decision-making under uncertainty with contextual information," Omega, Elsevier, vol. 108(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:68:y:2022:i:6:p:4236-4245. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.