Fast Gaussian Processes under Monotonicity Constraints
Chao Zhang, Jasper M. Everink, Jakob Sauer J{\o}rgensen

TL;DR
This paper introduces a novel, efficient framework for Gaussian process models with monotonicity constraints, improving computational speed and applicability in high-dimensional scientific problems.
Contribution
It proposes a virtual point-based approach using RLRTO and NUTS sampling, enhancing efficiency and scalability of constrained Gaussian process models.
Findings
Comparable predictive performance across methods
Significant computational efficiency improvements
Effective application to differential equation systems
Abstract
Gaussian processes (GPs) are widely used as surrogate models for complicated functions in scientific and engineering applications. In many cases, prior knowledge about the function to be approximated, such as monotonicity, is available and can be leveraged to improve model fidelity. Incorporating such constraints into GP models enhances predictive accuracy and reduces uncertainty, but remains a computationally challenging task for high-dimensional problems. In this work, we present a novel virtual point-based framework for building constrained GP models under monotonicity constraints, based on regularized linear randomize-then-optimize (RLRTO), which enables efficient sampling from a constrained posterior distribution by means of solving randomized optimization problems. We also enhance two existing virtual point-based approaches by replacing Gibbs sampling with the No U-Turn Sampler…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Advanced Multi-Objective Optimization Algorithms · Model Reduction and Neural Networks
