Journal article · 2022 · Open access
A parallel technique for multi-objective Bayesian global optimization: Using a batch selection of probability of improvement
Swarm and Evolutionary Computation, 75, 101183 · Published 6 October 2022 · DOI 10.1016/j.swevo.2022.101183
In brief
“A parallel technique for multi-objective Bayesian global optimization: Using a batch selection of probability of improvement” is a 2022 journal article by Kaifeng Yang and 2 co-authors, published in Swarm and Evolutionary Computation. OpenAlex counts 8 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at Swarm and Evolutionary Computation.
- Citations
- 8
- Most cited in
- 2023 (4)
- Field-weighted impact
- 0.90
- References
- 80
- Authors
- 3
Abstract
Bayesian global optimization (BGO) is an efficient surrogate-assisted technique for problems involving expensive evaluations. A parallel technique can be used to parallelly evaluate the true-expensive objective functions in one iteration to boost the execution time . An effective and straightforward approach is to design an acquisition function that can evaluate the performance of a bath of multiple solutions, instead of a single point/solution, in one iteration. This paper proposes five alternatives of Probability of Improvement (PoI) with multiple points in a batch (q-PoI) for multi-objective Bayesian global optimization (MOBGO), taking the covariance among multiple points into account. Both exact computational formulas and the Monte Carlo approximation algorithms for all proposed q-PoIs are provided. Based on the distribution of the multiple points relevant to the Pareto-front, the position-dependent behavior of the five q-PoIs is investigated. Moreover, the five q-PoIs are compared with the other nine state-of-the-art and recently proposed batch MOBGO algorithms on twenty bio-objective benchmarks. The empirical experiments on different variety of benchmarks are conducted to demonstrate the effectiveness of two greedy q-PoIs ( q-PoI best and q-PoI all ) on low-dimensional problems and the effectiveness of two explorative q-PoIs ( q-PoI one and q-PoI worst ) on high-dimensional problems with difficult-to-approximate Pareto front boundaries.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Yang, K., Affenzeller, M., & Dong, G. (2022). A parallel technique for multi-objective Bayesian global optimization: Using a batch selection of probability of improvement. Swarm and Evolutionary Computation, 75, 101183. https://doi.org/10.1016/j.swevo.2022.101183
MLA 9
Yang, Kaifeng, et al. “A parallel technique for multi-objective Bayesian global optimization: Using a batch selection of probability of improvement.” Swarm and Evolutionary Computation, vol. 75, 2022, p. 101183. https://doi.org/10.1016/j.swevo.2022.101183.
Chicago
Yang, Kaifeng, Michael Affenzeller, and Guozhi Dong. 2022. “A parallel technique for multi-objective Bayesian global optimization: Using a batch selection of probability of improvement.” Swarm and Evolutionary Computation 75: 101183. https://doi.org/10.1016/j.swevo.2022.101183.
Harvard
Yang, K., Affenzeller, M. and Dong, G. (2022) ‘A parallel technique for multi-objective Bayesian global optimization: Using a batch selection of probability of improvement’, Swarm and Evolutionary Computation, 75, p. 101183. doi:10.1016/j.swevo.2022.101183.
IEEE
K. Yang, M. Affenzeller, and G. Dong, “A parallel technique for multi-objective Bayesian global optimization: Using a batch selection of probability of improvement,” Swarm and Evolutionary Computation, vol. 75, p. 101183, 2022, doi: 10.1016/j.swevo.2022.101183.
BibTeX
@article{yang2022parallel,
title = {{A parallel technique for multi-objective Bayesian global optimization: Using a batch selection of probability of improvement}},
author = {Yang, Kaifeng and Affenzeller, Michael and Dong, Guozhi},
journal = {Swarm and Evolutionary Computation},
year = {2022},
volume = {75},
pages = {101183},
doi = {10.1016/j.swevo.2022.101183},
url = {https://doi.org/10.1016/j.swevo.2022.101183}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2023 | 4 | |
| 2024 | 2 | |
| 2026 | 2 |
Its field-weighted citation impact is 0.90: it has been cited 0.90 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
- probability of improvement
- parallel evaluation
- surrogate-based optimization
- expensive objective functions
- Pareto front
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?
Yang, K., Affenzeller, M., & Dong, G. (2022). A parallel technique for multi-objective Bayesian global optimization: Using a batch selection of probability of improvement. Swarm and Evolutionary Computation, 75, 101183. https://doi.org/10.1016/j.swevo.2022.101183
How many times has this paper been cited?
8 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 Swarm and Evolutionary Computation: sign in and open the full text from this page.
Who wrote this paper?
Kaifeng Yang, Michael Affenzeller, Guozhi Dong.
What is the DOI of this paper?
10.1016/j.swevo.2022.101183, permanently at https://doi.org/10.1016/j.swevo.2022.101183. 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.