mlsanityData to 7 Oct 2026

WeakIdent: Weak formulation for Identifying Differential Equations using Narrow-fit and Trimming

arXiv 2211.03134 ↗First posted 6 Nov 2022math.NA cs.LG cs.NAcited by 18

Not on the map. Why?

Abstract (arXiv)

Data-driven identification of differential equations is an interesting but challenging problem, especially when the given data are corrupted by noise. When the governing differential equation is a linear combination of various differential terms, the identification problem can be formulated as solving a linear system, with the feature matrix consisting of linear and nonlinear terms multiplied by a coefficient vector. This product is equal to the time derivative term, and thus generates dynamical behaviors. The goal is to identify the correct terms that form the equation to capture the dynamics of the given data. We propose a general and robust framework to recover differential equations using a weak formulation, for both ordinary and partial differential equations (ODEs and PDEs). The weak formulation facilitates an efficient and robust way to handle noise. For a robust recovery against noise and the choice of hyper-parameters, we introduce two new mechanisms, narrow-fit and trimming, for the coefficient support and value recovery, respectively. For each sparsity level, Subspace Pursuit is utilized to find an initial set of support from the large dictionary. Then, we focus on highly dynamic regions (rows of the feature matrix), and error normalize the feature matrix in the narrow-fit step. The support is further updated via trimming of the terms that contribute the least. Finally, the support set of features with the smallest Cross-Validation error is chosen as the result. A comprehensive set of numerical experiments are presented for both systems of ODEs and PDEs with various noise levels. The proposed method gives a robust recovery of the coefficients, and a significant denoising effect which can handle up to 100% noise-to-signal ratio for some equations. We compare the proposed method with several state-of-the-art algorithms for the recovery of differential equations.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). Builds on 12 of its 46 references that are in the map. First posted on arXiv 6 Nov 2022.

Builds on

12 of 46 references.

References · 12

  1. 2017Deep learning for universal linear embeddings of nonlinear dynamicscited by 491
  2. 2017Hidden Physics Models: Machine Learning of Nonlinear Partial Differential Equationscited by 208
  3. 2020Weak SINDy For Partial Differential Equationscited by 154
  4. 2020SINDy-PI: A Robust Algorithm for Parallel Implicit Sparse Identification of Nonlinear Dynamicscited by 125
  5. 2018Data Driven Governing Equations Approximation Using Deep Neural Networkscited by 94
  6. 2018On the Convergence of the SINDy Algorithmcited by 49
  7. 2019Data-Driven Deep Learning of Partial Differential Equations in Modal Spacecited by 46
  8. 2020DLGA-PDE: Discovery of PDEs with incomplete candidate library via combination of deep learning and genetic algorithmcited by 45
  9. 2019DL-PDE: Deep-learning based data-driven discovery of partial differential equations from discrete and noisy datacited by 38
  10. 2021Deep Neural Network Modeling of Unknown Partial Differential Equations in Nodal Spacecited by 25
  11. 2018Numerical Aspects for Approximating Governing Equations Using Datacited by 21
  12. 2020Methods to Recover Unknown Processes in Partial Differential Equations Using Datacited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 4; 2025: 3; 2026: 8.

18 papers.

Sort:

By area:

  1. 2024A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modelingcited by 22
  2. 2022Asymptotic consistency of the WSINDy algorithm in the limit of continuum datacited by 14
  3. 2025Generative Discovery of Partial Differential Equations by Learning from Math Handbookscited by 12
  4. 2023Coarse-Graining Hamiltonian Systems Using WSINDycited by 11
  5. 2024The Weak Form Is Stronger Than You Thinkcited by 11
  6. 2023Physics-constrained robust learning of open-form partial differential equations from limited and noisy datacited by 8
  7. 2024Weak-Form Inference for Hybrid Dynamical Systems in Ecologycited by 7
  8. 2025Beyond empirical models: Discovering new constitutive laws in solids with graph-based equation discoverycited by 2
  9. 2024Group Projected Subspace Pursuit for Block Sparse Signal Reconstruction: Convergence Analysis and Applicationscited by 1
  10. 2025Robust Moment Identification for Nonlinear PDEs via a Neural ODE Approachcited by 1
  11. 2026Joint discovery of governing partial differential equations from multi-source datasets by competitive optimizationcited by 1
  12. 2026Bias Inheritance in Neural-Symbolic Discovery of Constitutive Closures Under Function-Class Mismatchcited by 0
6 more
  1. 2026WGFINNs: Weak formulation-based GENERIC formalism informed neural networkscited by 0
  2. 2026EqOD: Symmetry-Informed Stability Selection for PDE Identificationcited by 0
  3. 2026Data Enrichment for Symbolic Regression Using Diffusion Modelscited by 0
  4. 2026Freeze, Then Select: Structured Field Adapters and Stability-Validated Weak Selection for PDE Discovery from Sparse Observationscited by 0
  5. 2026Robust data-driven discovery of fractional differential equations via weak formulations and Pareto-based subset selectioncited by 0
  6. 2026See, Hypothesize, Validate: Multimodal Agentic Framework for Discovering Governing PDEscited by 0