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

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

Read the original on arXiv Machine Learning →

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.

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 Machine Learning.

arXiv Machine Learning
Jul 23

PG-KINN: A Physics-Informed Petrov-Galerkin Kolmogorov-Arnold Network for Solving Forward and Inverse PDEs

arXiv:2607. 20378v1 Announce Type: new Abstract: Physics-informed learning of partial differential equations (PDEs) has been dominated by multilayer perceptrons (MLPs), whose spectral bias and dense parameterization limit both accuracy and interpretability.

By Amirhossein Sadr, Nima Soltani, Vahideh Moghtadaiee, Aida Pakniyat, Dara Rahmati, Saeid Gorgin
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 18

Beyond PINNs: A Unified Gauss--Newton and Petrov--Galerkin Framework for Neural and Hybrid PDE Solvers

The paper proposes a unified framework that combines physics‑informed neural networks (PINNs) and finite element methods (FEM) by discretizing functional Gauss–Newton problems using finite families of linear measurements. By interpreting these measurements as test functions, the resulting Gauss–Newton system becomes a Petrov–Galerkin discretization of the linearized functional problem, thereby encompassing pointwise collocation and natural‑gradient approaches as special cases. The framework is specialized to elliptic partial differential equations, yielding weak residual formulations and a hybrid finite‑element–neural architecture that operates on complementary approximation spaces, with numerical experiments confirming its effectiveness.

By Nilo Schwencke, Roland Maier