Pith. sign in

REVIEW 2 cited by

Learning Discrepancy Models From Experimental Data

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 1909.08574 v1 pith:KYGIPYDL submitted 2019-09-18 cs.LG cs.SYeess.SYstat.ML

classification cs.LGcs.SYeess.SYstat.ML
keywords modelsystemsdatadiscrepancynonlineardiscrepanciesexperimentalmodeling
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

First principles modeling of physical systems has led to significant technological advances across all branches of science. For nonlinear systems, however, small modeling errors can lead to significant deviations from the true, measured behavior. Even in mechanical systems, where the equations are assumed to be well-known, there are often model discrepancies corresponding to nonlinear friction, wind resistance, etc. Discovering models for these discrepancies remains an open challenge for many complex systems. In this work, we use the sparse identification of nonlinear dynamics (SINDy) algorithm to discover a model for the discrepancy between a simplified model and measurement data. In particular, we assume that the model mismatch can be sparsely represented in a library of candidate model terms. We demonstrate the efficacy of our approach on several examples including experimental data from a double pendulum on a cart. We further design and implement a feed-forward controller in simulations, showing improvement with a discrepancy model.

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. A Weak Penalty Neural ODE for Learning Chaotic Dynamics from Noisy Time Series

    cs.LG 2025-11 unverdicted novelty 6.0 of 10

    The Weak Penalty Neural ODE uses a weak form loss to filter noise and learn stable chaotic dynamics from noisy observations.

  2. Wasserstein Geometry of Information Loss in Nonlinear Dynamical Systems

    stat.CO 2026-01 conditional novelty 5.0 of 10

    Intrinsic stochasticity E*_n—the average minimal Wasserstein-1 distance between the n-step future kernel and its closest Dirac—is introduced as a data-driven certificate of how much a time-delay reconstruction loses d...

Pith tools