cs.LGOct 29, 2026

Data-driven Random-feature Approximation of Koopman Generators of Nonlinear Continuous-time Systems

Authors: Ana Čukarska, Maximilian Gollwitzer, Viola Muning Li, Vladyslav Fediukov, Zahra Monfared, Felix Dietrich

Organizations: School of Computation, Information and Technology, Technical University of Munich, Germany · Munich Data Science Institute · Interdisciplinary Center for Scientific Computing (IWR) · Department of Mathematics and Computer Science, Heidelberg University, Germany

Read PDF
Ask AI
Cite

Copy citation

DOINot available for this paper

Abstract

Learning continuous-time dynamical systems from data is an active area of research. The Koopman formalism is often used here, because it is a flexible approach that is informative about the system's fundamental properties. The formalism represents dynamical systems through linear operators acting on a suitable function space. A practical difficulty arising in the numerical approximation of Koopman operators is the choice of a ``dictionary'', meaning an effective finite-dimensional representation of the function space. In this paper, we focus on learning dynamical systems in continuous-time, and so we consider numerical approximations of the Koopman generator instead of the Koopman operator. Our main contribution is a data-driven random-feature method to obtain a parsimonious and effective function representation for Galerkin approximation methods such as gEDMD. The representation we construct is data-informed, which allows us to improve upon data-agnostic methods. We empirically demonstrate the suitability of our method for forecasting tasks and system analysis. The numerical experiments show that our approach is accurate, and faster than iterative optimization. Further, we prove convergence of our approximation of the vector field and the resulting trajectories. In addition to the numerical results, we also make theoretical contributions, including a general convergence criterion for the semigroup generated by the gEDMD approximation and a counterexample showing that gEDMD does not generally preserve exponential boundedness. With our contribution, we advance the frontier of efficiently learning continuous-time dynamics from data, towards interpretable and mathematically robust modelling based on the Koopman framework.

More in this topic

Koopman Operator Learning

Koopman operator learning builds finite-dimensional linear models of nonlinear dynamics by finding useful observable representations from data.

See all 82 papers

Explore similar work

CardsList
Aug 27, 2026

Data-driven Koopman mode approximation: A neural power iteration algorithm

This paper proposes a novel data-driven algorithm to approximate the dominant eigenfunctions (aka.~modes) of the Koopman operator of nonlinear dynamical systems using neural networks. The relevance of learning the dominant Koopman modes is to approximate nonlinear dynamics by linear ones in a lifted space, thereby enabling simplified control and analysis. To fight the curse of dimensionality arising from using expressive templates (here neural networks) for the mode approximation, the proposed method leverages a power-iteration scheme that directly learns the dominant Koopman modes without explicitly constructing the projection of the Koopman operator on the template of functions. Our approach connects to other approaches in the literature that avoid the curse of dimensionality by learning small dictionaries of functions, but differs from them in that we do not require ``anti-collapse mechanisms'' to ensure that the learned dictionary is expressive enough to approximate the Koopman operator since our power-iteration scheme is designed to converge toward the dominant modes of the projected Koopman operator. The approach is fully data-driven, requiring only sampled state transitions. Theoretical guarantees are provided, showing convergence under increasing sample size and network width (in connection with the neural tangent kernel theorem). Numerical experiments demonstrate that the method achieves accurate and smooth approximations of dominant modes while avoiding the limitations of traditional techniques such as extended dynamic mode decomposition.

Guillaume O. Berger, Raphaël M. Jungers

ICTEAM, UCLouvain, Louvain-la-Neuve, Belgium

Koopman Operator LearningSpectral Methods
AskPDF
Jul 2, 2026

Koopman operator theory: fundamentals, control, and applications

The Koopman operator has gained considerable attention due to its ability to provide a global linear representation of highly complex dynamical systems. The operator describes nonlinear dynamics in a linear way through the lens of real- or complex-valued observable functions. Data-driven techniques, like extended dynamic mode decomposition (EDMD), kernel EDMD, and machine-learning methods, can be used to generate finite-dimensional approximations accompanied by finite-data error bounds. In this tutorial paper, we provide a concise introduction into Koopman operator theory and its use in systems and control. A particular focus is put on data-driven surrogate models, their extension to systems with inputs, and controller design using Koopman operator theory. Moreover, we demonstrate the key techniques, i.e., EDMD and Koopman MPC. To this end, we provide simulation studies including source code on GitHub to enable the interested reader to experience the Koopman operator in systems and control step by step.

Igor Mezić, Jorge Cortés, Karl Worthmann +2

Department of Mechanical Engineering, University of California, Santa Barbara, USA · Department of Mechanical and Aerospace Engineering, University of California, San Diego, USA · Optimization-based Control Group, TU Ilmenau, Germany +2

Surrogate ModelingKoopman Operator LearningLatent Dynamics ModelingExtended Dynamic Mode DecompositionData-Driven Control
AskPDF
Oct 8, 2026

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

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.

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

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 +1

Extended Dynamic Mode DecompositionKoopman Operator LearningLatent Dynamics ModelingKernel Methods
AskPDF