Learning dynamical systems from data: Gradient-based dictionary optimization

Mohammad Tabish, Neil K. Chada, Stefan Klus
11/7/2024
math.DScs.LGstat.ML

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{tabish2024learning,
  title  = {Learning dynamical systems from data: Gradient-based dictionary optimization},
  author = {Mohammad Tabish and Neil K. Chada and Stefan Klus},
  year   = {2024},
  eprint = {2411.04775},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.04775v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.04775.svg)](https://codeofpaper.com/paper/2411.04775)

Discussion