Pith. sign in

REVIEW 2 cited by

A Robust SINDy Approach by Combining Neural Networks and an Integral Form

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.07193 v1 pith:WLW6UWDI submitted 2023-09-13 math.DS cs.LG

classification math.DScs.LG
keywords datasindymethodologynetworksequationsgoverningimplicitneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The discovery of governing equations from data has been an active field of research for decades. One widely used methodology for this purpose is sparse regression for nonlinear dynamics, known as SINDy. Despite several attempts, noisy and scarce data still pose a severe challenge to the success of the SINDy approach. In this work, we discuss a robust method to discover nonlinear governing equations from noisy and scarce data. To do this, we make use of neural networks to learn an implicit representation based on measurement data so that not only it produces the output in the vicinity of the measurements but also the time-evolution of output can be described by a dynamical system. Additionally, we learn such a dynamic system in the spirit of the SINDy framework. Leveraging the implicit representation using neural networks, we obtain the derivative information -- required for SINDy -- using an automatic differentiation tool. To enhance the robustness of our methodology, we further incorporate an integral condition on the output of the implicit networks. Furthermore, we extend our methodology to handle data collected from multiple initial conditions. We demonstrate the efficiency of the proposed methodology to discover governing equations under noisy and scarce data regimes by means of several examples and compare its performance with existing methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On the post-hoc Evaluation of PDE Discovery: A Multifaceted Challenge of Scientific Advancement

    cs.LG 2026-07 accept novelty 5.5 of 10

    The first broad taxonomy of post-hoc PDE-discovery metrics shows single scores mislead, and recommends multi-criteria evaluation with OOD and physics checks.

  2. Sparse Discovery of Functional Relationships in Solutions to Systems of Differential Equations

    math.OC 2025-07 reject novelty 2.0 of 10

    The proposed 'sparse discovery' algorithm reduces to a nullspace calculation on a library matrix, with no sparsity enforcement and no validation of the discovered relations.

Pith tools