The reparameterization trick for acquisition functions

Abstract

Bayesian optimization is a sample-efficient approach to solving global optimization problems. Along with a surrogate model, this approach relies on theoretically motivated value heuristics (acquisition functions) to guide the search process. Maximizing acquisition functions yields the best performance; unfortunately, this ideal is difficult to achieve since optimizing acquisition functions per se is frequently non-trivial. This statement is especially true in the parallel setting, where acquisition functions are routinely non-convex, high-dimensional, and intractable. Here, we demonstrate how many popular acquisition functions can be formulated as Gaussian integrals amenable to the reparameterization trick and, ensuingly, gradient-based optimization. Further, we use this reparameterized representation to derive an efficient Monte Carlo estimator for the upper confidence bound acquisition function in the context of parallel selection.

Accepted at the NIPS 2017 Workshop on Bayesian Optimization (BayesOpt 2017)

Cited by in corpus (13)

• Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization
• Multi-Fidelity Cost-Aware Bayesian Optimization
• Investigating Bayesian optimization for expensive-to-evaluate black box functions: Application in fluid dynamics
• New Paradigms for Exploiting Parallel Experiments in Bayesian Optimization
• Latent Map Gaussian Processes for Mixed Variable Metamodeling
• The Impact of Expertise in the Loop for Exploring Machine Rationality
• Batched Bayesian optimization by maximizing the probability of including the optimum
• Refining Coarse-Grained Molecular Topologies: A Bayesian Optimization Approach
• Choosing a Suitable Acquisition Function for Batch Bayesian Optimization: Comparison of Serial and Monte Carlo Approaches
• Bayesian Optimization Algorithms for Accelerator Physics
• MetaTune: Meta-Learning Based Cost Model for Fast and Efficient Auto-tuning Frameworks
• A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization
• Lookahead Acquisition Functions for Finite-Horizon Time-Dependent Bayesian Optimization and Application to Quantum Optimal Control