PIKS: Universal Physics-Informed Kernel Methods

• URL: http://arxiv.org/abs/2607.27062v1
• Date: Wed, 29 Jul 2026 15:53:03 GMT
• Title: PIKS: Universal Physics-Informed Kernel Methods
• Abstract summary: We introduce and analyze Physics-Informed Kernel methodS (PIKS)<n>We establish universal consistency of PIKS for linear differential constraints.<n>We derive finite-sample bounds under suitable source conditions.
• Score: 10.777100904381378
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Physics-informed machine learning incorporates physical principles --often expressed via differential operators-- into data-driven models. While physics-informed neural networks (PINNs) dominate empirical applications, the complexity of neural network architectures and optimization landscapes hinders the development of a corresponding learning theory. In turn, kernel methods offer an appealing alternative with closed-form solutions and analytical tractability, yet existing guarantees primarily cover the well-specified setting where the target belongs to the native Reproducing Kernel Hilbert Space (RKHS). This imposes unrealistic regularity assumptions that physical targets often fail to satisfy. In this paper, we introduce and analyze Physics-Informed Kernel methodS (PIKS). We establish the universal consistency of PIKS for linear differential constraints, proving that for universal kernels (such as Gaussian or Matérn), the estimator asymptotically learns the target while satisfying physical constraints. We further derive finite-sample bounds under suitable source conditions. Our analysis is based on extending classical operator-theoretic analysis of kernel methods to physics-informed machine learning. Numerical experiments demonstrate that PIKS can be competitive with PINNs and traditional finite element methods.

Related papers

• Physics Informed Random Feature Neural Networks for Solving PDEs [2.4950174245110204]
  We introduce a physics-informed random feature method for countering part of the spectral bias which PINN-based solvers are facing for a certain class of PDEs.<n>In this paper, we develop a rigorous approximation error analysis and derive high-probability error bounds on the $H1$ norm.
  arXiv  Detail & Related papers  (2026-09-14T22:22:20Z)
• Generalized Neural Operator for Parametric and Boundary-Value Problems [39.8019405552335]
  Current deep learning approaches largely face a structural trade-off between condition-agnostic deployment and physical fidelity.<n>Our framework demonstrates the theoretical benefits of explicitly conditioning on PDE parameters and boundary conditions.
  arXiv  Detail & Related papers  (2026-07-24T03:10:32Z)
• Generalization in Deep Neural Networks: Minimax Rates for Gradient Methods [42.41448048632761]
  This paper provides a comprehensive generalization analysis of deep neural networks (DNNs) trained using gradient-based methods.<n>We establish, for the first time, a crucial connection between the learning dynamics of a DNN with smooth activation functions trained via gradient-based methods and those of kernel methods.<n>We derive the first known minimax-optimal rates for the excess population risk of gradient descent (GD) and gradient descent (SGD)
  arXiv  Detail & Related papers  (2026-06-04T23:31:52Z)
• AdaKernel: Learning Adaptive Kernel Parameters for Spatiotemporal Graph Neural Networks [41.813456621843464]
  We propose a simple yet effective approach that learns adaptive kernel parameters within the neural network.<n>AdaKernel consistently improves various Graph Neural Networks (GNNs) and outperforms model-agnostic adaptive baselines.
  arXiv  Detail & Related papers  (2026-05-31T15:07:20Z)
• Spectral Analysis of Hard-Constraint PINNs: The Spatial Modulation Mechanism of Boundary Functions [4.170072254495455]
  This work reveals that the boundary function $B$ introduces a multiplicative spatial modulation that fundamentally alters the learning landscape.<n>A rigorous Neural Tangent Kernel (NTK) framework for HC-PINNs is established, deriving the explicit kernel composition law.<n>It is shown that widely used boundary functions can inadvertently induce spectral collapse, leading to optimization stagnation despite exact boundary satisfaction.
  arXiv  Detail & Related papers  (2025-12-29T08:31:58Z)
• Uncertainty-Aware Diagnostics for Physics-Informed Machine Learning [7.677300807530908]
  Physics-informed machine learning (PIML) integrates prior physical information, often in the form of differential equation constraints, into the process of fitting models to physical data.<n>We introduce the Physics-Informed Log Evidence (PILE) score to measure the quality of PIML models.<n>We show that PILE yields excellent choices for a wide variety of model parameters, including kernel bandwidth, least squares regularization weights, and even kernel function selection.
  arXiv  Detail & Related papers  (2025-10-30T04:05:49Z)
• Generalization Bound of Gradient Flow through Training Trajectory and Data-dependent Kernel [55.82768375605861]
  We establish a generalization bound for gradient flow that aligns with the classical Rademacher complexity for kernel methods.<n>Unlike static kernels such as NTK, the LPK captures the entire training trajectory, adapting to both data and optimization dynamics.
  arXiv  Detail & Related papers  (2025-06-12T23:17:09Z)
• SEEK: Self-adaptive Explainable Kernel For Nonstationary Gaussian Processes [0.0]
  We introduce SEEK, a class of learnable kernels to model complex, nonstationary functions via Gaussian processes.<n>Inspired by artificial neurons, SEEK is derived from first principles to ensure symmetry and positive semi-definiteness, key properties of valid kernels.<n>We conduct comprehensive sensitivity analyses and comparative studies to demonstrate that our approach is not only robust to many of its design choices, but also outperforms existing stationary/nonstationary kernels in both mean prediction accuracy and uncertainty quantification.
  arXiv  Detail & Related papers  (2025-03-18T23:30:02Z)
• Physics-informed kernel learning [7.755962782612672]
  We propose a tractable estimator that minimizes the physics-informed risk function. We show that PIKL can outperform physics-informed neural networks in terms of both accuracy and computation time.
  arXiv  Detail & Related papers  (2024-09-20T06:55:20Z)
• Physics-Informed Gaussian Process Regression Generalizes Linear PDE Solvers [32.57938108395521]
  A class of mechanistic models, Linear partial differential equations, are used to describe physical processes such as heat transfer, electromagnetism, and wave propagation. specialized numerical methods based on discretization are used to solve PDEs. By ignoring parameter and measurement uncertainty, classical PDE solvers may fail to produce consistent estimates of their inherent approximation error.
  arXiv  Detail & Related papers  (2022-12-23T17:02:59Z)
• NeuralEF: Deconstructing Kernels by Deep Neural Networks [47.54733625351363]
  Traditional nonparametric solutions based on the Nystr"om formula suffer from scalability issues. Recent work has resorted to a parametric approach, i.e., training neural networks to approximate the eigenfunctions. We show that these problems can be fixed by using a new series of objective functions that generalizes to space of supervised and unsupervised learning problems.
  arXiv  Detail & Related papers  (2022-04-30T05:31:07Z)
• Partial Differential Equations is All You Need for Generating Neural Architectures -- A Theory for Physical Artificial Intelligence Systems [40.20472268839781]
  We generalize the reaction-diffusion equation in statistical physics, Schr"odinger equation in quantum mechanics, Helmholtz equation in paraxial optics. We take finite difference method to discretize NPDE for finding numerical solution. Basic building blocks of deep neural network architecture, including multi-layer perceptron, convolutional neural network and recurrent neural networks, are generated.
  arXiv  Detail & Related papers  (2021-03-10T00:05:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.