Name
Abstract | ||
|---|---|---|
Efficient optimisation of black-box problems that comprise both continuous and categorical inputs is important, yet poses significant challenges. We propose a new approach, Continuous and Categorical Bayesian Optimisation (CoCaBO), which combines the strengths of multi-armed bandits and Bayesian optimisation to select values for both categorical and continuous inputs. We model this mixed-type space using a Gaussian Process kernel, designed to allow sharing of information across multiple categorical variables, each with multiple possible values; this allows CoCaBO to leverage all available data efficiently. We extend our method to the batch setting and propose an efficient selection procedure that dynamically balances exploration and exploitation whilst encouraging batch diversity. We demonstrate empirically that our method outperforms existing approaches on both synthetic and real-world optimisation tasks with continuous and categorical inputs. |
Year | Venue | DocType |
|---|---|---|
2019 | ICML 2020 | Journal |
Volume | Citations | PageRank |
abs/1906.08878 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Xin Ru | 1 | 1 | 4.42 |
| Ahsan S. Alvi | 2 | 0 | 0.68 |
| Vu Nguyen | 3 | 49 | 14.52 |
| Michael Osborne | 4 | 250 | 33.49 |
| stephen j roberts | 5 | 1244 | 174.70 |