Symbolic Graph Networks for Robust PDE Discovery from Noisy Sparse Data
Xingyu Chen, Junxiu An, Jun Guo, Yuqian Zhou

TL;DR
This paper introduces a Symbolic Graph Network framework that enhances the robustness of PDE discovery from noisy and sparse data by leveraging non-local graph message passing and symbolic regression.
Contribution
It proposes a novel SGN approach combining graph message passing with symbolic regression for PDE discovery under challenging data conditions.
Findings
SGN accurately recovers PDEs from noisy sparse data.
SGN outperforms baseline methods in robustness.
Applicable to complex systems like Navier-Stokes equations.
Abstract
Data-driven discovery of partial differential equations (PDEs) offers a promising paradigm for uncovering governing physical laws from observational data. However, in practical scenarios, measurements are often contaminated by noise and limited by sparse sampling, which poses significant challenges to existing approaches based on numerical differentiation or integral formulations. In this work, we propose a Symbolic Graph Network (SGN) framework for PDE discovery under noisy and sparse conditions. Instead of relying on local differential approximations, SGN leverages graph message passing to model spatial interactions, providing a non-local representation that is less sensitive to high frequency noise. Based on this representation, the learned latent features are further processed by a symbolic regression module to extract interpretable mathematical expressions. We evaluate the proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Neural Networks and Reservoir Computing · Machine Learning in Materials Science
