Extended Dynamic Mode Decomposition (EDMD) approximates Koopman operators from data, but a single global operator is inefficient when different state-space regions exhibit distinct local dynamics. We introduce Cluster-Weighted EDMD (CW-EDMD), which jointly learns a soft phase-space partition and a per-cluster EDMD operator.
The paper introduces Functional Dynamic Mode Decomposition (fDMD), extending traditional DMD to infinite-dimensional systems by learning finite-rank operators from functional data such as observables, densities, or wavefunctions. It demonstrates that conventional DMD algorithms are special cases of fDMD and illustrates the approach with examples involving Koopman, Perron‑Frobenius, and Koopman‑von Neumann operators for graphons, ODEs, and SDEs.
By Stefan Klus, Eirini Ioannou
arXiv:2607. 28080v1 Announce Type: cross Abstract: We extend a recently introduced Entropy-Optimal Manifold Clustering (EOMC) to allow for a joint simultaneous identification of subsets and subspaces of relevant features in nonstationary and nonlinear regression problems.
By Illia Horenko
arXiv:2605. 01835v2 Announce Type: replace Abstract: Nonlinear coupled systems are ubiquitous in science and engineering.
By Tatsuya Naoi, Jun Ohkubo
arXiv:2608. 22277v2 Announce Type: replace Abstract: Deep learning surrogates for forecasting chaotic dynamical systems suffer from catastrophic error accumulation over long-term autoregressive rollouts.
By Zhou Fang, Gianmarco Mengaldo
The paper introduces K$^2$SVD, a method that learns the leading singular functions of the Koopman operator by optimizing a Hilbert-Schmidt objective, producing a low‑rank, interpretable Koopman representation with a compact latent space. In this space, temporal evolution is modeled with a linear Gaussian state‑space model and inference is performed via Kalman filtering to reduce noise accumulation in multi‑step predictions. Experiments demonstrate that K$^2$SVD outperforms state‑of‑the‑art methods on multiple datasets, achieving faster prediction speeds and lower computational cost.
By Ruiquan Li, Yuheng Bu