Linearly-scalable and entropy-optimal learning of nonstationary and nonlinear manifolds
Illia Horenko

TL;DR
The paper introduces EOMC, a scalable and entropy-optimal manifold clustering method that improves data compression and predictive modeling in complex dynamical systems like fluid mechanics and geosciences.
Contribution
It presents a novel entropy-optimal manifold clustering algorithm with linear complexity, enhancing robustness and efficiency in nonstationary, nonlinear data analysis.
Findings
EOMC effectively captures metastable regime-switching dynamics in chaotic systems.
It achieves significantly lower compression loss compared to PCA-based methods.
Prediction horizons are extended despite chaotic behavior, with slow decrease in mean exit and relaxation times.
Abstract
We propose an Entropy-Optimal Manifold Clustering (EOMC) - and show that it mitigates the cost scaling and robustness issues of the existing dimensionality reduction and manifold learning tools in nonstationary and nonlinear situations, while pertaining the favourable O(T) iteration complexity scaling in the statistics size T, and allowing explicit computation of input data reliability. Application to the Lorenz-96 dynamical system in chaotic regime, as well as to a modified Hasegawa-Wakatani (mHW) model of drift-wave turbulence in the edge of a tokamak plasma reveals that for both of the models their essential dynamics is best described as a metastable regime-switching process, making infrequent transitions between the very persistent low-dimensional manifolds. At the same time, the Markovian mean exit times and relaxation times (that bound the predictability horizons for the…
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.
