Exploration strategies for Gaussian process bandit optimization with inference regret guarantees
This paper introduces efficient exploration strategies for Bayesian optimization to improve the quality of the final output.
This paper introduces a novel approach to Bayesian optimization by incorporating exploration strategies to improve the quality of the final output.
Before reading this…
Applications
- →Hyperparameter optimization
- →Control task
To understand this paper, make sure you know these concepts first:
- Bayesian optimizationfind papers →
- Gaussian processfind papers →
Abstract
More Like ThisExisting cumulative regret guarantees for Bayesian optimization (BO) do not necessarily characterize the quality of the algorithm's final output. This gap is critical under noisy evaluations, where the goal is to return a single high-quality recommendation. To address it, we introduce efficient exploration strategies that can be incorporated into any BO procedure by occasionally replacing the acquisition query with an exploration query. To validate this approach, we bound the Gaussian process posterior standard deviation over the search space via the fill distance of the queries, which measures the largest region left unexplored. We then use this result to derive upper bounds on the inference regret, i.e., the gap between the global optimum and the function value at the algorithm's returned point. Empirically, these exploration strategies improve the final recommendations of existing BO algorithms on synthetic benchmarks, hyperparameter optimization, and a control task.