Recent advances in Bayesian optimization

X Wang, Y Jin, S Schmitt, M Olhofer - ACM Computing Surveys, 2023 - dl.acm.org
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 …

Combining latent space and structured kernels for Bayesian optimization over combinatorial spaces

A Deshwal, J Doppa - Advances in neural information …, 2021 - proceedings.neurips.cc
We consider the problem of optimizing combinatorial spaces (eg, sequences, trees, and
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 …

Mercer features for efficient combinatorial Bayesian optimization

A Deshwal, S Belakaria, JR Doppa - … of the AAAI Conference on Artificial …, 2021 - ojs.aaai.org
Bayesian optimization (BO) is an efficient framework for solving black-box optimization
problems with expensive function evaluations. This paper addresses the BO problem setting …

Bayesian optimization over permutation spaces

A Deshwal, S Belakaria, JR Doppa… - Proceedings of the AAAI …, 2022 - ojs.aaai.org
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 …

Continuous surrogate-based optimization algorithms are well-suited for expensive discrete problems

R Karlsson, L Bliek, S Verwer, M de Weerdt - Benelux Conference on …, 2020 - Springer
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 …

Max-value entropy search for multi-objective Bayesian optimization with constraints

S Belakaria, A Deshwal, JR Doppa - arXiv preprint arXiv:2009.01721, 2020 - arxiv.org
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 …

[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 …

Uncertainty aware search framework for multi-objective Bayesian optimization with constraints

S Belakaria, A Deshwal, JR Doppa - arXiv preprint arXiv:2008.07029, 2020 - arxiv.org
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 …

Explaining inference queries with bayesian optimization

B Lockhart, J Peng, W Wu, J Wang, E Wu - arXiv preprint arXiv …, 2021 - arxiv.org
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 …