Solving Roughly Forced Nonlinear PDEs via Misspecified Kernel Methods and Neural Networks

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Baptista, Ricardo, Calvello, Edoardo, Darcy, Matthieu, Owhadi, Houman, Stuart, Andrew M., Yang, Xianjin
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866909469882974208
author Baptista, Ricardo
Calvello, Edoardo
Darcy, Matthieu
Owhadi, Houman
Stuart, Andrew M.
Yang, Xianjin
author_facet Baptista, Ricardo
Calvello, Edoardo
Darcy, Matthieu
Owhadi, Houman
Stuart, Andrew M.
Yang, Xianjin
contents We consider the use of Gaussian Processes (GPs) or Neural Networks (NNs) to numerically approximate the solutions to nonlinear partial differential equations (PDEs) with rough forcing or source terms, which commonly arise as pathwise solutions to stochastic PDEs. Kernel methods have recently been generalized to solve nonlinear PDEs by approximating their solutions as the maximum a posteriori estimator of GPs that are conditioned to satisfy the PDE at a finite set of collocation points. The convergence and error guarantees of these methods, however, rely on the PDE being defined in a classical sense and its solution possessing sufficient regularity to belong to the associated reproducing kernel Hilbert space. We propose a generalization of these methods to handle roughly forced nonlinear PDEs while preserving convergence guarantees with an oversmoothing GP kernel that is misspecified relative to the true solution's regularity. This is achieved by conditioning a regular GP to satisfy the PDE with a modified source term in a weak sense (when integrated against a finite number of test functions). This is equivalent to replacing the empirical $L^2$-loss on the PDE constraint by an empirical negative-Sobolev norm. We further show that this loss function can be used to extend physics-informed neural networks (PINNs) to stochastic equations, thereby resulting in a new NN-based variant termed Negative Sobolev Norm-PINN (NeS-PINN).
format Preprint
id arxiv_https___arxiv_org_abs_2501_17110
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Solving Roughly Forced Nonlinear PDEs via Misspecified Kernel Methods and Neural Networks
Baptista, Ricardo
Calvello, Edoardo
Darcy, Matthieu
Owhadi, Houman
Stuart, Andrew M.
Yang, Xianjin
Numerical Analysis
Machine Learning
We consider the use of Gaussian Processes (GPs) or Neural Networks (NNs) to numerically approximate the solutions to nonlinear partial differential equations (PDEs) with rough forcing or source terms, which commonly arise as pathwise solutions to stochastic PDEs. Kernel methods have recently been generalized to solve nonlinear PDEs by approximating their solutions as the maximum a posteriori estimator of GPs that are conditioned to satisfy the PDE at a finite set of collocation points. The convergence and error guarantees of these methods, however, rely on the PDE being defined in a classical sense and its solution possessing sufficient regularity to belong to the associated reproducing kernel Hilbert space. We propose a generalization of these methods to handle roughly forced nonlinear PDEs while preserving convergence guarantees with an oversmoothing GP kernel that is misspecified relative to the true solution's regularity. This is achieved by conditioning a regular GP to satisfy the PDE with a modified source term in a weak sense (when integrated against a finite number of test functions). This is equivalent to replacing the empirical $L^2$-loss on the PDE constraint by an empirical negative-Sobolev norm. We further show that this loss function can be used to extend physics-informed neural networks (PINNs) to stochastic equations, thereby resulting in a new NN-based variant termed Negative Sobolev Norm-PINN (NeS-PINN).
title Solving Roughly Forced Nonlinear PDEs via Misspecified Kernel Methods and Neural Networks
topic Numerical Analysis
Machine Learning
url https://arxiv.org/abs/2501.17110