cs.LGMar 24, 2026

Weak-PDE-Net: Discovering Open-Form PDEs via Differentiable Symbolic Networks and Weak Formulation

Authors: Xinxin Li, Xingyu Cui, Jin Qi, Juan Zhang, Da Li, Junping Yin

Organizations: School of Mathematical Sciences, East China Normal University, Shang Hai, 200241, China · Institute of Applied Physics and Computational Mathematics, 100094, Beijing, China · Shanghai Zhangjiang Institute of Mathematics, 201203, Shanghai, China · Institute of Artificial Intelligence, Beihang University, 100191, Beijing, China · Academy for Advanced Interdisciplinary Studies, Northeast Normal University, 130024, Changchun, Jilin, China

Abstract

Discovering governing Partial Differential Equations (PDEs) from sparse and noisy data is a challenging issue in data-driven scientific computing. Conventional sparse regression methods often suffer from two major limitations: (i) the instability of numerical differentiation under sparse and noisy data, and (ii) the restricted flexibility of a pre-defined candidate library. We propose Weak-PDE-Net, an end-to-end differentiable framework that can robustly identify open-form PDEs. Weak-PDE-Net consists of two interconnected modules: a forward response learner and a weak-form PDE generator. The learner embeds learnable Gaussian kernels within a lightweight MLP, serving as a surrogate model that adaptively captures system dynamics from sparse observations. Meanwhile, the generator integrates a symbolic network with an integral module to construct weak-form PDEs, avoiding explicit numerical differentiation and improving robustness to noise. To relax the constraints of the pre-defined library, we leverage Differentiable Neural Architecture Search strategy during training to explore the functional space, which enables the efficient discovery of open-form PDEs. The capability of Weak-PDE-Net in multivariable systems discovery is further enhanced by incorporating Galilean Invariance constraints and symmetry equivariance hypotheses to ensure physical consistency. Experiments on several challenging PDE benchmarks demonstrate that Weak-PDE-Net accurately recovers governing equations, even under highly sparse and noisy observations.

Figures & tables

Appendix figures & tables6 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Symbolic Graph Networks for Robust PDE Discovery from Noisy Sparse Data

    Mar 23, 2026Xingyu Chen, Junxiu An, Jun Guo +1PDE DiscoveryGraph Neural Networks

  2. LLM-PDESR: Robust PDE Discovery via Subdomain Weighted Residuals and LLM-Guided Symbolic Hypothesis Generation

    Jul 12, 2026Jinyang Du, Hao Ma, Xiaohu Shi +4PDE DiscoveryLarge Language Model-Guided Scientific Discovery

  3. EqOD: Symmetry-Informed Stability Selection for PDE Identification

    May 12, 2026Gnankan Landry Regis N'guessan, Bum Jun KimPDE Discovery