Sampling Acquisition Functions for Batch Bayesian Optimization

Abstract

We present Acquisition Thompson Sampling (ATS), a novel technique for batch Bayesian Optimization (BO) based on the idea of sampling multiple acquisition functions from a stochastic process. We define this process through the dependency of the acquisition functions on a set of model hyper-parameters. ATS is conceptually simple, straightforward to implement and, unlike other batch BO methods, it can be employed to parallelize any sequential acquisition function or to make existing parallel methods scale further. We present experiments on a variety of benchmark functions and on the hyper-parameter optimization of a popular gradient boosting tree algorithm. These demonstrate the advantages of ATS with respect to classical parallel Thompson Sampling for BO, its competitiveness with two state-of-the-art batch BO methods, and its effectiveness if applied to existing parallel BO algorithms.

Presented at BNP@NeurIPS 2018

References in corpus (9)

• Practical Bayesian Optimization of Machine Learning Algorithms
• Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
• Batch Bayesian Optimization via Local Penalization
• The Parallel Knowledge Gradient Method for Batch Bayesian Optimization
• Predictive Entropy Search for Bayesian Optimization with Unknown Constraints
• Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization
• Parallel Bayesian Global Optimization of Expensive Functions
• Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions
• Batched Gaussian Process Bandit Optimization via Determinantal Point Processes

Cited by in corpus (2)

• Attentive Neural Processes and Batch Bayesian Optimization for Scalable Calibration of Physics-Informed Digital Twins
• A New Bayesian Optimization Algorithm for Complex High-Dimensional Disease Epidemic Systems