DeepAI AI Chat
Log In Sign Up

Bayesian Optimization of Combinatorial Structures

by   Ricardo Baptista, et al.

The optimization of expensive-to-evaluate black-box functions over combinatorial structures is an ubiquitous task in machine learning, engineering and the natural sciences. The combinatorial explosion of the search space and costly evaluations pose challenges for current techniques in discrete optimization and machine learning, and critically require new algorithmic ideas (NIPS BayesOpt 2017). This article proposes, to the best of our knowledge, the first algorithm to overcome these challenges, based on an adaptive, scalable model that identifies useful combinatorial structure even when data is scarce. Our acquisition function pioneers the use of semidefinite programming to achieve efficiency and scalability. Experimental evaluations demonstrate that this algorithm consistently outperforms other methods from combinatorial and Bayesian optimization.


page 1

page 2

page 3

page 4


Combinatorial Bayesian Optimization with Random Mapping Functions to Convex Polytope

Bayesian optimization is a popular method for solving the problem of glo...

Mercer Features for Efficient Combinatorial Bayesian Optimization

Bayesian optimization (BO) is an efficient framework for solving black-b...

Batch Bayesian Optimization on Permutations using Acquisition Weighted Kernels

In this work we propose a batch Bayesian optimization method for combina...

Combining Latent Space and Structured Kernels for Bayesian Optimization over Combinatorial Spaces

We consider the problem of optimizing combinatorial spaces (e.g., sequen...

Multiple Adaptive Bayesian Linear Regression for Scalable Bayesian Optimization with Warm Start

Bayesian optimization (BO) is a model-based approach for gradient-free b...

Bayesian Variational Optimization for Combinatorial Spaces

This paper focuses on Bayesian Optimization in combinatorial spaces. In ...