A novel data-driven algorithm to approximate the dominant eigenfunctions of the Koopman operator of nonlinear dynamical systems using neural networks using neural networks to fight the curse of dimensionality arising from using expressive templates for the mode approximation.
Abstract
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.
One of the main objectives in control theory is to obtain a linear representation of inherently nonlinear systems in order to leverage the analytical and theoretical tools developed for linear systems. In this context, the Koopman operator has attracted increasing interest in recent years.Koopman operator theory provides a framework in which nonlinear dynamical systems are represented by a linear operator acting on an infinite-dimensional Hilbert space. Since such an infinite-dimensional representation is not numerically tractable, numerous finite-dimensional approximation methods have been proposed. These approaches typically rely on time-series data and include extended dynamic mode decomposition as well as deep learning–based variants. In this paper, we propose an original machine-learning-based approach for the synthesis of a fixed-dimensional Koopman approximant (lifting) of continuous-time nonlinear systems. A differential state-space representation of the system (as opposed to a recurrent state model) is assumed to be available through its vector field (f). The proposed encoder departs from conventional approaches in that it does not directly output the current latent state, but instead generates samples of the latent trajectory evaluated at user-defined time instants (temporal discretization). This formulation enables the integration into the learning process of Physical & Latent Continuous Losses, enforcing consistency between the physical dynamics and the Koopman dynamics, as well as Physical & Latent Boundary Losses, ensuring consistency with the prescribed initial conditions. In parallel, we introduce a structural stability constraint on the Koopman operator. The effectiveness of the proposed methodology is demonstrated through the analysis and simulation of two polynomial dynamical systems.
M. Zodros, A. Colotti, M. Yagoubi et al.· International Conference on...· 0 citations
Fuzzy Spectral Region Decomposition (fSRD), a fully automated learning framework for estimating finite Koopman representation via multiple operators, and a data-adaptive framework for assembling locally invariant embeddings, termed Invariant Decomposition are introduced.
C. Bokor, M. Cary, Denise Morrey et al.· 0 citations
This work proposes the Fourier-enhanced alternating Levenberg--Marquardt PINN (FALM-PINN), an optimization framework that decouples representation learning from coefficient fitting within a single nonconvex optimization objective.
Yulun Wu, Matthieu Barreau, Miguel Aguiar et al.· 0 citations
Spectral submanifolds can be used to reduce recurrent neural networks to low-dimensional models, revealing their core dynamics, and authors uncover robust structures underlying decision-making and working-memory tasks, providing predictions about the underlying behavior of neural computations.
A. Marraffa, R. Krause, V. Mante et al.· Nature Communications· 0 citations
This paper proves that the constant and linear components of the hidden link function are indeed recovered within the predicted timescales, at sharp explicit thresholds, based on quantitative approximation results for singularly perturbed flows evolving near a manifold defined by integral constraints.
Cédric Gerbelot, J. Mourrat· arXiv.org· 0 citations
The Projected Koopman Operator Approximation framework for constructing Filtered EDMD operators is introduced, and under independent noiseless sampling and exact-rank identifiability, the resulting empirical operators converge almost surely to their population counterparts.
Si-Jin Chen, Igor Mezić, Tang Sui· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
