Bayesian Optimisation for Constrained Problems

by   Juan Ungredda, et al.

Many real-world optimisation problems such as hyperparameter tuning in machine learning or simulation-based optimisation can be formulated as expensive-to-evaluate black-box functions. A popular approach to tackle such problems is Bayesian optimisation (BO), which builds a response surface model based on the data collected so far, and uses the mean and uncertainty predicted by the model to decide what information to collect next. In this paper, we propose a novel variant of the well-known Knowledge Gradient acquisition function that allows it to handle constraints. We empirically compare the new algorithm with four other state-of-the-art constrained Bayesian optimisation algorithms and demonstrate its superior performance. We also prove theoretical convergence in the infinite budget limit.


ε-shotgun: ε-greedy Batch Bayesian Optimisation

Bayesian optimisation is a popular, surrogate model-based approach for o...

Bayesian functional optimisation with shape prior

Real world experiments are expensive, and thus it is important to reach ...

Covariance Function Pre-Training with m-Kernels for Accelerated Bayesian Optimisation

The paper presents a novel approach to direct covariance function learni...

HEBO: Heteroscedastic Evolutionary Bayesian Optimisation

We introduce HEBO: Heteroscedastic Evolutionary Bayesian Optimisation th...

Infill Criterion for Multimodal Model-Based Optimisation

Physical systems are modelled and investigated within simulation softwar...

Identifying Properties of Real-World Optimisation Problems through a Questionnaire

Optimisation algorithms are commonly compared on benchmarks to get insig...

Ordinal Bayesian Optimisation

Bayesian optimisation is a powerful tool to solve expensive black-box pr...