arXiv Machine Learning

Practical Aspects on Solving Differential Equations Using Deep Learning: A Primer

arXiv:2408. 11266v5 Announce Type: replace Abstract: Deep learning is now common across many scientific fields, including the study of partial differential equations.

arXiv Machine Learning
5d ago

Deep-Learning Solvers and Surrogates for Infinity and p-Laplace Problems

The paper explores neural network solvers for infinity and p‑Laplace problems, employing Physics‑Informed Neural Networks (PINNs) and Deep Operator Networks (DeepONets). It addresses computational challenges for large p values (2 to 1000) across 2D and 3D domains, showing advantages over traditional mesh‑based solvers, especially in three dimensions. The authors provide conditional convergence results for PINNs, a universal approximation theorem for DeepONet on the parametric p‑Poisson problem, and validate their methods with numerical experiments comparing performance to conventional approaches.

By Tak Shing Au Yeung, Ka Chun Cheung, Hannah Potgieter, Steven J. Ruuth, Simon See
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
Jul 21

One-shot acceleration of transient PDE solvers via online-learned preconditioners

arXiv:2509. 08765v4 Announce Type: replace-cross Abstract: Data-driven acceleration of scientific computing workflows has been a high-profile aim of machine learning (ML) for science, with numerical simulation of transient partial differential equations (PDEs) being one of the main applications.

By Mikhail Khodak, Min Ki Jung, Brian Wynne, Edmond Chow, Egemen Kolemen
arXiv Statistics ML
Aug 24

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

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.

By William Hofgard, Jingruo Sun, Asaf Cohen