Bayesian Optimization with Discrete Variables
Lists
Only you see this
Abstract
Bayesian Optimization (BO) is an efficient method to optimize an expensive black-box function with continuous variables. However, in many cases, the function has only discrete variables as inputs, which cannot be optimized by traditional BO methods. A typical approach to optimize such functions assumes the objective function is on a continuous domain, then applies a normal BO method with a rounding of suggested continuous points to nearest discrete points at the end. This may cause BO to get stuck and repeat pre-existing observations. To overcome this problem, we propose a method (named Discrete-BO) that manipulates the exploration of an acquisition function and the length scale of a covariance function, which are two key components of a BO method, to prevent sampling a pre-existing observation. Our experiments on both synthetic and real-world applications show that the proposed method outperforms state-of-the-art baselines in terms of convergence rate. More importantly, we also show some theoretical analyses to prove the correctness of our method.
BibTeX
@inproceedings{luong2019bayesian,
author = {Phuc Luong and Sunil Gupta and Dang Nguyen and Santu Rana and Svetha Venkatesh},
title = {{Bayesian Optimization with Discrete Variables}},
booktitle = {Australasian Conference on Artificial Intelligence},
year = {2019},
doi = {10.1007/978-3-030-35288-2\_38},
}Loading related content...