Deep Embedded Multiplicative DMD for Algebra-Preserving Koopman Learning

Hugging Face Daily Papers Papers

Summary

DeepMDMD combines deep learning with algebraic constraints to learn compact, dynamically coherent Koopman operator representations that enforce the product rule as an exact constraint. The method outperforms geometric approaches on high-dimensional chaotic and fluid dynamics problems, reducing spectral pollution and enabling stable long-term forecasting.

Koopman theory turns nonlinear dynamics into a linear spectral problem. In computation, however, everything depends on a hard finite-dimensional choice: the observables must be expressive, nearly invariant under the dynamics, and, ideally, compatible with composition. Deep Koopman methods learn flexible coordinates, whereas structure-preserving methods enforce operator identities on fixed dictionaries. We combine these ideas by introducing Deep Embedded Multiplicative Dynamic Mode Decomposition (DeepMDMD), a method that learns a latent space and a partition of it, while enforcing the Koopman product rule as an exact algebraic constraint. Training alternates between an exact multiplicative operator update and a differentiable latent-clustering step that promotes Koopman closure. The result is a finite transition map on learned latent cells. Its nonzero spectrum lies on the unit circle, its dictionary is shaped by the dynamics rather than by ambient geometry, and forecasts are made in latent coordinates before being decoded to physical space. Across Hamiltonian, chaotic, and fluid examples, DeepMDMD learns dictionaries that are far more compact and dynamically coherent than those produced by geometric MDMD partitions. It reduces spectral pollution, reveals richer continuous-spectrum structure, and gives stable forecasts under severe noise. In high-dimensional flows, including a 158,624-dimensional cylinder wake and a noisy Re=20,000 lid-driven cavity, it preserves coherent structures and long-time spectral statistics where state-space MDMD fails. These results suggest a practical rule for Koopman learning: learn the coordinates, constrain the algebra.
Original Article

Similar Articles

Cluster-Weighted EDMD

arXiv cs.LG

Introduces Cluster-Weighted EDMD, a data-driven method that jointly learns a partition and per-cluster Koopman operators via expectation-maximization, improving prediction accuracy over standard EDMD on classical dynamical systems.

Learnable composition for neural operators

arXiv cs.LG

This paper introduces LatentDDM, a method that pretrains neural operators on small subdomains and composes them to improve accuracy and reduce adaptation cost for physical simulations in varying domains.