Explicit Discovery of Nonlinear Symmetries from Dynamic Data
Lexiang Hu, Yikang Li, Zhouchen Lin
TL;DR
Explicit Discovery of Nonlinear Symmetries from Dynamic Data introduces LieNLSD, a pipeline that identifies nonlinear infinitesimal generators and their explicit expressions directly in the observation space from dynamic data. It proves that the prolonged infinitesimal group action is linear in the coefficient matrix $W$, enabling a linear system based on the infinitesimal criterion that is solved via SVD, with a sparsification step (LADMAP) for interpretability. The method is validated on linear and nonlinear dynamics, including top quark tagging and Burgers', wave, and Schrödinger equations, and is shown to enhance data augmentation for neural PDE solvers by over 20% in long rollout accuracy. By decoupling neural fitting from symmetry discovery and offering a flexible function library, LieNLSD provides a practical, scalable approach to data-driven symmetry discovery with explicit, interpretable nonlinear generators.
Abstract
Symmetry is widely applied in problems such as the design of equivariant networks and the discovery of governing equations, but in complex scenarios, it is not known in advance. Most previous symmetry discovery methods are limited to linear symmetries, and recent attempts to discover nonlinear symmetries fail to explicitly get the Lie algebra subspace. In this paper, we propose LieNLSD, which is, to our knowledge, the first method capable of determining the number of infinitesimal generators with nonlinear terms and their explicit expressions. We specify a function library for the infinitesimal group action and aim to solve for its coefficient matrix, proving that its prolongation formula for differential equations, which governs dynamic data, is also linear with respect to the coefficient matrix. By substituting the central differences of the data and the Jacobian matrix of the trained neural network into the infinitesimal criterion, we get a system of linear equations for the coefficient matrix, which can then be solved using SVD. On top quark tagging and a series of dynamic systems, LieNLSD shows qualitative advantages over existing methods and improves the long rollout accuracy of neural PDE solvers by over 20% while applying to guide data augmentation. Code and data are available at https://github.com/hulx2002/LieNLSD.
