IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v54y2022i11p1019-1032.html
   My bibliography  Save this article

Offline sequential learning via simulation

Author

Listed:
  • Haitao Liu
  • Hui Xiao
  • Haobin Li
  • Loo Hay Lee
  • Ek Peng Chew

Abstract

Simulation has been widely used for static system designs, but it is rarely used in making online decisions, due to the time delay of executing simulation. We consider a system with stochastic binary outcomes that can be predicted via a logistic model depending on scenarios and decisions. The goal is to identify all feasible decisions conditioning on any online scenario. We propose to learn offline the relationship among scenarios, decisions, and binary outcomes. An Information Gradient (IG) policy is developed to sequentially allocate offline simulation budget. We show that the maximum likelihood estimator produced via the IG policy is consistent and asymptotically normal. Numerical results on synthetic data and a case study demonstrate the superior performance of the IG policy than benchmark policies. Moreover, we find that the IG policy tends to sample the location near boundaries of the design space, due to its higher Fisher information, and that the time complexity of the IG policy is linear to the number of design points and simulation budget.

Suggested Citation

  • Haitao Liu & Hui Xiao & Haobin Li & Loo Hay Lee & Ek Peng Chew, 2022. "Offline sequential learning via simulation," IISE Transactions, Taylor & Francis Journals, vol. 54(11), pages 1019-1032, November.
    • Handle: RePEc:taf:uiiexx:v:54:y:2022:i:11:p:1019-1032
    DOI: 10.1080/24725854.2021.1968079
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2021.1968079
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2021.1968079?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:uiiexx:v:54:y:2022:i:11:p:1019-1032. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.