Backend
PDE-Residual-Informed Kriging
arXiv stat.ML0 views
arXiv:2610.41590v1 Announce Type: new 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.
Source:https://arxiv.org/abs/2610.41590PreviousReliability-Weighted Direct Preference Optimization: Penalized Weights for Robust Preference LearningNextStatistical Foundations of Reinforcement Learning: A Non-Asymptotic Perspective
Related posts
Building Your First Model Context Protocol (MCP) Server: A Team Task Tracker with FastMCP and SQLite
0dev.to
Google Hasn't Verified This App? Fix Your Chrome Extension
0dev.to
Squid forward-proxy security depends on ACL order and a closed default
0dev.to
Compress Images Without Uploading: How Browser-Only Tools Protect Your Files
0dev.to

Intelligent Terminal 0.3 Adds Vertical Agent Sidebar and Headless Tabs — ConPTY + ACP Latency Budget on Windows
0dev.to
Trump Posted 206 Times on 3 November. My Daily Read Saw 28 of Them
0dev.to