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

TL;DR
This paper introduces verifiable error bounds for physics-informed neural network solutions to Lyapunov and Hamilton-Jacobi-Bellman equations, providing rigorous guarantees and bounds on solution accuracy and optimality.
Contribution
It develops a framework for obtaining verifiable residual-based error bounds for PINN approximations of key PDEs in control theory.
Findings
Residual bounds lead to relative error estimates.
Bounds provide certified upper and lower limits on the value function.
One-sided residual bounds ensure the validity of Lyapunov functions.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Neural Networks and Reservoir Computing · Adaptive Dynamic Programming Control
