AI Navigate

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

arXiv cs.LG / 3/20/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • Physics-informed neural networks depart from traditional discretization theory by minimizing residual losses at collocation points, introducing new sources of error from optimization, sampling, representation, and overfitting that complicate generalization in the solution space.
  • The paper establishes generalization bounds that connect residual control to errors in the solution space, providing a theoretical link between how well residuals are controlled and how close the neural approximation is to the true PDE solution.
  • It proves that if neural approximations lie in a compact subset of the solution space, vanishing residual error guarantees convergence to the true solution.
  • The work derives both deterministic and probabilistic convergence results and provides certified generalization bounds that translate residual, boundary, and initial errors into explicit solution error guarantees.
  • These results advance uncertainty quantification for neural PDE solvers by offering rigorous guarantees, moving beyond conventional discretization-based error control.

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.