Exact Recovery of Chaotic Systems from Highly Corrupted Data
Giang Tran, Rachel Ward

TL;DR
This paper demonstrates that for chaotic dynamical systems, the governing equations can be exactly recovered from highly corrupted data using an $ ext{l}_1$ minimization approach, leveraging ergodic properties.
Contribution
It introduces a theoretical framework showing exact recovery of polynomial dynamical systems from corrupted data under ergodic conditions, with a practical algorithm for implementation.
Findings
Exact recovery is possible for chaotic systems with ergodic data.
The proposed method effectively handles high levels of data corruption.
Numerical experiments confirm the approach's accuracy and efficiency.
Abstract
Learning the governing equations in dynamical systems from time-varying measurements is of great interest across different scientific fields. This task becomes prohibitive when such data is moreover highly corrupted, for example, due to the recording mechanism failing over unknown intervals of time. When the underlying system exhibits chaotic behavior, such as sensitivity to initial conditions, it is crucial to recover the governing equations with high precision. In this work, we consider continuous time dynamical systems where each component of is a multivariate polynomial of maximal degree ; we aim to identify exactly from possibly highly corrupted measurements . As our main theoretical result, we show that if the system is sufficiently ergodic that this data satisfies a strong central…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
