This work uses encoders producing sparse latents in training Sparse Koopman Autoencoders without basin labels or other regime annotations to identify sparse latents and their corresponding supports as label-free, interpretable regime variables for Koopman learning in nonlinear systems with multiple local dynamical laws.
Abstract
Koopman autoencoders (KAEs) seek a higher-dimensional latent representation in which nonlinear dynamics evolve linearly. However, many interesting systems have multiple basins of attraction, and both theoretical and empirical work has shown these multibasin systems cannot generally admit a single finite-dimensional global Koopman embedding under standard assumptions. We posit that encoders with a sparsity-inducing objective encouraging few active latent coefficients will provide latent supports as an inspectable basin-modeling principle for Koopman autoencoders. We use these encoders producing sparse latents in training Sparse Koopman Autoencoders (SKAEs) without basin labels or other regime annotations, and treat the learned latent supports as model-produced regime variables after training. Across a range of procedurally generated multibasin systems and chaotic flows, we show that SKAEs have superior forecasting performance compared to dense-latent KAEs. We also perform a mechanistic study that shows latent supports produced by SKAEs are both essential for the quality of the representation and useful for identifying basins on held-out basin interior states, whereas dense-latent KAEs collapse to an uninformative single family. These results identify sparse latents and their corresponding supports as label-free, interpretable regime variables for Koopman learning in nonlinear systems with multiple local dynamical laws.
Neural Koopman autoencoder models have been shown to successfully build a latent embedding with linear dynamics for arbitrary dynamical systems, enabling strong performance in long-term time series forecasting. However, these models usually work in a deterministic setting, which does not allow the quantification of the...
Anthony Frion, L. Drumetz, G. Tochon et al.· 0 citations
Autoencoders (AEs) have become a dominant approach to nonlinear latent-space construction in data-driven reduced-order modelling (ROM), with their decoders lifting latent representations back to the ambient state space. Their prominence, however, has overshadowed an established alternative: manifold-learning methods gr...
A. Della Pia, Lucia Russo, I. Kevrekidis et al.· 0 citations
Two machine-learned representations are compared, DeepTICA and SPIB-VAE, with linear TICA for recovering steady-state observables from flawed distributions and a kinetic score computed from a coarse MSM at a resolution comparable to that used for RiteWeight random clustering is provided.
It is demonstrated that imposing a linear encoder preserves most of the representational capacity of the autoencoder, provided the decoder remains nonlinear, and suggested that the nonlinear decoder is the critical component for manifold learning, rather than the encoder.
Louen Pottier, Louis Lesueur, Anders Thorin· 1 citation
A Fourier-enhanced operator autoencoder for decoder-free reconstruction and latent learning of dynamical systems and achieves accuracy comparable to or better than classical AE-based reduced-order models while providing a more efficient latent-to-field reconstruction path.
Xuan-Dong Lu, Yong-Ming Liu· Machine Learning for Computa...· 1 citation
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.