2026-09-19T00:34:09Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1563312024-08-22T03:25:36Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Luković, Mina Konaković Zuniga, Ane Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2024-08-21T18:57:23Z 2024-08-21T18:57:23Z 2024-05 2024-07-10T13:00:05.922Z https://hdl.handle.net/1721.1/156331 0000-0002-5052-9012 Multi-objective optimization problems are widespread in scientific, engineering, and design f ields, necessitating a balance of trade-offs between conflicting objectives. These objectives often represent black-box functions, which are costly and time-consuming to evaluate. Multiobjective Bayesian optimization (MOBO) offers a valuable approach to guide the search for optimal solutions. To enhance efficiency, batch evaluations are employed to test multiple samples simultaneously, aiming to further reduce evaluation times. However, in scenarios involving varying evaluation times, standard batch strategies often lead to suboptimal resource utilization and inefficiencies. Asynchronous evaluations emerge as a promising solution to optimize resource usage under these conditions. Despite their potential, there has been no prior work or method specifically tailored to address asynchronous evaluations within the MOBO framework. To bridge this critical gap, this thesis proposes a comprehensive adaptation and analysis of existing Bayesian optimization methods for asynchronous MOBO scenarios. It also introduces a novel selection strategy, α-HVI, empirically validated through tests on both synthetic and real-world functions. S.M. Massachusetts Institute of Technology In Copyright - Educational Use Permitted Copyright retained by author(s) https://rightsstatements.org/page/InC-EDU/1.0/ Multi-Objective Bayesian Optimization with Asynchronous Batch Selection Thesis application/pdf Master Master of Science in Electrical Engineering and Computer Science Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="ac60b703-56b2-48d0-b780-9f448dfd5895"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Title>Multi-Objective Bayesian Optimization with Asynchronous Batch Selection</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2024-05</PublicationDate> <Authors> <Author> <DisplayName>Zuniga, Ane</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>https://rightsstatements.org/page/InC-EDU/1.0/</License> <Abstract>Multi-objective optimization problems are widespread in scientific, engineering, and design f ields, necessitating a balance of trade-offs between conflicting objectives. These objectives often represent black-box functions, which are costly and time-consuming to evaluate. Multiobjective Bayesian optimization (MOBO) offers a valuable approach to guide the search for optimal solutions. To enhance efficiency, batch evaluations are employed to test multiple samples simultaneously, aiming to further reduce evaluation times. However, in scenarios involving varying evaluation times, standard batch strategies often lead to suboptimal resource utilization and inefficiencies. Asynchronous evaluations emerge as a promising solution to optimize resource usage under these conditions. Despite their potential, there has been no prior work or method specifically tailored to address asynchronous evaluations within the MOBO framework. To bridge this critical gap, this thesis proposes a comprehensive adaptation and analysis of existing Bayesian optimization methods for asynchronous MOBO scenarios. It also introduces a novel selection strategy, α-HVI, empirically validated through tests on both synthetic and real-world functions.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>