High-dimensional Additive Gaussian Processes under Monotonicity Constraints

We introduce an additive Gaussian process framework accounting for monotonicity constraints and scalable to high dimensions. Our contributions are threefold. First, we show that our framework enables to satisfy the constraints everywhere in the input space. We also show that more general componentwise linear inequality constraints can be handled similarly, such as componentwise convexity. Second, we propose the additive MaxMod algorithm for sequential dimension reduction. By sequentially maximizing a squared-norm criterion, MaxMod identifies the active input dimensions and refines the most important ones. This criterion can be computed explicitly at a linear cost. Finally, we provide open-source codes for our full framework. We demonstrate the performance and scalability of the methodology in several synthetic examples with hundreds of dimensions under monotonicity constraints as well as on a real-world flood application. Contributions. Our contributions are threefold. 1) We combine the additive and constrained frameworks to propose an additive constrained GP (cGP) prior. Our framework is based on a finite-dimensional representation involving one-dimensional knots for each active variable. The Preprint. Under review.