arXiv Statistics ML By William Hofgard, Jingruo Sun, Asaf Cohen

Convergence of the Deep Galerkin Method for Finite State Mean Field Control Problems

Read the original on arXiv Statistics ML →

The paper proves that the deep Galerkin method (DGM) converges when applied to Hamilton‑Jacobi‑Bellman equations derived from finite‑state mean field control problems. By showing that the DGM loss can be driven arbitrarily low under sufficient regularity of the value function, and that a vanishing loss forces uniform convergence of the neural network approximators to the true value function on the simplex, the authors establish both existence and convergence results for the DGM. Numerical experiments further illustrate the method’s ability to handle high‑dimensional HJB equations.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

arXiv Machine Learning
Jul 28

Global Convergence of DGM and PINN Algorithms for Solving Nonlinear PDEs

arXiv:2607. 24726v1 Announce Type: new Abstract: The Deep Galerkin Method (DGM) and Physics Informed Neural Networks (PINNs) have become widely-used methods for solving partial differential equations (PDEs) in the rapidly growing field of scientific machine learning.

By Justin Sirignano, Konstantinos Spiliopoulos, Samuel Cohen
arXiv Machine Learning
Sep 17

DPG loss functions for learning parameter-to-solution maps by neural networks

The paper introduces residual-based loss functions derived from Discontinuous Petrov Galerkin (DPG) discretizations for training neural networks to learn parameter-to-solution maps of PDEs. It focuses on rigorous accuracy certification and demonstrates the approach on an elliptic PDE, showing that DPG-based losses outperform simple least-squares losses, especially for high-contrast diffusion problems. The concepts are applicable to any problem with a stable DPG formulation.

By Pablo Cort\'es Castillo, Wolfgang Dahmen, Jay Gopalakrishnan