Journal article · 2026 · Open access
Pareto-based selection strategies for batch Bayesian optimization of expensive black-box functions
AIMS Mathematics, 11(7), 22166–22204 · Published 1 January 2026 · DOI 10.3934/math.2026898
In brief
“Pareto-based selection strategies for batch Bayesian optimization of expensive black-box functions” is a 2026 journal article by Kittisak Chaiyotha and Tipaluck Krityakierne, published in AIMS Mathematics. OpenAlex counts 0 citations as of 19 November 2026. It is open access under a CC BY-NC-SA licence: the full text is free to read at AIMS Mathematics.
- Citations
- 0
- References
- 65
- Authors
- 2
Abstract
Optimizing computationally expensive black-box functions is challenging because each function evaluation incurs a high computational cost. Bayesian optimization (BO) addresses this problem by using Gaussian process surrogate models to guide the selection of new evaluation points. Within the Bayesian optimization with Pareto-based selection (BOPS) framework, the predictive mean and standard deviation define a bi-objective optimization problem that balances exploitation and exploration. A batch of solutions is then selected from its approximate Pareto set. This paper presents a systematic empirical study of Pareto front approximation and Pareto-based solution selection within the BOPS framework. We investigated three space-filling designs (Sobol sequences, Latin hypercube sampling, and uniform random sampling) in combination with five Pareto-based solution selection strategies. Experiments were conducted on the 20-dimensional CEC2022 benchmark suite (12 functions) and a real-world robotic manipulation problem using a batch size of $ q = 4 $, an evaluation budget of 800 function evaluations, and 30 independent runs. BOPS variants were compared with standard acquisition-based batch BO methods, including $ q $-expected improvement, $ q $-upper confidence bound, and $ q $-knowledge gradient. The results showed that optimization performance depends primarily on the solution selection mechanism rather than the Pareto approximation strategy once a sufficiently accurate Pareto set is obtained. Moreover, several BOPS variants using simple space-filling-based Pareto approximation achieve optimization performance comparable to or better than standard acquisition-based BO. These findings provide empirical insights into Pareto-based batch Bayesian optimization, demonstrate the effectiveness of simple space-filling-based Pareto approximation, and provide a unified framework for developing and evaluating future Pareto-based solution selection strategies.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Chaiyotha, K., & Krityakierne, T. (2026). Pareto-based selection strategies for batch Bayesian optimization of expensive black-box functions. AIMS Mathematics, 11(7), 22166–22204. https://doi.org/10.3934/math.2026898
MLA 9
Chaiyotha, Kittisak, and Tipaluck Krityakierne. “Pareto-based selection strategies for batch Bayesian optimization of expensive black-box functions.” AIMS Mathematics, vol. 11, no. 7, 2026, pp. 22166–22204. https://doi.org/10.3934/math.2026898.
Chicago
Chaiyotha, Kittisak and Tipaluck Krityakierne. 2026. “Pareto-based selection strategies for batch Bayesian optimization of expensive black-box functions.” AIMS Mathematics 11 (7): 22166–22204. https://doi.org/10.3934/math.2026898.
Harvard
Chaiyotha, K. and Krityakierne, T. (2026) ‘Pareto-based selection strategies for batch Bayesian optimization of expensive black-box functions’, AIMS Mathematics, 11(7), pp. 22166–22204. doi:10.3934/math.2026898.
IEEE
K. Chaiyotha and T. Krityakierne, “Pareto-based selection strategies for batch Bayesian optimization of expensive black-box functions,” AIMS Mathematics, vol. 11, no. 7, pp. 22166–22204, 2026, doi: 10.3934/math.2026898.
BibTeX
@article{chaiyotha2026pareto,
title = {{Pareto-based selection strategies for batch Bayesian optimization of expensive black-box functions}},
author = {Chaiyotha, Kittisak and Krityakierne, Tipaluck},
journal = {AIMS Mathematics},
year = {2026},
volume = {11},
number = {7},
pages = {22166--22204},
doi = {10.3934/math.2026898},
url = {https://doi.org/10.3934/math.2026898}
}
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
- batch Bayesian optimization
- expensive black-box functions
- Kriging surrogate model
- bi-objective optimization
- Pareto front approximation
- space-filling designs
- Sobol sequence
- Latin hypercube sampling
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Chaiyotha, K., & Krityakierne, T. (2026). Pareto-based selection strategies for batch Bayesian optimization of expensive black-box functions. AIMS Mathematics, 11(7), 22166–22204. https://doi.org/10.3934/math.2026898
How many times has this paper been cited?
0 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 AIMS Mathematics: sign in and open the PDF from this page.
Who wrote this paper?
Kittisak Chaiyotha, Tipaluck Krityakierne.
What is the DOI of this paper?
10.3934/math.2026898, permanently at https://doi.org/10.3934/math.2026898. 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.