{rfName}
Im

Indexed in

License and use

Altmetrics

Analysis of institutional authors

Fernández-Sánchez DCorresponding AuthorGarrido-Merchán EcAuthorHernández-Lobato DAuthor

Share

Publications
>
Article

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

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

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

Affiliations

Abstract

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.

Keywords

constrained multi-objective scenarioinformation theoryBayesian optimizationConstrained multi-objective scenarioInformation theory

Quality index

Bibliometric impact. Analysis of the contribution and dissemination channel

The work has been published in the journal NEUROCOMPUTING due to its progression and the good impact it has achieved in recent years, according to the agency WoS (JCR), it has become a reference in its field. In the year of publication of the work, 2023, it was in position 42/197, thus managing to position itself as a Q1 (Primer Cuartil), in the category Computer Science, Artificial Intelligence.

Independientemente del impacto esperado determinado por el canal de difusión, es importante destacar el impacto real observado de la propia aportación.

Según las diferentes agencias de indexación, el número de citas acumuladas por esta publicación hasta la fecha 2025-06-01:

  • WoS: 5
  • Scopus: 9
  • OpenCitations: 2

Impact and social visibility

From the perspective of influence or social adoption, and based on metrics associated with mentions and interactions provided by agencies specializing in calculating the so-called "Alternative or Social Metrics," we can highlight as of 2025-06-01:

  • The use of this contribution in bookmarks, code forks, additions to favorite lists for recurrent reading, as well as general views, indicates that someone is using the publication as a basis for their current work. This may be a notable indicator of future more formal and academic citations. This claim is supported by the result of the "Capture" indicator, which yields a total of: 14 (PlumX).

It is essential to present evidence supporting full alignment with institutional principles and guidelines on Open Science and the Conservation and Dissemination of Intellectual Heritage. A clear example of this is:

Leadership analysis of institutional authors

There is a significant leadership presence as some of the institution’s authors appear as the first or last signer, detailed as follows: First Author (FERNANDEZ SANCHEZ, DANIEL) and Last Author (HERNANDEZ LOBATO, DANIEL).

the author responsible for correspondence tasks has been FERNANDEZ SANCHEZ, DANIEL.