mlsanityData to 14 Oct 2026

Neural Implicit Solution Formula for Efficiently Solving Hamilton-Jacobi Equations

arXiv 2501.19351 ↗First posted 31 Jan 2025cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

This paper presents an implicit solution formula for the Hamilton-Jacobi partial differential equation (HJ PDE). The formula is derived using the method of characteristics and is shown to coincide with the Hopf and Lax formulas in the case where either the Hamiltonian or the initial function is convex. It provides a simple and efficient numerical approach for computing the viscosity solution of HJ PDEs, bypassing the need for the Legendre transform of the Hamiltonian or the initial condition, and the explicit computation of individual characteristic trajectories. A deep learning-based methodology is proposed to learn this implicit solution formula, leveraging the mesh-free nature of deep learning to ensure scalability for high-dimensional problems. Building upon this framework, an algorithm is developed that approximates the characteristic curves piecewise linearly for state-dependent Hamiltonians. Extensive experimental results demonstrate that the proposed method delivers highly accurate solutions, even for nonconvex Hamiltonians, and exhibits remarkable scalability, achieving computational efficiency for problems up to 40 dimensions.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 13 of its 40 references that are in the map. First posted on arXiv 31 Jan 2025.

Builds on

13 of 40 references.

References · 13

  1. 2017DGM: A deep learning algorithm for solving partial differential equationscited by 678
  2. 2020When and why PINNs fail to train: A neural tangent kernel perspectivecited by 634
  3. 2017The Deep Ritz method: A deep learning-based numerical algorithm for solving variational problemscited by 583
  4. 2023In-Context Operator Learning with Data Prompts for Differential Equation Problemscited by 101
  5. 2020Solving high-dimensional Hamilton-Jacobi-Bellman PDEs using neural networks: perspectives from the theory of controlled diffusions and measures on path spacecited by 82
  6. 2016Algorithms for Overcoming the Curse of Dimensionality for Certain Hamilton-Jacobi Equations Arising in Control Theory and Elsewherecited by 24
  7. 2019Overcoming the curse of dimensionality for some Hamilton--Jacobi partial differential equations via neural network architecturescited by 22
  8. 2023Convergence Rates for Stochastic Approximation: Biased Noise with Unbounded Variance, and Applicationscited by 15
  9. 2015Mitigating the Curse of Dimensionality: Sparse Grid Characteristics Method for Optimal Feedback Control and HJB Equationscited by 12
  10. 2017Perspectives on characteristics based curse-of-dimensionality-free numerical approaches for solving Hamilton-Jacobi equationscited by 9
  11. 2017Algorithm for Overcoming the Curse of Dimensionality for State-dependent Hamilton-Jacobi equationscited by 7
  12. 2021Neural network architectures using min-plus algebra for solving certain high dimensional optimal control problems and Hamilton-Jacobi PDEscited by 5
1 more
  1. 2021Hopf-type representation formulas and efficient algorithms for certain high-dimensional optimal control problemscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.