One-parameter family of acquisition functions for efficient global optimization

Abstract

Bayesian optimization (BO) with Gaussian processes is a powerful methodology to optimize an expensive black-box function with as few function evaluations as possible. The expected improvement (EI) and probability of improvement (PI) are among the most widely used schemes for BO. There is a plethora of other schemes that outperform EI and PI, but most of them are numerically far more expensive than EI and PI. In this work, we propose a new one-parameter family of acquisition functions for BO that unifies EI and PI. The proposed method is numerically inexpensive, is easy to implement, can be easily parallelized, and on benchmark tasks shows a performance superior to EI and GP-UCB. Its generalization to BO with Student-t processes is also presented.

13 pages, 6 figures. Accepted to IJCNN 2022

References in corpus (10)

• Practical Bayesian Optimization of Machine Learning Algorithms
• A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning
• Predictive Entropy Search for Efficient Global Optimization of Black-box Functions
• Greed is Good: Exploration and Exploitation Trade-offs in Bayesian Optimisation
• Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations
• Improving the Expected Improvement Algorithm
• Upgrading from Gaussian Processes to Student's-T Processes
• Practical Bayesian optimization in the presence of outliers
• Using Distance Correlation for Efficient Bayesian Optimization
• Efficient Bayesian Optimization using Multiscale Graph Correlation