cs.LGOct 8, 2026

Bilevel optimization for data-driven learning of Koopman embeddings using kernel-based autoencoders

Authors: Joel-Pascal Ntwali N'konzi, Feliks Nüske, Stefan Klus

Organizations: Maxwell Institute for Mathematical Sciences, The University of Edinburgh & Heriot–Watt University, Edinburgh, United Kingdom · Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany · LAAS-CNRS, Université de Toulouse, Toulouse, France · School of Mathematical & Computer Sciences, Heriot–Watt University, Edinburgh, United Kingdom

Abstract

Koopman operator theory provides a linear framework for analyzing nonlinear dynamical systems and has become a major tool for data-driven modeling. A central challenge, however, is that finite-dimensional approximations computed by methods such as extended dynamic mode decomposition (EDMD) require the dictionary to be specified a priori. Recent machine-learning approaches address this limitation by learning the dictionary from data, predominantly using artificial neural network (ANN) autoencoder architectures. Although kernel methods offer an alternative with greater interpretability and tractability for theoretical analysis, they have received little attention in this setting. We introduce extended dynamic mode decomposition with kernel-based dictionary learning (EDMD-kDL), a kernel-based method for learning finite-dimensional Koopman embeddings directly from data. The method combines ideas from collocation methods and bilevel optimization to simultaneously learn a kernel dictionary and the corresponding Koopman approximation. We evaluate EDMD-kDL against state-of-the-art ANN-based approaches on a range of numerical experiments, including global sea-surface-temperature forecasting and learning directly from video data. Across all tested settings, EDMD-kDL achieves performance comparable to or better than the ANN-based methods. Moreover, in contrast to standard kernel methods, the proposed approach is scalable to large datasets by design since the size of the required kernel matrices depends on the number of collocation points rather than the size of the training dataset.

Figures & tables

Explore similar work

CardsList
  1. Dictionary learning for Kernel EDMD

    Apr 28, 2026Erik Lien Bolager, Boumediene Hamzi, Houman Owhadi +2Koopman Operator LearningNonlinear System Identification

  2. Deep Embedded Multiplicative DMD for Algebra-Preserving Koopman Learning

    Jun 3, 2026Kelan Gray, Finlay Brown, Nicolas Boullé +1Koopman Operator LearningLatent Dynamics Modeling

  3. Residual-Guided Dictionary Learning for Spectrally Accurate Koopman Approximation

    Jun 27, 2026George Coote, Matthew J. ColbrookSpectral RegularizationKoopman Operator Learning