arXiv Machine Learning

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.

arXiv Machine Learning
Jun 17

A Convex Quasilinearization Method for Solving Nonlinear PDEs with Physics-Informed Neural Networks

arXiv:2606. 18175v1 Announce Type: cross Abstract: We present a numerical method for the forward solution of nonlinear partial differential equations (PDEs) in which Bellman-Kalaba quasilinearization reduces the nonlinear problem to a sequence of linear subproblems, each discretized by collocation onto a trial space that is linear in its parameters and solved by a single direct linear least-squares QR factorization.

By Gbenga T. Awojinrin, Abdul-Akeem Olawoyin, Rami M. Younis
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
arXiv Machine Learning
Sep 2

Rigorous Error Certification for Neural PDE Solvers: From Empirical Residuals to Solution Guarantees

The paper presents a theoretical framework for certifying the accuracy of physics‑informed neural networks (PINNs) used to solve partial differential equations. It derives generalization bounds that link the residual loss minimized during training to the actual error in the solution space, showing that if the neural approximation stays within a compact subset, a vanishing residual guarantees convergence to the true solution. Deterministic and probabilistic convergence results are provided, offering explicit error guarantees based on residual, boundary, and initial condition errors.

By Amartya Mukherjee, Maxwell Fitzsimmons, David C. Del Rey Fern\'andez, Jun Liu
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 AI
Jun 26

Error-Conditioned Neural Solvers

arXiv:2606. 27354v1 Announce Type: cross Abstract: Neural surrogate models offer fast approximate mappings from PDE parameters to solutions, but they typically treat solving as a purely statistical task: once trained, they struggle to correct their own constraint violations and extrapolate beyond the training distribution.

By Haina Jiang, Liam Wang, Peng-Chen Chen, Min Seop Kwak, Seungryong Kim, Brian Bell, Jeong Joon Park
arXiv Machine Learning
Aug 31

Examining the robustness of Physics-Informed Neural Networks to noise for Inverse Problems

The paper evaluates the robustness of Physics‑Informed Neural Networks (PINNs) against noisy data in inverse problems, comparing them to a finite element method (FEM) plus optimizer baseline. Experiments on viscosity identification in 1D Burgers’ equation and 2D/3D Taylor‑Green Vortex with additive Gaussian noise show that PINNs, while requiring less human expertise, are outperformed by the traditional FEM approach in accuracy (e.g., RMSE 0.01 vs. 0.0013 for 2D Taylor‑Green with σ=1). PINNs do, however, exhibit better scaling with problem complexity, and the study highlights specific training failures that must be addressed for PINNs to become more competitive.

By Aleksandra Jekic, Afroditi Natsaridou, Signe Riemer-S{\o}rensen, Helge Langseth, Odd Erik Gundersen