Maximizing acquisition functions for Bayesian optimization

05/25/2018
by   James T. Wilson, et al.
0

Bayesian optimization is a sample-efficient approach to global optimization that relies on theoretically motivated value heuristics (acquisition functions) to guide the search process. Fully maximizing acquisition functions produces the Bayes' decision rule, but this ideal is difficult to achieve since these functions are frequently non-trivial to optimize. This statement is especially true when evaluating queries in parallel, where acquisition functions are routinely non-convex, high-dimensional, and intractable. We present two modern approaches for maximizing acquisition functions that exploit key properties thereof, namely the differentiability of Monte Carlo integration and the submodularity of parallel querying.

READ FULL TEXT
research
12/01/2017

The reparameterization trick for acquisition functions

Bayesian optimization is a sample-efficient approach to solving global o...
research
02/24/2020

Efficient Rollout Strategies for Bayesian Optimization

Bayesian optimization (BO) is a class of sample-efficient global optimiz...
research
10/14/2019

BoTorch: Programmable Bayesian Optimization in PyTorch

Bayesian optimization provides sample-efficient global optimization for ...
research
12/14/2021

Triangulation candidates for Bayesian optimization

Bayesian optimization is a form of sequential design: idealize input-out...
research
06/14/2020

Recursive Two-Step Lookahead Expected Payoff for Time-Dependent Bayesian Optimization

We propose a novel Bayesian method to solve the maximization of a time-d...
research
02/16/2016

Parallel Bayesian Global Optimization of Expensive Functions

We consider parallel global optimization of derivative-free expensive-to...
research
01/25/2020

Bayesian optimization for backpropagation in Monte-Carlo tree search

In large domains, Monte-Carlo tree search (MCTS) is required to estimate...

Please sign up or login with your details

Forgot password? Click here to reset