Physics-Informed Policy Iteration for High-Dimensional Hamilton--Jacobi--Bellman Equations: Interior Error Bounds without Boundary Data
Not on the map. Why?
Abstract (arXiv)
We develop a physics-informed policy-iteration method for stationary second-order Hamilton--Jacobi--Bellman equations arising in continuous-time stochastic control. Each policy-evaluation step is a linear elliptic PDE and is approximated by a mesh-free neural residual solver; policy improvement is then performed pointwise from the surrogate gradient. The analysis addresses bounded-domain training without prescribed boundary data. We prove well-posedness of the PDE-defined evaluation for every Borel Markov policy, establish Lipschitz stability of the greedy map on bounded gradient ranges, and derive an exponential attenuation estimate for unresolved boundary information. These ingredients yield a closed finite-step interior error bound whose floors are determined by a continuous Lp residual, with a finite exponent p>d, and an attenuated amplitude term. The experiments measure the quantities in the estimate. On a linear--quadratic testbed with an exact reference, the gradient-error floor scales nearly linearly with a fresh-sample Lp residual estimate, and finite-difference probes identify when a training buffer is beneficial. At matched architecture and budget, linear fixed-policy training becomes markedly more reliable than direct minimization of the nonlinear HJB residual as the tested problems become more difficult. The method also produces effective feedback on an inverted pendulum, a planar quadrotor, and a 100-dimensional posterior-seeking problem. These nonlinear tests expose two limitations not visible from sampled residuals alone: the collocation distribution may miss the region visited by the learned closed loop, and evaluation without boundary data may leave undetermined the gradient component on which the greedy update depends. On-policy collocation, rollout-anchored evaluation, and rollout-based stopping provide effective model-only safeguards.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 24 references that are in the map. First posted on arXiv 3 Aug 2025.
Builds on
5 of 24 references.
References · 5
- 2017DGM: A deep learning algorithm for solving partial differential equationscited by 678
- 2017Solving high-dimensional partial differential equations using deep learningcited by 556
- 2024Physics-Informed Neural Network Policy Iteration: Algorithms, Convergence, and Verificationcited by 13
- 2023Policy iteration for the deterministic control problems -- a viscosity approachcited by 7
- 2024Hamilton-Jacobi Based Policy-Iteration via Deep Operator Learningcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.