Rigorous Error Certification for Neural PDE Solvers: From Empirical Residuals to Solution Guarantees

arXiv:2603.19165 · cs.LG, math.AP, math.FA · Submitted 2026-03-19 · Read on arXiv

cs.LG, math.AP, math.FA

Submitted: 2026-03-19

Updated: 2026-09-01

Comments: 34 pages

License: http://creativecommons.org/licenses/by/4.0/

The gist: Uncertainty quantification for partial differential equations is traditionally grounded in discretization theory, where solution error is controlled via mesh/grid refinement.

Terminology

Abstract

Uncertainty quantification for partial differential equations is traditionally grounded in discretization theory, where solution error is controlled via mesh/grid refinement. Physics-informed neural networks fundamentally depart from this paradigm: they approximate solutions by minimizing residual losses at collocation points, introducing new sources of error arising from optimization, sampling, representation, and overfitting. As a result, the generalization error in the solution space remains an open problem. Our main theoretical contribution establishes generalization bounds that connect residual control to solution-space error. We prove that when neural approximations lie in a compact subset of the solution space, vanishing residual error guarantees convergence to the true solution. We derive deterministic and probabilistic convergence results and provide certified generalization bounds translating residual, boundary, and initial errors into explicit solution error guarantees.

Sources

Related papers