Exploring Exploration in Bayesian Optimization
Leonard Papenmeier, Nuojin Cheng, Stephen Becker, Luigi Nardi
TL;DR
This work addresses the lack of a quantitative exploration metric in Bayesian optimization by introducing two measures, Observation Traveling Salesman Distance ($OTSD$) and Observation Entropy ($OE$), that quantify how AFs explore the observation space. The authors derive $OTSD$ and $OE$ (with bounds) and demonstrate their usefulness across a wide range of synthetic and real-world benchmarks, including high-dimensional problems, while showing how batching and acceleration techniques affect exploration. The study yields an empirical taxonomy of AF exploration, revealing that top-performing methods balance exploration and exploitation rather than maximizing either extreme, and provides practical guidance for AF design and portfolio construction. By offering non-parametric, problem-aware metrics and bounding properties, this work enables principled analysis and steering of AFs in BO, including extensions to non-Euclidean domains and future AF development.
Abstract
A well-balanced exploration-exploitation trade-off is crucial for successful acquisition functions in Bayesian optimization. However, there is a lack of quantitative measures for exploration, making it difficult to analyze and compare different acquisition functions. This work introduces two novel approaches - observation traveling salesman distance and observation entropy - to quantify the exploration characteristics of acquisition functions based on their selected observations. Using these measures, we examine the explorative nature of several well-known acquisition functions across a diverse set of black-box problems, uncover links between exploration and empirical performance, and reveal new relationships among existing acquisition functions. Beyond enabling a deeper understanding of acquisition functions, these measures also provide a foundation for guiding their design in a more principled and systematic manner.
