Nonparametric Sparse Online Learning of the Koopman Operator

Boya Hou, Sina Sanjari, Nathan Dahlin, Alec Koppel, Subhonmesh Bose
1/27/2025
stat.MLcs.LGeess.SY

No confident code implementation found for this paper.

Abstract

The Koopman operator provides a powerful framework for representing the dynamics of general nonlinear dynamical systems. Data-driven techniques to learn the Koopman operator typically assume that the chosen function space is closed under system dynamics. In this paper, we study the Koopman operator via its action on the reproducing kernel Hilbert space (RKHS), and explore the mis-specified scenario where the dynamics may escape the chosen function space. We relate the Koopman operator to the conditional mean embeddings (CME) operator and then present an operator stochastic approximation algorithm to learn the Koopman operator iteratively with control over the complexity of the representation. We provide both asymptotic and finite-time last-iterate guarantees of the online sparse learning algorithm with trajectory-based sampling with an analysis that is substantially more involved than that for finite-dimensional stochastic approximation. Numerical examples confirm the effectiveness of the proposed algorithm.

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!

Cite this paper

@article{hou2025nonparametric,
  title  = {Nonparametric Sparse Online Learning of the Koopman Operator},
  author = {Boya Hou and Sina Sanjari and Nathan Dahlin and Alec Koppel and Subhonmesh Bose},
  year   = {2025},
  eprint = {2501.16489},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.16489v2}
}

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/2501.16489.svg)](https://codeofpaper.com/paper/2501.16489)

Discussion