Unleashing the Potential of Acquisition Functions in High-Dimensional Bayesian Optimization
Not on the map. Why?
Abstract (arXiv)
Bayesian optimization (BO) is widely used to optimize expensive-to-evaluate black-box functions.BO first builds a surrogate model to represent the objective function and assesses its uncertainty. It then decides where to sample by maximizing an acquisition function (AF) based on the surrogate model. However, when dealing with high-dimensional problems, finding the global maximum of the AF becomes increasingly challenging. In such cases, the initialization of the AF maximizer plays a pivotal role, as an inadequate setup can severely hinder the effectiveness of the AF. This paper investigates a largely understudied problem concerning the impact of AF maximizer initialization on exploiting AFs' capability. Our large-scale empirical study shows that the widely used random initialization strategy often fails to harness the potential of an AF. In light of this, we propose a better initialization approach by employing multiple heuristic optimizers to leverage the historical data of black-box optimization to generate initial points for the AF maximize. We evaluate our approach with a range of heavily studied synthetic functions and real-world applications. Experimental results show that our techniques, while simple, can significantly enhance the standard BO and outperform state-of-the-art methods by a large margin in most test cases.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 23 of its 45 references that are in the map. First posted on arXiv 16 Feb 2023.
Builds on
23 of 45 references.
References · 23
- 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 603
- 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 359
- 2019NAS-Bench-101: Towards Reproducible Neural Architecture Searchcited by 340
- 2017Max-value Entropy Search for Efficient Bayesian Optimizationcited by 202
- 2020pymoo: Multi-objective Optimization in Pythoncited by 196
- 2015High Dimensional Bayesian Optimisation and Bandits via Additive Modelscited by 137
- 2017Batched Large-scale Bayesian Optimization in High-dimensional Spacescited by 116
- 2018Maximizing acquisition functions for Bayesian optimizationcited by 113
- 2020Re-Examining Linear Embeddings for High-Dimensional Bayesian Optimizationcited by 89
- 2017Parallel and Distributed Thompson Sampling for Large-scale Accelerated Exploration of Chemical Spacecited by 76
- 2018Simple random search provides a competitive approach to reinforcement learningcited by 75
- 2016The Parallel Knowledge Gradient Method for Batch Bayesian Optimizationcited by 73
11 more
- 2019Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspacescited by 73
- 2014Input Warping for Bayesian Optimization of Non-stationary Functionscited by 66
- 2019Tuning Hyperparameters without Grad Students: Scalable and Robust Bayesian Optimisation with Dragonflycited by 66
- 2018BOCK : Bayesian Optimization with Cylindrical Kernelscited by 62
- 2018High-Dimensional Bayesian Optimization via Additive Models with Overlapping Groupscited by 58
- 2017Batched High-dimensional Bayesian Optimization via Structural Kernel Learningcited by 51
- 2021GIBBON: General-purpose Information-Based Bayesian OptimisatioNcited by 47
- 2021LassoBench: A High-Dimensional Hyperparameter Optimization Benchmark Suite for Lassocited by 41
- 2018High Dimensional Bayesian Optimization Using Dropoutcited by 40
- 2017On the choice of the low-dimensional domain for global optimization via random embeddingscited by 25
- 2017GPflowOpt: A Bayesian Optimization Library using TensorFlowcited by 18
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 2.
5 papers.
- 2023Unexpected Improvements to Expected Improvement for Bayesian Optimizationcited by 144
- 2024A survey and benchmark of high-dimensional Bayesian optimization of discrete sequencescited by 22
- 2025Enhancing Trust-Region Bayesian Optimization via Newton Methodscited by 2
- 2026From Intents to Actions: Agentic AI in Autonomous Networkscited by 1
- 2026Optimization of time-consuming experimental conditions using pseudo-experimental data guided by adaptive polynomial regressioncited by 0
- 2026Optimization of time-consuming experimental conditions using pseudo-experimental data guided by adaptive polynomial regression24 Jul 2026
- 2026From Intents to Actions: Agentic AI in Autonomous Networks1 Feb 2026
- 2025Enhancing Trust-Region Bayesian Optimization via Newton Methods25 Aug 2025
- 2024A survey and benchmark of high-dimensional Bayesian optimization of discrete sequences7 Jun 2024
- 2023Unexpected Improvements to Expected Improvement for Bayesian Optimization31 Oct 2023