Scalable Batch Bayesian Optimization Via Subspace Acquisition Functions
ACM Transactions on Evolutionary Learning and Optimization · 11.06.2026
DOI: 10.1145/3820495 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Evolutionary Learning and Optimization, online erschienen am 11.06.2026. Verfasst von Dawei Zhan und 3 weiteren Autor:innen. Die Arbeit nennt 65 Literaturangaben.
Abstract (Originalsprache)
Extending Bayesian optimization to batch evaluation can enable the designer to make the most use of parallel computing technology. However, most of current batch approaches do not scale well with the batch size. That is, their optimization efficiencies often deteriorate as the batch size increases. To address this issue, we propose a simple and efficient approach to extend Bayesian optimization to large-scale batch evaluation in this work. Different from existing batch approaches, the idea of the new approach is to draw a batch of axis-aligned subspaces of the original problem and select one point from each subspace using existing acquisition functions. Numerical experiments show that our proposed approach speedups the convergence significantly when compared with the sequential Bayesian optimization algorithm, and performs very competitively when compared with ten batch Bayesian optimization algorithms. The implementation of our proposed approach is available at https://github.com/zhandawei/SubSpace_Acquisition_Functions .
Zitieren
APA
Zhan, D., Zeng, Z., Wei, S., & Wu, P. (2026). Scalable Batch Bayesian Optimization Via Subspace Acquisition Functions. ACM Transactions on Evolutionary Learning and Optimization. https://doi.org/10.1145/3820495
Vancouver
Zhan D, Zeng Z, Wei S, Wu P. Scalable Batch Bayesian Optimization Via Subspace Acquisition Functions. ACM Transactions on Evolutionary Learning and Optimization. 2026. doi:10.1145/3820495
BibTeX
@article{Zhan2026,
author = {Zhan, Dawei and Zeng, Zhaoxi and Wei, Shuoxiao and Wu, Ping},
title = {Scalable Batch Bayesian Optimization Via Subspace Acquisition Functions},
journal = {ACM Transactions on Evolutionary Learning and Optimization},
year = {2026},
doi = {10.1145/3820495}
}
EUVIMED