IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1681-1705.html
   My bibliography  Save this article

Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty

Author

Listed:
  • Junyi Liu

    (Department of Industrial Engineering, Tsinghua University, 100084 Beijing, China)

  • Guangyu Li

    (Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, California 90089)

  • Suvrajeet Sen

    (Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, California 90089)

Abstract

Predictive analytics, empowered by machine learning, is usually followed by decision-making problems in prescriptive analytics. We extend the previous sequential prediction-optimization paradigm to a coupled scheme such that the prediction model can guide the decision problem to produce coordinated decisions yielding higher levels of performance. Specifically, for stochastic programming (SP) models with latently decision-dependent uncertainty, without any parametric assumption of the latent dependency, we develop a coupled learning enabled optimization (CLEO) algorithm in which the learning step of predicting the local dependency and the optimization step of computing a candidate decision are conducted interactively. The CLEO algorithm automatically balances the exploration and exploitation via the trust region method with active sampling. Under certain assumptions, we show that the sequence of solutions provided by CLEO converges to a directional stationary point of the original nonconvex and nonsmooth SP problem with probability 1. In addition, we present preliminary experimental results which demonstrate the computational potential of this data-driven approach.

Suggested Citation

  • Junyi Liu & Guangyu Li & Suvrajeet Sen, 2022. "Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1681-1705, May.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1681-1705
    DOI: 10.1287/moor.2021.1185
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1185
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1185?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
    ---><---

    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:ormoor:v:47:y:2022:i:2:p:1681-1705. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.