Bayesian Optimization using Pseudo-Points

Abstract

Bayesian optimization (BO) is a popular approach for expensive black-box optimization, with applications including parameter tuning, experimental design, robotics. BO usually models the objective function by a Gaussian process (GP), and iteratively samples the next data point by maximizing an acquisition function. In this paper, we propose a new general framework for BO by generating pseudo-points (i.e., data points whose objective values are not evaluated) to improve the GP model. With the classic acquisition function, i.e., upper confidence bound (UCB), we prove that the cumulative regret can be generally upper bounded. Experiments using UCB and other acquisition functions, i.e., probability of improvement (PI) and expectation of improvement (EI), on synthetic as well as real-world problems clearly show the advantage of generating pseudo-points.

References in corpus (7)

• A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning
• Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
• Predictive Entropy Search for Efficient Global Optimization of Black-box Functions
• Batch Bayesian Optimization via Local Penalization
• Max-value Entropy Search for Efficient Bayesian Optimization
• Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions
• Fast Information-theoretic Bayesian Optimisation