Journal article · 2023 · Open access

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

Daniel Fernández-Sánchez, Eduardo C. Garrido‐Merchán, Daniel Hernández-Lobato

Neurocomputing, 546, 126290 · Published 12 May 2023 · DOI 10.1016/j.neucom.2023.126290

Open full textCite this paper

In brief

“Improved max-value entropy search for multi-objective bayesian optimization with constraints” is a 2023 journal article by Daniel Fernández-Sánchez and 2 co-authors, published in Neurocomputing. OpenAlex counts 27 citations as of 19 November 2026, which puts it in the top 9% of works published in 2023 by citations. It is open access under a CC BY-NC-ND licence: the full text is free to read at Neurocomputing.

Citations
27
Most cited in
2025 (10)
Field-weighted impact
2.68
References
42
Authors
3

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.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Fernández-Sánchez, D., Garrido‐Merchán, E. C., & Hernández-Lobato, D. (2023). Improved max-value entropy search for multi-objective bayesian optimization with constraints. Neurocomputing, 546, 126290. https://doi.org/10.1016/j.neucom.2023.126290

MLA 9

Fernández-Sánchez, Daniel, et al. “Improved max-value entropy search for multi-objective bayesian optimization with constraints.” Neurocomputing, vol. 546, 2023, p. 126290. https://doi.org/10.1016/j.neucom.2023.126290.

Chicago

Fernández-Sánchez, Daniel, Eduardo C. Garrido‐Merchán, and Daniel Hernández-Lobato. 2023. “Improved max-value entropy search for multi-objective bayesian optimization with constraints.” Neurocomputing 546: 126290. https://doi.org/10.1016/j.neucom.2023.126290.

Harvard

Fernández-Sánchez, D., Garrido‐Merchán, E. C. and Hernández-Lobato, D. (2023) ‘Improved max-value entropy search for multi-objective bayesian optimization with constraints’, Neurocomputing, 546, p. 126290. doi:10.1016/j.neucom.2023.126290.

IEEE

D. Fernández-Sánchez, E. C. Garrido‐Merchán, and D. Hernández-Lobato, “Improved max-value entropy search for multi-objective bayesian optimization with constraints,” Neurocomputing, vol. 546, p. 126290, 2023, doi: 10.1016/j.neucom.2023.126290.

BibTeX

@article{fernandezsanchez2023improved,
  title     = {{Improved max-value entropy search for multi-objective bayesian optimization with constraints}},
  author    = {Fernández-Sánchez, Daniel and Garrido‐Merchán, Eduardo C. and Hernández-Lobato, Daniel},
  journal   = {Neurocomputing},
  year      = {2023},
  volume    = {546},
  pages     = {126290},
  doi       = {10.1016/j.neucom.2023.126290},
  url       = {https://doi.org/10.1016/j.neucom.2023.126290}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202155
202222
202344
202444
20251010
202622

Its field-weighted citation impact is 2.68: it has been cited 2.68 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • multi-objective Bayesian optimization
  • constrained optimization
  • acquisition functions
  • Pareto front
  • expensive black-box functions

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Fernández-Sánchez, D., Garrido‐Merchán, E. C., & Hernández-Lobato, D. (2023). Improved max-value entropy search for multi-objective bayesian optimization with constraints. Neurocomputing, 546, 126290. https://doi.org/10.1016/j.neucom.2023.126290

How many times has this paper been cited?

27 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Neurocomputing: sign in and open the full text from this page.

Who wrote this paper?

Daniel Fernández-Sánchez, Eduardo C. Garrido‐Merchán, Daniel Hernández-Lobato.

What is the DOI of this paper?

10.1016/j.neucom.2023.126290, permanently at https://doi.org/10.1016/j.neucom.2023.126290. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.