Time-varying Gaussian Process Bandit Optimization with Non-constant Evaluation Time

03/10/2020
by   Hideaki Imamura, et al.
9

The Gaussian process bandit is a problem in which we want to find a maximizer of a black-box function with the minimum number of function evaluations. If the black-box function varies with time, then time-varying Bayesian optimization is a promising framework. However, a drawback with current methods is in the assumption that the evaluation time for every observation is constant, which can be unrealistic for many practical applications, e.g., recommender systems and environmental monitoring. As a result, the performance of current methods can be degraded when this assumption is violated. To cope with this problem, we propose a novel time-varying Bayesian optimization algorithm that can effectively handle the non-constant evaluation time. Furthermore, we theoretically establish a regret bound of our algorithm. Our bound elucidates that a pattern of the evaluation time sequence can hugely affect the difficulty of the problem. We also provide experimental results to validate the practical effectiveness of the proposed method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/11/2021

No-Regret Algorithms for Time-Varying Bayesian Optimization

In this paper, we consider the time-varying Bayesian optimization proble...
research
10/22/2021

Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processes

In Bayesian Optimization (BO) we study black-box function optimization w...
research
02/12/2020

Regret Bounds for Noise-Free Bayesian Optimization

Bayesian optimisation is a powerful method for non-convex black-box opti...
research
08/23/2022

Event-Triggered Time-Varying Bayesian Optimization

We consider the problem of sequentially optimizing a time-varying object...
research
06/06/2019

Fast Multi-resolution Segmentation for Nonstationary Hawkes Process Using Cumulants

The stationarity is assumed in vanilla Hawkes process, which reduces the...
research
05/24/2019

Efficient Batch Black-box Optimization with Deterministic Regret Bounds

In this work, we investigate black-box optimization from the perspective...
research
06/19/2022

Bayesian Optimization under Stochastic Delayed Feedback

Bayesian optimization (BO) is a widely-used sequential method for zeroth...

Please sign up or login with your details

Forgot password? Click here to reset