Recent advances in Bayesian optimization
Bayesian optimization has emerged at the forefront of expensive black-box optimization due
to its data efficiency. Recent years have witnessed a proliferation of studies on the …
to its data efficiency. Recent years have witnessed a proliferation of studies on the …
Combining latent space and structured kernels for Bayesian optimization over combinatorial spaces
We consider the problem of optimizing combinatorial spaces (eg, sequences, trees, and
graphs) using expensive black-box function evaluations. For example, optimizing molecules …
graphs) using expensive black-box function evaluations. For example, optimizing molecules …
Bayesian optimization over hybrid spaces
A Deshwal, S Belakaria… - … Conference on Machine …, 2021 - proceedings.mlr.press
We consider the problem of optimizing hybrid structures (mixture of discrete and continuous
input variables) via expensive black-box function evaluations. This problem arises in many …
input variables) via expensive black-box function evaluations. This problem arises in many …
Mercer features for efficient combinatorial Bayesian optimization
Bayesian optimization (BO) is an efficient framework for solving black-box optimization
problems with expensive function evaluations. This paper addresses the BO problem setting …
problems with expensive function evaluations. This paper addresses the BO problem setting …
Bayesian optimization over permutation spaces
Optimizing expensive to evaluate black-box functions over an input space consisting of all
permutations of d objects is an important problem with many real-world applications. For …
permutations of d objects is an important problem with many real-world applications. For …
Continuous surrogate-based optimization algorithms are well-suited for expensive discrete problems
One method to solve expensive black-box optimization problems is to use a surrogate model
that approximates the objective based on previous observed evaluations. The surrogate …
that approximates the objective based on previous observed evaluations. The surrogate …
Max-value entropy search for multi-objective Bayesian optimization with constraints
We consider the problem of constrained multi-objective blackbox optimization using
expensive function evaluations, where the goal is to approximate the true Pareto set of …
expensive function evaluations, where the goal is to approximate the true Pareto set of …
[PDF][PDF] Adaptive Experimental Design for Optimizing Combinatorial Structures.
JR Doppa - IJCAI, 2021 - ijcai.org
Scientists and engineers in diverse domains need to perform expensive experiments to
optimize combinatorial spaces, where each candidate input is a discrete structure (eg …
optimize combinatorial spaces, where each candidate input is a discrete structure (eg …
Uncertainty aware search framework for multi-objective Bayesian optimization with constraints
We consider the problem of constrained multi-objective (MO) blackbox optimization using
expensive function evaluations, where the goal is to approximate the true Pareto set of …
expensive function evaluations, where the goal is to approximate the true Pareto set of …
Explaining inference queries with bayesian optimization
Obtaining an explanation for an SQL query result can enrich the analysis experience, reveal
data errors, and provide deeper insight into the data. Inference query explanation seeks to …
data errors, and provide deeper insight into the data. Inference query explanation seeks to …