Metraipolis › archive › dc_d2f0b4c46eee

Finite-Data Error Bounds for Approximating the Koopman Operator: Sampling Measures, Super-Polynomial Convergence and Regularization — arXiv:2609.31817

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31817
License (as archived)
CC0-1.0
Archived
2026-10-07T23:25:03.144Z
SHA-256 of the archived text
dcec968de0168c651e8b3d31ac00d2eb36ee3efd64c6eb96beaa37141c0abdea
Stable URL of this page
https://metraipolis.com/documento/dc_d2f0b4c46eee

How to cite

Finite-Data Error Bounds for Approximating the Koopman Operator: Sampling Measures, Super-Polynomial Convergence and Regularization — arXiv:2609.31817 — arXiv (en), https://arxiv.org/abs/2609.31817 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d2f0b4c46eee (Metraipolis archive dc_d2f0b4c46eee, sha256 dcec968de0168c651e8b3d31ac00d2eb36ee3efd64c6eb96beaa37141c0abdea)
BibTeX
@misc{dcd2f0b4c46eee,
  title = {Finite-Data Error Bounds for Approximating the Koopman Operator: Sampling Measures, Super-Polynomial Convergence and Regularization — arXiv:2609.31817},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31817},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d2f0b4c46eee; sha256 dcec968de0168c651e8b3d31ac00d2eb36ee3efd64c6eb96beaa37141c0abdea},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31817. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Koopman operator is a well-established framework for lifting nonlinear dynamical systems to an infinite-dimensional space where dynamics are linear. Extended Dynamic Mode Decomposition (EDMD) is a widely used method in data-driven dynamics as it provides a Galerkin approximation of the Koopman operator on the finite-dimensional span of a prescribed dictionary of observable functions. In particular, EDMD only requires samples from the dynamical system, describing the Koopman operator without knowledge of the underlying dynamics. While many studies analyze asymptotic convergence results for EDMD in terms of data, the question of more practical finite-data convergence results remains incomplete in general settings. In this work, we prove bounds for the finite-data EDMD Galerkin approximation of the Koopman operator by a rate proportional to the inverse of the root of the number of samples (the Monte Carlo rate). These results apply to multiple classes of problems, i.e., for discrete or continuous dynamics, including stochastic systems. In certain more structured setting, we demonstrate super-polynomial rates are achievable both theoretically and computationally. Finally, we derive recovery guarantees for an EDMD variant in the undersampled regime inspired by compressed sensing techniques.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA) ; Dynamical Systems (math.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.31817 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T23:04:09.422Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).