Neural Implicit Solution Formula for Efficiently Solving Hamilton-Jacobi Equations

• URL: http://arxiv.org/abs/2501.19351v1
• Date: Fri, 31 Jan 2025 17:56:09 GMT
• Title: Neural Implicit Solution Formula for Efficiently Solving Hamilton-Jacobi Equations
• Authors: Yesom Park, Stanley Osher,
• Abstract summary: An implicit solution formula is presented for the Hamilton-Jacobi partial differential equation (HJ PDE) A deep learning-based methodology is proposed to learn this implicit solution formula. An algorithm is developed that approximates the characteristic curves for state-dependent Hamiltonians.
• Score: 0.0
• License:
• Abstract: 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.

Related papers

• FEM-based Neural Networks for Solving Incompressible Fluid Flows and Related Inverse Problems [41.94295877935867]
  numerical simulation and optimization of technical systems described by partial differential equations is expensive. A comparatively new approach in this context is to combine the good approximation properties of neural networks with the classical finite element method. In this paper, we extend this approach to saddle-point and non-linear fluid dynamics problems, respectively.
  arXiv  Detail & Related papers  (2024-09-06T07:17:01Z)
• Efficient explicit gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations [0.6144680854063939]
  One of the most promising applications of quantum computers is solving partial differential equations (PDEs) By using the Schrodingerisation technique - which converts non-conservative PDEs into Schrodinger equations - the problem can be reduced to Hamiltonian simulations. This paper addresses an important gap by efficiently loading these Hamiltonians into the quantum computer through block-encoding.
  arXiv  Detail & Related papers  (2024-05-21T15:13:02Z)
• Approximation of Solution Operators for High-dimensional PDEs [2.3076986663832044]
  We propose a finite-dimensional control-based method to approximate solution operators for evolutional partial differential equations. Results are presented for several high-dimensional PDEs, including real-world applications to solving Hamilton-Jacobi-Bellman equations.
  arXiv  Detail & Related papers  (2024-01-18T21:45:09Z)
• An Optimization-based Deep Equilibrium Model for Hyperspectral Image Deconvolution with Convergence Guarantees [71.57324258813675]
  We propose a novel methodology for addressing the hyperspectral image deconvolution problem. A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network. The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• Symbolic Recovery of Differential Equations: The Identifiability Problem [52.158782751264205]
  Symbolic recovery of differential equations is the ambitious attempt at automating the derivation of governing equations. We provide both necessary and sufficient conditions for a function to uniquely determine the corresponding differential equation. We then use our results to devise numerical algorithms aiming to determine whether a function solves a differential equation uniquely.
  arXiv  Detail & Related papers  (2022-10-15T17:32:49Z)
• 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)
• Message Passing Neural PDE Solvers [60.77761603258397]
  We build a neural message passing solver, replacing allally designed components in the graph with backprop-optimized neural function approximators. We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes. We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, equation parameters, discretizations, etc., in 1D and 2D.
  arXiv  Detail & Related papers  (2022-02-07T17:47:46Z)
• An Operator-Splitting Method for the Gaussian Curvature Regularization Model with Applications in Surface Smoothing and Imaging [6.860238280163609]
  We propose an operator-splitting method for a general Gaussian curvature model. The proposed method is not sensitive to the choice of parameters, its efficiency and performances being demonstrated.
  arXiv  Detail & Related papers  (2021-08-04T08:59:41Z)
• Using a New Nonlinear Gradient Method for Solving Large Scale Convex Optimization Problems with an Application on Arabic Medical Text [0.0]
  We present a nonlinear gradient method for solving convex supra-quadratic functions. Also presented is an application to the problem of named entities in the Arabic medical language.
  arXiv  Detail & Related papers  (2021-06-08T14:13:58Z)
• 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)
• Numerically Solving Parametric Families of High-Dimensional Kolmogorov Partial Differential Equations via Deep Learning [8.019491256870557]
  We present a deep learning algorithm for the numerical solution of parametric families of high-dimensional linear Kolmogorov partial differential equations (PDEs) Our method is based on reformulating the numerical approximation of a whole family of Kolmogorov PDEs as a single statistical learning problem using the Feynman-Kac formula. We show that a single deep neural network trained on simulated data is capable of learning the solution functions of an entire family of PDEs on a full space-time region.
  arXiv  Detail & Related papers  (2020-11-09T17:57:11Z)

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.