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
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
Figure 1: The overall architecture of Weak-PDE-Net.
Figure 2: Overview of the training process, exemplified by the Burgers equation. The training progress through two parallel tracks. The PDE Learning Process focuses on learning the PDE solution, consistently reconstructing the full grid data. Concurrently, the PDE Discovery Process evolves from symbolic network architecture adaptation, to connectivity pruning for structural sparsity, and finally to precise coefficient refinement. These two tracks are jointly optimized via a shared loss.
Figure 3: The forward propagation of the symbolic network during the searching phase. The left panel illustrates the overall forward propagation framework; the right panel provides the specific details of the functional operation.
σNR
r
TPR
E∞
E2
L(U^,U)
Discovered Equation
Varying Sample Ratio
0%
2.5%
1.00
0.0589
0.0557
2.97×10−4
∂tu=−0.4722∂xu2+0.1059∂xxu
0%
5.0%
1.00
0.0184
0.0182
1.54×10−4
∂tu=−0.4908∂xu2+0.0992∂xxu
0%
10%
1.00
0.0096
0.0095
7.14×10−5
∂tu=−0.5048∂xu2+0.1007∂xxu
0%
25%
1.00
0.0213
0.0047
5.07×10−5
∂tu=−0.5011∂xu2+0.1021∂xxu
0%
50%
1.00
0.0012
0.0008
4.84×10−5
∂tu=−0.4996∂xu2+0.1001∂xxu
Table 1: Performance evaluation on Burgers equation.
σNR
r
TPR
E∞
E2
L(U^,U)
Discovered Equation
Varying Sample Ratio
0%
2.5%
1.00
0.0719
0.0259
1.38×10−4
∂tu=−3.0394∂xu2−0.9281∂xxxu
0%
5.0%
1.00
0.0373
0.0139
1.48×10−4
∂tu=−2.9766∂xu2−1.0373∂xxxu
0%
10%
1.00
0.0254
0.0120
4.12×10−5
∂tu=−2.9718∂xu2−1.0254∂xxxu
0%
25%
1.00
0.0376
0.0119
6.49×10−5
∂tu=−3.0013∂xu2−1.0376∂xxxu
0%
50%
1.00
0.0274
0.0103
1.47×10−5
∂tu=−3.0174∂xu2−1.0274∂xxxu
Table 2: Performance evaluation on the KdV equation.
σNR
r
TPR
E∞
E2
L(U^,U)
Discovered Equation
Varying Sample Ratio
0%
2.5%
1.00
0.0173
0.0149
4.47×10−3
∂tu=−0.4916∂x(u)2−1.0115∂xxu−1.0173∂xxxxu
0%
5.0%
1.00
0.0076
0.0045
2.13×10−3
∂tu=−0.4962∂x(u2)−0.9946∂xxu−0.9989∂xxxxu
0%
10%
1.00
0.0120
0.0042
2.77×10−3
∂tu=−0.4940∂x(u2)−0.9998∂xxu−1.0012∂xxxxu
0%
25%
1.00
0.0055
0.0021
1.66×10−3
∂tu=−0.5027∂x(u2)−0.9985∂xxu−0.9995∂xxxxu
0%
50%
1.00
0.0032
0.0029
1.01×10−3
∂tu=−0.4998∂x(u2)−1.0032∂xxu−1.0030∂xxxxu
Table 3: Performance evaluation on the KS equation.
σNR
r
TPR
E∞
E2
L(U^,U)
Discovered Equation
Varying Sample Ratio
0%
2.5%
1.00
0.2149
0.1523
9.25×10−4
∂tu=0.9298u3−0.7851u+0.8643∂xxu
0%
5.0%
1.00
0.1520
0.1189
1.93×10−5
∂tu=0.9200u3−0.8480u+0.8865∂xxu
0%
10%
1.00
0.1139
0.0968
2.37×10−5
∂tu=0.9314u3−0.8861u+0.8977∂xxu
0%
25%
1.00
0.1224
0.0955
6.06×10−6
∂tu=0.9317u3−0.8776u+0.9123∂xxu
0%
50%
1.00
0.1121
0.0926
1.00×10−5
∂tu=0.9297u3−0.8879u+0.9094∂xxu
Table 4: Performance evaluation on the CI equation. The symbol −− indicates that forward learning is not required under full sampling conditions; therefore, the reconstruction MSE is not applicable.
Table 8: Performance evaluation on the incompressible NS equation at Re=100 . The symbol −− indicates that forward learning is not required under full sampling conditions; therefore, the reconstruction MSE is not applicable.
Figure 4: The results of the ablation studies. (a) A radar chart illustrating the True Positive Rate TPR . (b) and (c) Line plots showcasing the parameter errors E∞ and E2 , respectively. (d) A bar chart representing the reconstructed error L(U^,U) .
Noise
Burgers
KdV
KS
E∞
E2
E∞
E2
E∞
E2
WPL
Ours
WPL
Ours
WPL
Ours
WPL
Ours
WPL
Ours
WPL
Ours
25%
0.0130
0.0098
0.0130
0.0097
0.0070
0.0040
0.0036
0.0036
0.0100
0.0066
0.0094
0.0049
50%
0.0808
0.0593
0.0801
0.0117
0.0262
0.0136
0.0259
0.0062
0.0383
0.0487
0.0400
0.0342
75%
0.1530
0.1746
0.0982
0.0343
0.0520
0.0393
0.0494
0.0352
0.1153
0.0895
0.1300
0.0331
100%
0.3400
0.1931
0.1334
0.0552
0.1838
0.0732
0.1752
0.0719
–
0.1340
–
0.0973
Table 9: Comparative evaluation against Weak-PDE-LEARN (WPL). The symbol – for E∞ and E2 indicates that the equation was not correctly identified ( TPR<1 ).
Appendix figures & tables6 assets
Supplementary material from the paper’s appendix.
Appendix
Parameter Name
Symbol
Value
Test Function Type
Φ
Poly-bump (KdV) / Exp-bump (Others)
Support Radius Range
(ηmin,ηmax)
(0.2,0.4)
Number of Gaussian Kernels
N
1000
Gaussian Feature Dimension
d′
4
Lightweight MLP Depth
L
2
MLP Activation Function
σ
sin (NS) / tanh (Others)
Appendix
Table 10: Hyperparameter settings used in the experiments.
Table 11: Reconstruction performance of the learned response function U for 1D equations.
Table 12: Reconstruction performance of the learned response function U for 2D equations.
Table 13: Reconstruction performance of the learned response function U for 2D NS equation.
Equation
Settings
TPR
E∞
E2
L(U^,U)
Discovered Equation
Burgers
r=10% , FEϕ +NAS
1.00
0.0096
0.0095
7.14×10−5
∂tu=−0.5048∂xu2+0.1007∂xxu
r=10% , without FEϕ
0.00
1.0000
3.1928
2.30×10−4
∂tu=−1.5006∂xu4+0.3724∂xxu4
r=10% , without NAS
0.17
2.1914
8.9731
8.63×10−5
∂tu=3.0014∂xu4−3.2493∂xu3+0.5957∂xu2+⋯
KdV
r=25% , FEϕ +NAS
1.00
0.0376
0.0119
6.49×10−5
∂tu=−3.0013∂xu2−1.0376∂xxxu
r=25% , without FEϕ
0.00
1.0000
1.1379
7.55×10−3
∂t=0.3366u2−0.4742∂xu+1.5952∂xxu2−0.2539∂xxu
r=25% , without NAS
0.33
0.7369
0.7598
2.90×10−3
∂t=−0.7894∂xu2−0.6544∂xxxu+⋯
Appendix
Table 14: Detailed results of ablation studies.
σNR
Ndata
TPR
E∞
E2
L(U^,U)
Discovered Equation
Burgers Equation
25%
4000
1.00
0.0098
0.0097
2.67×10−4
∂tu=−0.4950∂xu2+0.0999∂xxu
50%
4000
1.00
0.0593
0.0117
7.58×10−4
∂tu=−0.4992∂xu2+0.0941∂xxu
75%
4000
1.00
0.1746
0.0343
2.35×10−3
∂tu=−0.5010∂xu2+0.1175∂xxu
100%
4000
1.00
0.1931
0.0552
4.24×10−3
∂tu=−0.5011∂xu2+0.1021∂xxu
KdV Equation
Appendix
Table 15: Detailed results of our method in comparison experiments.
School of Software Engineering, Chengdu University of Information Technology, Chengdu, 610225, China · School of Statistics, Chengdu University of Information Technology, Chengdu, 610103, China · College of Applied Mathematics, Chengdu University of Information Technology, Chengdu, 610225, China +1
College of Computer Science and Technology, Jilin University, Changchun, China · School of Big Data and Artificial Intelligence, Guangdong University of Finance and Economics, Guangzhou, China · Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, China +2
May 12, 2026·Gnankan Landry Regis N'guessan, Bum Jun KimPDE Discovery
1Axiom Research Group · Department of Applied Mathematics and Computational Science, NM-AIST, Tanzania · 3African Institute for Mathematical Sciences (AIMS), Research and Innovation Centre, Rwanda +1