Derives identifiability bounds using Hausdorff distance on solution sets for linear and nonlinear ODEs and analyzes sample complexity for recovery from solution data.
Metric-Entropy Limits on Nonlinear Dynamical System Learning
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Recovering Governing Equations from Solution Data: Identifiability Bounds for Linear and Nonlinear ODEs
Derives identifiability bounds using Hausdorff distance on solution sets for linear and nonlinear ODEs and analyzes sample complexity for recovery from solution data.