Leveraging Lie Group Symmetries to Enhance Physics-Informed Neural Networks for the Fundamental Solution of Linear PDEs
Xiaopei Jiao, Fansheng Xiong
TL;DR
The paper addresses the computational bottleneck of obtaining fundamental solutions for linear PDEs with PINNs by exploiting Lie group symmetries. It introduces the Linearized Symmetric Condition (LSC), $Q = \eta - \xi K_x - \tau K_t = 0$, as a first-order residual that replaces higher-order derivatives in the physics loss, enabling the Deep Symmetric Fundamental Solver (GsPINN). Key contributions include the invariance-principle framework for invariant generators, the LSC-based residual, and numerical demonstrations showing deterministic 20–30% training-time speedups while maintaining accuracy, including high-dimensional problems. This approach offers a scalable, mesh-free pathway for real-time kernel evaluations in Cauchy problems and broadens symmetry-informed methods in Scientific Machine Learning (SciML).
Abstract
Since the introduction of deep learning for solving partial differential equations (PDEs), there has been growing interest in real-time system responses, where the kernel function plays a key role. Physics-informed neural networks (PINNs), a popular mesh-free, semi-supervised learning tool, offer high flexibility. This paper explores the integration of Lie symmetry groups with deep learning techniques to enhance the numerical solutions of fundamental PDEs. We propose a novel approach that combines PINNs and Lie group theory to address computational inefficiencies in traditional methods. By incorporating the linearized symmetric condition (LSC) derived from Lie symmetries into PINNs, we introduce a new residual loss function that requires fewer derivatives for calculation. This integration reduces computational costs and improves solution accuracy. Numerical simulations demonstrate a significant reduction in training time while maintaining accuracy. Additionally, we provide a framework for identifying invariant infinitesimal generators for arbitrary Cauchy problems. This unsupervised algorithm does not require prior numerical solutions, making it practical and efficient for various applications.
