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

Multi-task Gaussian process upper confidence bound for hyperparameter tuning and its application for simulation studies of additive manufacturing

Author

Listed:
  • Bo Shen
  • Raghav Gnanasambandam
  • Rongxuan Wang
  • Zhenyu James Kong

Abstract

In many scientific and engineering applications, Bayesian Optimization (BO) is a powerful tool for hyperparameter tuning of a machine learning model, materials design and discovery, etc. Multi-task BO is a general method to efficiently optimize multiple different, but correlated, “black-box” functions. The objective of this work is to develop an algorithm for multi-task BO with automatic task selection so that only one task evaluation is needed per query round. Specifically, a new algorithm, namely, Multi-Task Gaussian Process Upper Confidence Bound (MT-GPUCB), is proposed to achieve this objective. The MT-GPUCB is a two-step algorithm, where the first step chooses which query point to evaluate, and the second step automatically selects the most informative task to evaluate. Under the bandit setting, a theoretical analysis is provided to show that our proposed MT-GPUCB is no-regret under some mild conditions. Our proposed algorithm is verified experimentally on a range of synthetic functions. In addition, our algorithm is applied to Additive Manufacturing simulation software, namely, Flow-3D Weld, to determine material property values, ensuring the quality of simulation output. The results clearly show the advantages of our query strategy for both design point and task.

Suggested Citation

  • Bo Shen & Raghav Gnanasambandam & Rongxuan Wang & Zhenyu James Kong, 2023. "Multi-task Gaussian process upper confidence bound for hyperparameter tuning and its application for simulation studies of additive manufacturing," IISE Transactions, Taylor & Francis Journals, vol. 55(5), pages 496-508, May.
  • Handle: RePEc:taf:uiiexx:v:55:y:2023:i:5:p:496-508
    DOI: 10.1080/24725854.2022.2039813
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2022.2039813
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2022.2039813?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:55:y:2023:i:5:p:496-508. 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.