Skip to content

PDE-Residual-Informed Kriging

Oct 2026 · 0 citations
Mathematics Computer Science

TL;DR

This study proposes PDE-residual-informed Kriging (PRIK) based on a PDE-residual kernel, which makes PRIK yield the posterior mean with minimum integrated squared PDE residual, and establishes regularity and stability conditions for the posterior mean, together with a nonasymptotic bound for its PDE-residual norm.

Abstract

Physics-informed Gaussian process (GP) methods provide a probabilistic framework for PDE solving. Existing approaches incorporate PDE information in different ways: pointwise conditioning uses the governing equation only at finitely many selected locations, globally constrained GPs restrict the admissible functions to satisfy the PDE exactly, and residual-penalized methods control the PDE mismatch over the whole domain through an additional penalty weight. What is still missing is a GP formulation that directly incorporates global PDE-residual information of the entire domain into its covariance structure, while retaining model flexibility and standard GP conditioning without a separate residual-weight parameter. To solve this issue, this study proposes PDE-residual-informed Kriging (PRIK) based on a PDE-residual kernel. The PDE-residual kernel is constructed by equipping a kernel-section space with an inner product defined by the $L^{2}$ inner product of PDE residuals. This construction makes PRIK yield the posterior mean with minimum integrated squared PDE residual. It also provides direct statistical interpretations: the variance-scale estimate equals the normalized PDE-residual energy (i.e., the integrated squared PDE residual of the posterior mean divided by the number of labeled observations), and the profile likelihood balances this residual energy against model complexity. Under the stated regularity and stability conditions, we establish $H^{2}$-quasi-optimality and convergence rates for the posterior mean, together with a nonasymptotic bound for its PDE-residual norm. We further show that the normalized posterior kernel converges to a variational Green-type kernel and derive a uniform nonasymptotic contraction bound for the posterior variance. Numerical studies provide empirical evidence consistent with the theory and demonstrate the PDE-solving capability of PRIK.

View source

Similar papers

Conference

Physics-Informed Gaussian Process with applications in ODE/PDE parameter estimation

<p>Parameter estimation for nonlinear dynamic system models, represented by ordinary differential equations (ODEs) or partial differential equations (PDEs), using noisy and sparse experimental data is a vital task in many fields. We propose a fast and accurate method, physics-informed Gaussian process, for this task. O...

Shi-Hao Yang · 0 citations
Preprint Oct 2026

CFKS: Continuum-Feature Kernel PDE Solvers

Neural-network-based PDE solvers require architectural choices, particularly the number of layers and neurons per layer. Fixing a single Gaussian radial basis function (RBF) feature layer and taking the number of features to the continuum limit removes the need to prescribe a finite feature count or select individual f...

Vikas Dwivedi, Balaji Srinivasan, Monica Sigovan et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Efficient Message Passing for Partial Differential Equation Priors

Prior information for real-world physical quantities is most elegantly expressed via partial differential equations (PDEs). In this paper, we propose a novel way to solve PDEs using probabilistic inference on a factor graph. In general, factor graphs provide a natural way to encode prior knowledge into a model as expli...

Анна Петровна Казачкова, Leonhard Hennicke, Rainer Schlösser et al. · 0 citations
#machine learning Preprint Oct 2026

Backward-Consistent Diffusion Sampling for Sparsely Observed PDE Inverse Problems

Recovering Partial Differential Equation (PDE) coefficient fields from extremely sparse observations is a severely ill-posed inverse problem for which generative machine learning methods (e.g., diffusion models) have become a leading way to encode the prior. Recent state-of-the-art diffusion solvers lift these priors t...

Yi Pan, Muhammad H. Ashiq, Chan-Yong Jung et al. · 0 citations
#machine learning Preprint Oct 2026

Constrained Probabilistic Numerics: Gaussian Process Solvers for Linear PDEs under Linear Inequality Constraints

Gaussian process solvers for linear partial differential equations (PDEs) return posteriors rather than point estimates, but they condition only on equality information: the PDE residual, boundary data, and measurements. Many solutions of interest also obey inequality constraints, including nonnegativity, monotonicity,...

B. Deng, Kshitiz Upadhyay, Michael D. Shields · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.