Random Postprocessing for Combinatorial Bayesian Optimization

Abstract

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.

arXiv comment10 pages, 4 figures

References in corpus (9)

• A simple sampler for the horseshoe estimator
• Expanding the horizon of automated metamaterials discovery via quantum annealing
• Designing nanostructures for interfacial phonon transport via Bayesian optimization
• Application of QUBO solver using black-box optimization to structural design for resonance avoidance
• Benchmark test of Black-box optimization using D-Wave quantum annealer
• Virtual Screening of Chemical Space based on Quantum Annealing
• Statistical-mechanical analysis of compressed sensing for Hamiltonian estimation of Ising spin glass
• Lossy compression of matrices by black-box optimisation of mixed integer nonlinear programming
• Data-driven determination of the spin Hamiltonian parameters and their uncertainties: The case of the zigzag-chain compound KCu${}_4$P${}_3$O${}_{12}$

Cited by in corpus (1)

• Subsampling Factorization Machine Annealing