Kolmogorov-Sinai entropies identify optimal observables for prediction and dynamics reconstruction in chaotic systems
Maximilian Topel

TL;DR
This paper establishes that Kolmogorov-Sinai entropy effectively predicts the quality of reconstructing chaotic system dynamics from observables, providing a rigorous criterion for optimal observable selection.
Contribution
It proves a theoretical link between Kolmogorov-Sinai entropy and reconstruction error, and empirically validates this on various chaotic systems, enhancing data-driven modeling.
Findings
Kolmogorov-Sinai entropy correlates strongly with reconstruction error.
Theoretical bounds relate Lyapunov exponents and entropy to prediction accuracy.
Empirical validation shows high correlation between entropy estimates and reconstruction quality.
Abstract
Choosing the optimal observable to model dynamical systems for which we do not know the driving equations is nearly always an ad hoc art. Takens' Delay Embedding Theorem guarantees a diffeomorphism between delay-coordinate vectors built from generic scalar observables and the underlying invariant attractor, but is agnostic to optimal observable choice, and formal bounds on reconstruction quality across observables are not known. Here we prove that, under modest technical conditions, the Kolmogorov-Sinai entropy of an observable predicts its reconstruction error of the underlying dynamics in chaotic, ergodic systems. Using the Oseledets Multiplicative Ergodic Theorem, we show that the tangent bundles of reconstructed manifolds admit an invariant Oseledets filtration diffeomorphically related across admissible observables, with Lyapunov exponents controlling the propagation of…
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.
