Diagonal Partitioning Strategy Using Bisection of Rectangles and a Novel Sampling Scheme

In this paper we consider a global optimization problem, where the objective function is supposed to be Lipschitz-continuous with an unknown Lipschitz constant. Based on the recently introduced BIRECT (BIsection of RECTangles) algorithm, a new diagonal partitioning and sampling scheme is introduced. 0ur framework, called BIRECT-V (where V stands for vertices), combines bisection with sampling … Read more

A novel UCB-based batch strategy for Bayesian optimization

The optimization of expensive black-box functions appears in many situations. Bayesian optimization methods have been successfully applied to solve these prob- lems using well-known single-point acquisition functions. Nowadays, the develop- ments in technology allow us to perform evaluations of some of these expensive function in parallel. Therefore, there is a need for batch infill criteria … Read more