Name
Abstract | ||
|---|---|---|
We present an approach to Bayesian Optimization that allows for robust search strategies over a large class of challenging functions. Our method is motivated by the belief that the trends useful to exploit in search of the optimum typically are a subset of the characteristics of the true objective function. At the core of our approach is the use of a Latent Gaussian Process Regression model that allows us to modulate the input domain with an orthogonal latent space. Using this latent space we can encapsulate local information about each observed data point that can be used to guide the search problem. We show experimentally that our method can be used to significantly improve performance on challenging benchmarks. |
Year | Venue | DocType |
|---|---|---|
2019 | CoRR | Journal |
Volume | Citations | PageRank |
abs/1906.11152 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik Bodin | 1 | 3 | 1.75 |
| Markus Kaiser | 2 | 9 | 2.97 |
| Ieva Kazlauskaite | 3 | 0 | 2.37 |
| Neill D. F. Campbell | 4 | 303 | 18.10 |
| carl henrik ek | 5 | 327 | 30.76 |