Pseudo-Bayesian Optimization

📅 2023-10-15
🏛️ arXiv.org
📈 Citations: 2
Influential: 0
📄 PDF

career value

211K/year
🤖 AI Summary
This work addresses the lack of convergence guarantees for non-Gaussian process (non-GP) surrogate models in Bayesian optimization (BO). To resolve this, we propose the first axiomatic pseudo-BO framework, formally characterizing the minimal conditions required for sequential black-box optimization to converge. Methodologically, we design a lightweight local-regression-based surrogate model coupled with a randomized prior mechanism for efficient uncertainty quantification, and integrate it with upper-confidence-bound-type acquisition strategies. Theoretically, we provide the first rigorous convergence analysis for non-GP BO. Empirically, our framework consistently outperforms state-of-the-art methods—including GP-BO, TuRBO, and ALEBO—across high-dimensional synthetic benchmarks, neural network hyperparameter tuning, and robot control tasks. Thus, it achieves both theoretical soundness and practical superiority.
📝 Abstract
Bayesian Optimization is a popular approach for optimizing expensive black-box functions. Its key idea is to use a surrogate model to approximate the objective and, importantly, quantify the associated uncertainty that allows a sequential search of query points that balance exploitation-exploration. Gaussian process (GP) has been a primary candidate for the surrogate model, thanks to its Bayesian-principled uncertainty quantification power and modeling flexibility. However, its challenges have also spurred an array of alternatives whose convergence properties could be more opaque. Motivated by these, we study in this paper an axiomatic framework that elicits the minimal requirements to guarantee black-box optimization convergence that could apply beyond GP-based methods. Moreover, we leverage the design freedom in our framework, which we call Pseudo-Bayesian Optimization, to construct empirically superior algorithms. In particular, we show how using simple local regression, and a suitable"randomized prior"construction to quantify uncertainty, not only guarantees convergence but also consistently outperforms state-of-the-art benchmarks in examples ranging from high-dimensional synthetic experiments to realistic hyperparameter tuning and robotic applications.
Problem

Research questions and friction points this paper is trying to address.

Optimizing expensive black-box functions
Guaranteeing convergence beyond GP-based methods
Constructing empirically superior optimization algorithms
Innovation

Methods, ideas, or system contributions that make the work stand out.

Pseudo-Bayesian Optimization framework
Simple local regression technique
Randomized prior uncertainty quantification