Journal article · 2025 · Open access

Joint entropy search for multi-objective Bayesian optimization with constraints and multiple fidelities

Daniel Fernández-Sánchez, Daniel Hernández-Lobato

Neurocomputing, 657, 131674 · Published 27 September 2025 · DOI 10.1016/j.neucom.2025.131674

Open full textCite this paper

In brief

“Joint entropy search for multi-objective Bayesian optimization with constraints and multiple fidelities” is a 2025 journal article by Daniel Fernández-Sánchez and Daniel Hernández-Lobato, published in Neurocomputing. OpenAlex counts 4 citations as of 19 November 2026, which puts it in the top 3% of works published in 2025 by citations. It is open access under a CC BY-NC-ND licence: the full text is free to read at Neurocomputing.

Citations
4
Most cited in
2026 (4)
Field-weighted impact
1.73
References
57
Authors
2

Abstract

Bayesian optimization (BO) methods can be used to solve efficiently problems with several objectives and constraints. Each objective and constraint is considered a black-box function that is expensive to evaluate, lacking also a closed-form expression. BO methods use a model of each black-box to guide the search for the problem’s solution. Specifically, they make intelligent decisions about where each black-box function should be evaluated next with the goal of finding the solution using a few evaluations only. Sometimes, however, the black-boxes may be evaluated at different fidelity levels. A lower fidelity is simply a cheap proxy of the corresponding black-box. These lower fidelities correlate with the actual black-boxes to optimize and can, therefore, be used to reduce the overall cost of solving the optimization problem. Here, we propose Multi-fidelity Joint Entropy Search for Multi-objective Bayesian Optimization with Constraints (MF-JESMOC), a BO method for solving the aforementioned problems. MF-JESMOC chooses the next point, and fidelity level at which to evaluate the black-boxes, as the combination that is expected to reduce the most the joint entropy of the Pareto set and the Pareto front, normalized by the fidelity’s evaluation cost. We use Deep Gaussian processes to model each black-box and the dependencies between fidelities. These are powerful probabilistic models that can learn the dependency structure among fidelity levels of each black-box. Several experiments show that MF-JESMOC outperforms other state-of-the-art methods for multi-objective BO with constraints and different fidelity levels in both synthetic and real-world problems. • MF-JESMOC is a multi-fidelity method for constrained multi-objective BO. • It uses an MF-DGP to model linear and non-linear dependencies among fidelities. • It selects the next point and associated fidelity to reduce the solution’s entropy. • Synthetic and real-world experiments show that it outperforms previous SOTA methods.

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., & Hernández-Lobato, D. (2025). Joint entropy search for multi-objective Bayesian optimization with constraints and multiple fidelities. Neurocomputing, 657, 131674. https://doi.org/10.1016/j.neucom.2025.131674

MLA 9

Fernández-Sánchez, Daniel, and Daniel Hernández-Lobato. “Joint entropy search for multi-objective Bayesian optimization with constraints and multiple fidelities.” Neurocomputing, vol. 657, 2025, p. 131674. https://doi.org/10.1016/j.neucom.2025.131674.

Chicago

Fernández-Sánchez, Daniel and Daniel Hernández-Lobato. 2025. “Joint entropy search for multi-objective Bayesian optimization with constraints and multiple fidelities.” Neurocomputing 657: 131674. https://doi.org/10.1016/j.neucom.2025.131674.

Harvard

Fernández-Sánchez, D. and Hernández-Lobato, D. (2025) ‘Joint entropy search for multi-objective Bayesian optimization with constraints and multiple fidelities’, Neurocomputing, 657, p. 131674. doi:10.1016/j.neucom.2025.131674.

IEEE

D. Fernández-Sánchez and D. Hernández-Lobato, “Joint entropy search for multi-objective Bayesian optimization with constraints and multiple fidelities,” Neurocomputing, vol. 657, p. 131674, 2025, doi: 10.1016/j.neucom.2025.131674.

BibTeX

@article{fernandezsanchez2025joint,
  title     = {{Joint entropy search for multi-objective Bayesian optimization with constraints and multiple fidelities}},
  author    = {Fernández-Sánchez, Daniel and Hernández-Lobato, Daniel},
  journal   = {Neurocomputing},
  year      = {2025},
  volume    = {657},
  pages     = {131674},
  doi       = {10.1016/j.neucom.2025.131674},
  url       = {https://doi.org/10.1016/j.neucom.2025.131674}
}

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

Topic and keywords

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

  • multi-fidelity Bayesian optimization
  • multi-objective Bayesian optimization
  • constrained optimization
  • deep Gaussian processes
  • Pareto front
  • Pareto set
  • 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., & Hernández-Lobato, D. (2025). Joint entropy search for multi-objective Bayesian optimization with constraints and multiple fidelities. Neurocomputing, 657, 131674. https://doi.org/10.1016/j.neucom.2025.131674

How many times has this paper been cited?

4 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, Daniel Hernández-Lobato.

What is the DOI of this paper?

10.1016/j.neucom.2025.131674, permanently at https://doi.org/10.1016/j.neucom.2025.131674. 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.