Random Postprocessing for Combinatorial Bayesian Optimization
Model-based sequential approaches to discrete "black-box" optimization, including Bayesian optimization techniques, often access the same points multiple times for a given objective function in interest, resulting in many steps to find the global optimum. Here, we numerically study the effect of a postprocessing method on Bayesian optimization that strictly prohibits duplicated samples in the dataset. We find the postprocessing method significantly reduces the number of sequential steps to find the global optimum, especially when the acquisition function is of maximum a posterior estimation. Our results provide a simple but general strategy to solve the slow convergence of Bayesian optimization for high-dimensional problems.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian OptimizationSimilar Papers 제목 키워드 기반
Combinatorial 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-optimizationDifferentiable 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 OptimizationBlack-box Combinatorial Optimization using Models with Integer-valued Minima
When a black-box optimization objective can only be evaluated with costly or noisy measurements, most standard optimization algorithms are unsuited to find the optimal solution. Specialized algorithms that deal with exac…
Bayesian OptimizationCombinatorial OptimizationBayesian 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 PredictionBayesian 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 Processes