Conference paper · 2020 · Open access
Parallelized bayesian optimization for problems with expensive evaluation functions
Genetic and Evolutionary Computation Conference Companion (GECCO Companion), 231–232 · Published 8 July 2020 · DOI 10.1145/3377929.3390017
In brief
“Parallelized bayesian optimization for problems with expensive evaluation functions” is a 2020 conference paper by Margarita Rebolledo and 3 co-authors, published in Genetic and Evolutionary Computation Conference Companion (GECCO Companion). OpenAlex counts 8 citations as of 19 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at Cologne Open Science (RFH - University of Applied Sciences Cologne).
- Citations
- 8
- Most cited in
- 2023 (4)
- Field-weighted impact
- 0.87
- References
- 10
- Authors
- 4
Abstract
Many black-box optimization problems rely on simulations to evaluate the quality of candidate solutions. These evaluations can be computationally expensive and very time-consuming. We present and approach to mitigate this problem by taking into consideration two factors: The number of evaluations and the execution time. We aim to keep the number of evaluations low by using Bayesian optimization (BO) - known to be sample efficient - and to reduce wall-clock times by executing parallel evaluations. Four parallelization methods using BO as optimizer are compared against the inherently parallel CMA-ES. Each method is evaluated on all the 24 objective functions of the Black-Box-Optimization-Benchmarking test suite in their 20-dimensional versions. The results show that parallelized BO outperforms the state-of-the-art CMA-ES on most of the test functions, also on higher dimensions.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Rebolledo, M., Rehbach, F., Eiben, A. E., & Bartz–Beielstein, T. (2020). Parallelized bayesian optimization for problems with expensive evaluation functions. Genetic and Evolutionary Computation Conference Companion (GECCO Companion), 231–232. https://doi.org/10.1145/3377929.3390017
MLA 9
Rebolledo, Margarita, et al. “Parallelized bayesian optimization for problems with expensive evaluation functions.” Genetic and Evolutionary Computation Conference Companion (GECCO Companion), 2020, pp. 231–232. https://doi.org/10.1145/3377929.3390017.
Chicago
Rebolledo, Margarita, Frederik Rehbach, Agoston Endre Eiben, and Thomas Bartz–Beielstein. 2020. “Parallelized bayesian optimization for problems with expensive evaluation functions.” Genetic and Evolutionary Computation Conference Companion (GECCO Companion): 231–232. https://doi.org/10.1145/3377929.3390017.
Harvard
Rebolledo, M. et al. (2020) ‘Parallelized bayesian optimization for problems with expensive evaluation functions’, Genetic and Evolutionary Computation Conference Companion (GECCO Companion), pp. 231–232. doi:10.1145/3377929.3390017.
IEEE
M. Rebolledo, F. Rehbach, A. E. Eiben, and T. Bartz–Beielstein, “Parallelized bayesian optimization for problems with expensive evaluation functions,” Genetic and Evolutionary Computation Conference Companion (GECCO Companion), pp. 231–232, 2020, doi: 10.1145/3377929.3390017.
BibTeX
@inproceedings{rebolledo2020parallelized,
title = {{Parallelized bayesian optimization for problems with expensive evaluation functions}},
author = {Rebolledo, Margarita and Rehbach, Frederik and Eiben, Agoston Endre and Bartz–Beielstein, Thomas},
booktitle = {Genetic and Evolutionary Computation Conference Companion (GECCO Companion)},
year = {2020},
pages = {231--232},
doi = {10.1145/3377929.3390017},
url = {https://doi.org/10.1145/3377929.3390017}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2021 | 1 | |
| 2023 | 4 | |
| 2024 | 2 | |
| 2025 | 1 |
Its field-weighted citation impact is 0.87: it has been cited 0.87 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
- Bayesian optimization
- parallel evaluation
- expensive function evaluations
- black-box optimization
- CMA-ES
- sample efficiency
- high-dimensional optimization
- benchmark suite
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?
Rebolledo, M., Rehbach, F., Eiben, A. E., & Bartz–Beielstein, T. (2020). Parallelized bayesian optimization for problems with expensive evaluation functions. Genetic and Evolutionary Computation Conference Companion (GECCO Companion), 231–232. https://doi.org/10.1145/3377929.3390017
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 Cologne Open Science (RFH - University of Applied Sciences Cologne): sign in and open the full text from this page.
Who wrote this paper?
Margarita Rebolledo, Frederik Rehbach, Agoston Endre Eiben, Thomas Bartz–Beielstein.
What is the DOI of this paper?
10.1145/3377929.3390017, permanently at https://doi.org/10.1145/3377929.3390017. 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.