Bayesian Optimization of Combinatorial Structures
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. 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.
Code (2)
Tasks
Bayesian OptimizationBIG-bench Machine LearningSimilar Papers 제목 키워드 기반
Differentiable TAN Structure Learning for Bayesian Network Classifiers
Learning the structure of Bayesian networks is a difficult combinatorial optimization problem. In this paper, we consider learning of tree-augmented naive Bayes (TAN) structures for Bayesian network classifiers with disc…
Combinatorial OptimizationMercer 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 for combinatorial spaces (e.g., sequences …
Bayesian OptimizationThompson SamplingBayesian Variational Optimization for Combinatorial Spaces
This paper focuses on Bayesian Optimization in combinatorial spaces. In many applications in the natural science. Broad applications include the study of molecules, proteins, DNA, device structures and quantum circuit de…
Bayesian OptimizationGaussian ProcessesBayesian Optimization over High-Dimensional Combinatorial Spaces via Dictionary-based Embeddings
We consider the problem of optimizing expensive black-box functions over high-dimensional combinatorial spaces which arises in many science, engineering, and ML applications. We use Bayesian Optimization (BO) and propose…
Bayesian OptimizationVocal Bursts Intensity PredictionCombinatorial Bayesian Optimization with Random Mapping Functions to Convex Polytopes
Bayesian optimization is a popular method for solving the problem of global optimization of an expensive-to-evaluate black-box function. It relies on a probabilistic surrogate model of the objective function, upon which …
Bayesian Optimizationglobal-optimization