Verifiable Error Bounds for Physics-Informed Neural Network Solutions of Lyapunov and Hamilton-Jacobi-Bellman Equations

• URL: http://arxiv.org/abs/2603.19545v1
• Date: Fri, 20 Mar 2026 00:58:51 GMT
• Title: Verifiable Error Bounds for Physics-Informed Neural Network Solutions of Lyapunov and Hamilton-Jacobi-Bellman Equations
• Abstract summary: This paper develops verifiable error bounds for approximate solutions of Lyapunov and HJB equations.<n>For both the Lyapunov and HJB PDEs, we show that a verifiable residual bound yields relative error bounds with respect to the true solutions.<n>We show that one-sided residual bounds already imply that the approximation itself defines a valid Lyapunov or control Lyapunov function.
• Score: 7.496694070699515
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many core problems in nonlinear systems analysis and control can be recast as solving partial differential equations (PDEs) such as Lyapunov and Hamilton-Jacobi-Bellman (HJB) equations. Physics-informed neural networks (PINNs) have emerged as a promising mesh-free approach for approximating their solutions, but in most existing works there is no rigorous guarantee that a small PDE residual implies a small solution error. This paper develops verifiable error bounds for approximate solutions of Lyapunov and HJB equations, with particular emphasis on PINN-based approximations. For both the Lyapunov and HJB PDEs, we show that a verifiable residual bound yields relative error bounds with respect to the true solutions as well as computable a posteriori estimates in terms of the approximate solutions. For the HJB equation, this also yields certified upper and lower bounds on the optimal value function on compact sublevel sets and quantifies the optimality gap of the induced feedback policy. We further show that one-sided residual bounds already imply that the approximation itself defines a valid Lyapunov or control Lyapunov function. We illustrate the results with numerical examples.

Related papers

• Rigorous Error Certification for Neural PDE Solvers: From Empirical Residuals to Solution Guarantees [6.335120646343732]
  Physics-informed neural networks approximate solutions by minimizing residual losses at collocation points.<n>We prove that when neural approximations lie in a compact subset of the solution space, vanishing residual error guarantees convergence to the true solution.<n>We derive deterministic and probabilistic convergence results and provide certified generalization bounds translating residual, boundary, and initial errors into explicit solution error guarantees.
  arXiv  Detail & Related papers  (2026-03-19T17:19:48Z)
• Building Trust in PINNs: Error Estimation through Finite Difference Methods [52.92887996882041]
  Physics-informed neural networks (PINNs) constitute a flexible deep learning approach for solving partial differential equations (PDEs)<n>Despite their flexibility, PINNs offer limited insight into how their predictions deviate from the true solution, hindering trust in their prediction quality.<n>We propose a lightweight post-hoc method that addresses this gap by producing pointwise error estimates for PINN predictions.
  arXiv  Detail & Related papers  (2026-03-16T16:51:42Z)
• BEACONS: Bounded-Error, Algebraically-Composable Neural Solvers for Partial Differential Equations [0.0]
  We show how it is possible to circumvent limitations by constructing formally-verified neural network solvers for PDEs.<n>We show how it is possible to construct rigorous extrapolatory bounds on the worst-case Linf errors of shallow neural network approximations.<n>The resulting framework, called BEACONS, comprises both an automatic code-proving for the neural solvers themselves, as well as a bespoke automated theorem-generator system for producing machine-checkable certificates of correctness.
  arXiv  Detail & Related papers  (2026-02-16T15:49:19Z)
• A Physics-Informed Learning Framework to Solve the Infinite-Horizon Optimal Control Problem [4.2402873718254535]
  We propose a physics-informed neural networks (PINNs) framework to solve the infinite-horizon optimal control problem of nonlinear systems.<n>We tackle this by instead applying PINNs to a finite-horizon variant of the steady-state HJB that has a unique solution.<n>Unlike many existing methods, the proposed technique works well with non-polynomial basis functions.
  arXiv  Detail & Related papers  (2025-05-28T00:21:49Z)
• Total Uncertainty Quantification in Inverse PDE Solutions Obtained with Reduced-Order Deep Learning Surrogate Models [50.90868087591973]
  We propose an approximate Bayesian method for quantifying the total uncertainty in inverse PDE solutions obtained with machine learning surrogate models. We test the proposed framework by comparing it with the iterative ensemble smoother and deep ensembling methods for a non-linear diffusion equation.
  arXiv  Detail & Related papers  (2024-08-20T19:06:02Z)
• RoPINN: Region Optimized Physics-Informed Neural Networks [66.38369833561039]
  Physics-informed neural networks (PINNs) have been widely applied to solve partial differential equations (PDEs) This paper proposes and theoretically studies a new training paradigm as region optimization. A practical training algorithm, Region Optimized PINN (RoPINN), is seamlessly derived from this new paradigm.
  arXiv  Detail & Related papers  (2024-05-23T09:45:57Z)
• Physics-Informed Neural Network Method for Parabolic Differential Equations with Sharply Perturbed Initial Conditions [68.8204255655161]
  We develop a physics-informed neural network (PINN) model for parabolic problems with a sharply perturbed initial condition. Localized large gradients in the ADE solution make the (common in PINN) Latin hypercube sampling of the equation's residual highly inefficient. We propose criteria for weights in the loss function that produce a more accurate PINN solution than those obtained with the weights selected via other methods.
  arXiv  Detail & Related papers  (2022-08-18T05:00:24Z)
• Learning differentiable solvers for systems with hard constraints [48.54197776363251]
  We introduce a practical method to enforce partial differential equation (PDE) constraints for functions defined by neural networks (NNs) We develop a differentiable PDE-constrained layer that can be incorporated into any NN architecture. Our results show that incorporating hard constraints directly into the NN architecture achieves much lower test error when compared to training on an unconstrained objective.
  arXiv  Detail & Related papers  (2022-07-18T15:11:43Z)
• Physics-Informed Neural Operator for Learning Partial Differential Equations [55.406540167010014]
  PINO is the first hybrid approach incorporating data and PDE constraints at different resolutions to learn the operator. The resulting PINO model can accurately approximate the ground-truth solution operator for many popular PDE families.
  arXiv  Detail & Related papers  (2021-11-06T03:41:34Z)
• Error analysis for physics informed neural networks (PINNs) approximating Kolmogorov PDEs [0.0]
  We derive rigorous bounds on the error incurred by PINNs in approximating the solutions of a large class of parabolic PDEs. We construct neural networks, whose PINN residual (generalization error) can be made as small as desired. These results enable us to provide a comprehensive error analysis for PINNs in approximating Kolmogorov PDEs.
  arXiv  Detail & Related papers  (2021-06-28T08:37:56Z)
• Optimal oracle inequalities for solving projected fixed-point equations [53.31620399640334]
  We study methods that use a collection of random observations to compute approximate solutions by searching over a known low-dimensional subspace of the Hilbert space. We show how our results precisely characterize the error of a class of temporal difference learning methods for the policy evaluation problem with linear function approximation.
  arXiv  Detail & Related papers  (2020-12-09T20:19:32Z)

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.