Learning dynamical systems from data: Gradient-based dictionary optimization
arXiv:2411.04775 · doi:10.1016/j.physd.2025.134822
Abstract
The Koopman operator plays a crucial role in analyzing the global behavior of dynamical systems. Existing data-driven methods for approximating the Koopman operator or discovering the governing equations of the underlying system typically require a fixed set of basis functions, also called dictionary. The optimal choice of basis functions is highly problem-dependent and often requires domain knowledge. We present a novel gradient descent-based optimization framework for learning suitable and interpretable basis functions from data and show how it can be used in combination with EDMD, SINDy, and PDE-FIND. We illustrate the efficacy of the proposed approach with the aid of various benchmark problems such as the Ornstein-Uhlenbeck process, Chua's circuit, a nonlinear heat equation, as well as protein-folding data.
References in corpus (12)
- Adam: A Method for Stochastic Optimization
- Discovering governing equations from data: Sparse identification of nonlinear dynamical systems
- A Data-Driven Approximation of the Koopman Operator: Extending Dynamic Mode Decomposition
- VAMPnets: Deep learning of molecular kinetics
- Extended dynamic mode decomposition with dictionary learning: a data-driven adaptive spectral decomposition of the Koopman operator
- Data-driven approximation of the Koopman generator: Model reduction, system identification, and control
- Sparse learning of stochastic dynamic equations
- Eigendecompositions of Transfer Operators in Reproducing Kernel Hilbert Spaces
- A Simple Convergence Proof of Adam and Adagrad
- Two methods to approximate the Koopman operator with a reservoir computer
- Gradient Descent, Stochastic Optimization, and Other Tales
- Dynamical systems and complex networks: A Koopman operator perspective