ANaGRAM: A Natural Gradient Relative to Adapted Model for efficient PINNs learning
Nilo Schwencke, Cyril Furtlehner
TL;DR
ANaGRAM addresses training efficiency and accuracy limitations of Physics-Informed Neural Networks (PINNs) for solving PDEs by introducing an empirical natural-gradient method with complexity ${\mathcal{O}}(\min(P^2S, S^2P))$ and a functional-analytic reformulation that extends natural gradient to PINNs and links to Green's functions. The authors prove that the PINN natural-gradient update corresponds to a generalized Green's function on the tangent space and demonstrate robust performance across multiple PDE benchmarks (2D and 5D Laplace, Heat, Allen-Cahn), often outperforming standard NG approaches with competitive compute times. The work provides a geometric, scalable pathway for geometry-aware optimization in PINNs and suggests practical avenues for data assimilation and high-dimensional PDE solvers. Overall, ANaGRAM offers both theoretical insight and practical improvements for training PINNs on challenging PDE problems.
Abstract
In the recent years, Physics Informed Neural Networks (PINNs) have received strong interest as a method to solve PDE driven systems, in particular for data assimilation purpose. This method is still in its infancy, with many shortcomings and failures that remain not properly understood. In this paper we propose a natural gradient approach to PINNs which contributes to speed-up and improve the accuracy of the training. Based on an in depth analysis of the differential geometric structures of the problem, we come up with two distinct contributions: (i) a new natural gradient algorithm that scales as $\min(P^2S, S^2P)$, where $P$ is the number of parameters, and $S$ the batch size; (ii) a mathematically principled reformulation of the PINNs problem that allows the extension of natural gradient to it, with proved connections to Green's function theory.
