Preprint · 2021 · Open access

Many Objective Bayesian Optimization

Lucia Asencio-Martín, Eduardo C. Garrido‐Merchán

arXiv (Cornell University) · Published 8 July 2021 · DOI 10.48550/arxiv.2107.04126

Open PDFView at the publisherCite this paper

In brief

“Many Objective Bayesian Optimization” is a 2021 preprint by Lucia Asencio-Martín and Eduardo C. Garrido‐Merchán, published in arXiv (Cornell University). OpenAlex counts 12 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
12
Most cited in
2023 (4)
References
26
Authors
2

Abstract

Some real problems require the evaluation of expensive and noisy objective functions. Moreover, the analytical expression of these objective functions may be unknown. These functions are known as black-boxes, for example, estimating the generalization error of a machine learning algorithm and computing its prediction time in terms of its hyper-parameters. Multi-objective Bayesian optimization (MOBO) is a set of methods that has been successfully applied for the simultaneous optimization of black-boxes. Concretely, BO methods rely on a probabilistic model of the objective functions, typically a Gaussian process. This model generates a predictive distribution of the objectives. However, MOBO methods have problems when the number of objectives in a multi-objective optimization problem are 3 or more, which is the many objective setting. In particular, the BO process is more costly as more objectives are considered, computing the quality of the solution via the hyper-volume is also more costly and, most importantly, we have to evaluate every objective function, wasting expensive computational, economic or other resources. However, as more objectives are involved in the optimization problem, it is highly probable that some of them are redundant and not add information about the problem solution. A measure that represents how similar are GP predictive distributions is proposed. We also propose a many objective Bayesian optimization algorithm that uses this metric to determine whether two objectives are redundant. The algorithm stops evaluating one of them if the similarity is found, saving resources and not hurting the performance of the multi-objective BO algorithm. We show empirical evidence in a set of toy, synthetic, benchmark and real experiments that GPs predictive distributions of the effectiveness of the metric and the algorithm.

Cite this paper

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

APA 7

Asencio-Martín, L., & Garrido‐Merchán, E. C. (2021). Many Objective Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2107.04126

MLA 9

Asencio-Martín, Lucia, and Eduardo C. Garrido‐Merchán. “Many Objective Bayesian Optimization.” arXiv (Cornell University), 2021. https://doi.org/10.48550/arxiv.2107.04126.

Chicago

Asencio-Martín, Lucia and Eduardo C. Garrido‐Merchán. 2021. “Many Objective Bayesian Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2107.04126.

Harvard

Asencio-Martín, L. and Garrido‐Merchán, E. C. (2021) ‘Many Objective Bayesian Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.2107.04126.

IEEE

L. Asencio-Martín and E. C. Garrido‐Merchán, “Many Objective Bayesian Optimization,” arXiv (Cornell University), 2021, doi: 10.48550/arxiv.2107.04126.

BibTeX

@misc{asenciomartin2021many,
  title     = {{Many Objective Bayesian Optimization}},
  author    = {Asencio-Martín, Lucia and Garrido‐Merchán, Eduardo C.},
  howpublished = {arXiv (Cornell University)},
  year      = {2021},
  doi       = {10.48550/arxiv.2107.04126},
  url       = {https://doi.org/10.48550/arxiv.2107.04126}
}

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

Citations by year

YearCitationsShare of the best year
202344
202411
202533
202644

Topic and keywords

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

  • multi-objective Bayesian optimization
  • black-box optimization
  • resource conservation

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?

Asencio-Martín, L., & Garrido‐Merchán, E. C. (2021). Many Objective Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2107.04126

How many times has this paper been cited?

12 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 arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Lucia Asencio-Martín, Eduardo C. Garrido‐Merchán.

What is the DOI of this paper?

10.48550/arxiv.2107.04126, permanently at https://doi.org/10.48550/arxiv.2107.04126. 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.