IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v72y2024i6p2526-2542.html
   My bibliography  Save this article

Sequential Learning with a Similarity Selection Index

Author

Listed:
  • Yi Zhou

    (Department of Mathematics, University of Maryland, College Park, Maryland 20742)

  • Michael C. Fu

    (Institute for Systems Research, University of Maryland, College Park, Maryland 20742; Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742)

  • Ilya O. Ryzhov

    (Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742)

Abstract

We consider the problem of selecting the best alternative in a setting where prior similarity information between the performance output of different alternatives can be learned from data. Incorporating similarity information enables efficient budget allocation for faster identification of the best alternative in sequential selection. Using a new selection criterion, the similarity selection index, we develop two new allocation methods: one based on a mathematical programming characterization of the asymptotically optimal budget allocation and the other based on a myopic expected improvement measure. For the former, we present a novel sequential implementation that provably learns the optimal allocation without tuning. For the latter, we derive its asymptotic sampling ratios. We also propose a practical way to update the prior similarity information as new samples are collected. Numerical results illustrate the effectiveness of both methods.

Suggested Citation

  • Yi Zhou & Michael C. Fu & Ilya O. Ryzhov, 2024. "Sequential Learning with a Similarity Selection Index," Operations Research, INFORMS, vol. 72(6), pages 2526-2542, November.
    • Handle: RePEc:inm:oropre:v:72:y:2024:i:6:p:2526-2542
    DOI: 10.1287/opre.2023.2478
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2023.2478
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2023.2478?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:oropre:v:72:y:2024:i:6:p:2526-2542. 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.