arXiv Analytics

Sign in

arXiv:2102.08993 [cs.LG]AbstractReferencesReviewsResources

Using Distance Correlation for Efficient Bayesian Optimization

Takuya Kanazawa

Published 2021-02-17Version 1

We propose a novel approach for Bayesian optimization, called $\textsf{GP-DC}$, which combines Gaussian processes with distance correlation. It balances exploration and exploitation automatically, and requires no manual parameter tuning. We evaluate $\textsf{GP-DC}$ on a number of benchmark functions and observe that it outperforms state-of-the-art methods such as $\textsf{GP-UCB}$ and max-value entropy search, as well as the classical expected improvement heuristic. We also apply $\textsf{GP-DC}$ to optimize sequential integral observations with a variable integration range and verify its empirical efficiency on both synthetic and real-world datasets.

Related articles: Most relevant | Search more
arXiv:2103.09434 [cs.LG] (Published 2021-03-17)
Efficient Bayesian Optimization using Multiscale Graph Correlation
arXiv:1506.02080 [cs.LG] (Published 2015-06-05)
Local Nonstationarity for Efficient Bayesian Optimization
arXiv:2107.14465 [cs.LG] (Published 2021-07-30)
Trusted-Maximizers Entropy Search for Efficient Bayesian Optimization