Indexado en

Enlace externo

Licencia y uso

Citaciones

Altmetrics

Análisis de autorías institucional

Fernández-Sánchez DAutor (correspondencia)Garrido-Merchán EcAutor o CoautorHernández-Lobato DAutor o Coautor

Compartir

Improved max-value entropy search for multi-objective bayesian optimization with constraints

Publicado en:NEUROCOMPUTING. 546 126290- - 2023-08-14 546(), DOI: 10.1016/j.neucom.2023.126290

Autores: Fernandez-Sanchez, Daniel; Garrido-Merchan, Eduardo C; Hernandez-Lobato, Daniel

Afiliaciones

Resumen

We present MESMOC+, an improved version of Max-value Entropy search for Multi-Objective Bayesian optimization with Constraints (MESMOC). MESMOC+ can be used to solve constrained multi-objective problems when the objectives and the constraints are expensive to evaluate. It is based on minimizing the entropy of the solution of the optimization problem in function space (i.e., the Pareto front) to guide the search for the optimum. The cost of MESMOC+ is linear in the number of objectives and constraints. Furthermore, it is often significantly smaller than the cost of alternative methods based on minimizing the entropy of the Pareto set. The reason for this is that it is easier to approximate the required computations in MESMOC+. Moreover, MESMOC+’s acquisition function is expressed as the sum of one acquisition per each black-box (objective or constraint). Therefore, it can be used in a decoupled evaluation setting in which it is chosen not only the next input location to evaluate, but also which black-box to evaluate there. We compare MESMOC+ with related methods in synthetic, benchmark and real optimization problems. These experiments show that MESMOC+ has similar performance to that of state-of-the-art acquisitions based on entropy search, but it is faster to execute and simpler to implement. Moreover, our experiments also show that MESMOC+ is more robust with respect to the number of samples of the Pareto front.

Palabras clave