Efficient Bayesian Optimization using Multiscale Graph Correlation
arXiv:2103.09434
Abstract
Bayesian optimization is a powerful tool to optimize a black-box function, the evaluation of which is time-consuming or costly. In this paper, we propose a new approach to Bayesian optimization called GP-MGC, which maximizes multiscale graph correlation with respect to the global maximum to determine the next query point. We present our evaluation of GP-MGC in applications involving both synthetic benchmark functions and real-world datasets and demonstrate that GP-MGC performs as well as or even better than state-of-the-art methods such as max-value entropy search and GP-UCB.
arXiv comment12 pages, 2 figures
References in corpus (5)
- Practical Bayesian Optimization of Machine Learning Algorithms
- Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
- Predictive Entropy Search for Efficient Global Optimization of Black-box Functions
- Max-value Entropy Search for Efficient Bayesian Optimization
- Discovering and Deciphering Relationships Across Disparate Data Modalities