In this work, we propose a new Gaussian process (GP) regression framework that enforces the physical constraints in a probabilistic manner. Specifically, we focus on inequality and monotonicity constraints. This GP model is trained by the quantum-inspired Hamiltonian Monte Carlo (QHMC) algorithm, which is an efficient way to sample from a broad class of distributions by allowing a particle to have a random mass matrix with a probability distribution. Integrating the QHMC into the inequality and monotonicity constrained GP regression in the probabilistic sense, our approach enhances the accuracy and reduces the variance in the resulting GP model. Additionally, the probabilistic aspect of the method leads to reduced computational expenses and execution time. Further, we present an adaptive learning algorithm that guides the selection of constraint locations. The accuracy and efficiency of the method are demonstrated in estimating the hyperparameter of high-dimensional GP models under noisy conditions, reconstructing the sparsely observed state of a steady state heat transport problem, and learning a conservative tracer distribution from sparse tracer concentration measurements.
This study introduces a novel Gaussian process (GP) regression framework that probabilistically enforces physical constraints, with a particular focus on equality conditions. The GP model is trained using the quantum-inspired Hamiltonian Monte Carlo (QHMC) algorithm, which efficiently samples from a wide range of distributions by allowing a particle's mass matrix to vary according to a probability distribution. By integrating QHMC into the GP regression with probabilistic handling of the constraints, the approach balances the computational cost and accuracy in the resulting GP model as the probabilistic nature of the method contributes to shorter execution times compared with existing GP-based approaches. Additionally, an adaptive learning algorithm is introduced to optimize the selection of constraint locations, further enhancing the method's flexibility. The effectiveness and efficiency of this approach are demonstrated through several applications: estimating hyperparameters for high-dimensional GP models under noisy conditions and reconstructing a sparsely observed steady-state heat transport problem. The numerical results indicate that the proposed approach accelerates the process while maintaining the accuracy.
This study introduces a novel Gaussian process (GP) regression framework that probabilistically enforces physical constraints, with a particular focus on equality conditions. The GP model is trained using the quantum-inspired Hamiltonian Monte Carlo (QHMC) algorithm, which efficiently samples from a wide range of distributions by allowing a particle’s mass matrix to vary according to a probability distribution. By integrating QHMC into the GP regression with probabilistic handling of the constraints, this approach balances the computational cost and accuracy in the resulting GP model, as the probabilistic nature of the method contributes to shorter execution times compared with existing GP-based approaches. Additionally, we introduce an adaptive learning algorithm to optimize the selection of constraint locations to further enhance the flexibility of the method. We demonstrate the effectiveness and robustness of our algorithm on synthetic examples, including 2-dimensional and 10-dimensional GP models under noisy conditions, as well as a practical application involving the reconstruction of a sparsely observed steady-state heat transport problem. The proposed approach reduces the posterior variance in the resulting model, achieving stable and accurate sampling results across all test cases while maintaining computational efficiency.
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.