BOOST: A Data-Driven Framework for the Automated Joint Selection of Kernel and Acquisition Functions in Bayesian Optimization
Not on the map. Why?
Abstract (arXiv)
The performance of Bayesian optimization (BO), a highly sample-efficient method for expensive black-box problems, is critically governed by the selection of its hyperparameters, including the kernel and acquisition functions. This presents a significant practical challenge: an inappropriate combination of these can lead to poor performance and wasted evaluations. While individual improvements to kernel functions and acquisition functions have been actively explored, the joint and autonomous selection of the best pair of these fundamental hyperparameters has been largely overlooked. This forced practitioners to rely on heuristics or costly manual training. In this work, we propose a framework, BOOST (Bayesian Optimization with Optimal Kernel and Acquisition Function Selection Technique), that automates this selection. BOOST utilizes a simple offline evaluation stage to predict the performance of various kernel-acquisition function pairs and identify the most promising pair before committing to the expensive evaluation process. BOOST is a data-driven strategy selection procedure that evaluates kernel-acquisition pairs based on their empirical performance on the data-in-hand. At each iteration, previously observed points are partitioned into a reference set and a query set. These subsets play roles analogous to training and validation sets in machine learning: the reference set is used for model construction, while the query set represents unseen regions to retrospectively evaluate how effectively each candidate strategy progresses toward the target value. Experiments on synthetic benchmarks and machine learning hyperparameter optimization tasks demonstrate that BOOST consistently improves over fixed-hyperparameter BO and remains competitive with state-of-the-art adaptive methods, highlighting its robustness across diverse landscapes.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 46 references that are in the map. First posted on arXiv 4 Aug 2025.
Builds on
20 of 46 references.
References · 20
- 2018A Tutorial on Bayesian Optimizationcited by 744
- 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 470
- 2015Deep Kernel Learningcited by 445
- 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 374
- 2018Neural Architecture Search with Bayesian Optimisation and Optimal Transportcited by 195
- 2021High-Dimensional Bayesian Optimization with Sparse Axis-Aligned Subspacescited by 141
- 2013Gaussian Process Kernels for Pattern Discovery and Extrapolationcited by 132
- 2016Fast Bayesian Optimization of Machine Learning Hyperparameters on Large Datasetscited by 132
- 2020HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisationcited by 83
- 2021HPO-B: A Large-Scale Reproducible Benchmark for Black-Box HPO based on OpenMLcited by 75
- 2018Bayesian Optimization in AlphaGocited by 55
- 2022Monte Carlo Tree Search based Variable Selection for High Dimensional Bayesian Optimizationcited by 37
8 more
- 2023qEUBO: A Decision-Theoretic Acquisition Function for Preferential Bayesian Optimizationcited by 23
- 2024A survey and benchmark of high-dimensional Bayesian optimization of discrete sequencescited by 23
- 2022Scalable Bayesian Optimization Using Vecchia Approximations of Gaussian Processescited by 11
- 2025Exploring Exploration in Bayesian Optimizationcited by 9
- 2024Boundary Exploration for Bayesian Optimization With Unknown Physical Constraintscited by 6
- 2024EARL-BO: Reinforcement Learning for Multi-Step Lookahead, High-Dimensional Bayesian Optimizationcited by 6
- 2019No-PASt-BO: Normalized Portfolio Allocation Strategy for Bayesian Optimizationcited by 5
- 2025BARK: A Fully Bayesian Tree Kernel for Black-box Optimizationcited by 3
Built on by
Not cited yet.