Gaussian Process Regression with Soft Inequality and Monotonicity Constraints

Didem Kochan, Xiu Yang
4/3/2024
stat.MLcs.LGmath.OC

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Gaussian process (GP) regression is a non-parametric, Bayesian framework to approximate complex models. Standard GP regression can lead to an unbounded model in which some points can take infeasible values. We introduce a new GP method that enforces the physical constraints in a probabilistic manner. This GP model is trained by the quantum-inspired Hamiltonian Monte Carlo (QHMC). QHMC is an efficient way to sample from a broad class of distributions. Unlike the standard Hamiltonian Monte Carlo algorithm in which a particle has a fixed mass, QHMC allows a particle to have a random mass matrix with a probability distribution. Introducing the QHMC method to the inequality and monotonicity constrained GP regression in the probabilistic sense, our approach improves the accuracy and reduces the variance in the resulting GP model. According to our experiments on several datasets, the proposed approach serves as an efficient method as it accelerates the sampling process while maintaining the accuracy, and it is applicable to high dimensional problems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kochan2024gaussian,
  title  = {Gaussian Process Regression with Soft Inequality and Monotonicity Constraints},
  author = {Didem Kochan and Xiu Yang},
  year   = {2024},
  eprint = {2404.02873},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.02873v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.02873.svg)](https://codeofpaper.com/paper/2404.02873)

Discussion