Sequential construction and dimension reduction of Gaussian processes under inequality constraints

by   François Bachoc, et al.

Accounting for inequality constraints, such as boundedness, monotonicity or convexity, is challenging when modeling costly-to-evaluate black box functions. In this regard, finite-dimensional Gaussian process (GP) models bring a valuable solution, as they guarantee that the inequality constraints are satisfied everywhere. Nevertheless, these models are currently restricted to small dimensional situations (up to dimension 5). Addressing this issue, we introduce the MaxMod algorithm that sequentially inserts one-dimensional knots or adds active variables, thereby performing at the same time dimension reduction and efficient knot allocation. We prove the convergence of this algorithm. In intermediary steps of the proof, we propose the notion of multi-affine extension and study its properties. We also prove the convergence of finite-dimensional GPs, when the knots are not dense in the input space, extending the recent literature. With simulated and real data, we demonstrate that the MaxMod algorithm remains efficient in higher dimension (at least in dimension 20), and has a smaller computational complexity than other constrained GP models from the state-of-the-art, to reach a given approximation error.


page 1

page 2

page 3

page 4


High-dimensional additive Gaussian processes under monotonicity constraints

We introduce an additive Gaussian process framework accounting for monot...

Gaussian Process Modulated Cox Processes under Linear Inequality Constraints

Gaussian process (GP) modulated Cox processes are widely used to model p...

Finite-dimensional Gaussian approximation with linear inequality constraints

Introducing inequality constraints in Gaussian process (GP) models can l...

Fast increased fidelity approximate Gibbs samplers for Bayesian Gaussian process regression

The use of Gaussian processes (GPs) is supported by efficient sampling a...

Persistent homology for low-complexity models

We show that recent results on randomized dimension reduction schemes th...

Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret

Gaussian processes (GP) are a popular Bayesian approach for the optimiza...

Code Repositories

Please sign up or login with your details

Forgot password? Click here to reset