Related papers: Batch Bayesian Optimization via Expected Subspace Improvement

Batch Bayesian Optimization via Expected Subspace Improvement

URL: http://arxiv.org/abs/2411.16206v1
Date: Mon, 25 Nov 2024 09:14:09 GMT
Title: Batch Bayesian Optimization via Expected Subspace Improvement
Authors: Dawei Zhan, Zhaoxi Zeng, Shuoxiao Wei, Ping Wu,
Abstract summary: We propose a simple and efficient approach to extend Bayesian optimization to batch evaluation. Our proposed approach can achieve near-linear speedup when compared with the sequential Bayesian optimization algorithm.
Score: 0.0
License:
Abstract: Extending Bayesian optimization to batch evaluation can enable the designer to make the most use of parallel computing technology. Most of current batch approaches use artificial functions to simulate the sequential Bayesian optimization algorithm's behavior to select a batch of points for parallel evaluation. However, as the batch size grows, the accumulated error introduced by these artificial functions increases rapidly, which dramatically decreases the optimization efficiency of the algorithm. In this work, we propose a simple and efficient approach to extend Bayesian optimization to batch evaluation. Different from existing batch approaches, the idea of the new approach is to draw a batch of subspaces of the original problem and select one acquisition point from each subspace. To achieve this, we propose the expected subspace improvement criterion to measure the amount of the improvement that a candidate point can achieve within a certain subspace. By optimizing these expected subspace improvement functions simultaneously, we can get a batch of query points for expensive evaluation. Numerical experiments show that our proposed approach can achieve near-linear speedup when compared with the sequential Bayesian optimization algorithm, and performs very competitively when compared with eight state-of-the-art batch algorithms. This work provides a simple yet efficient approach for batch Bayesian optimization. A Matlab implementation of our approach is available at https://github.com/zhandawei/Expected_Subspace_Improvement_Batch_Bayesian_Optimization