← Back to all news
arXiv Machine Learning By Santosh Mohan Rajkumar, Dibyasri Barman, Kumar Vikram Singh, Debdipta Goswami

On Data-Driven Koopman Representations of Nonlinear Delay Differential Equations

Read the original on arXiv Machine Learning →

arXiv:2604. 03086v2 Announce Type: replace-cross Abstract: This work establishes a rigorous bridge between infinite-dimensional delay dynamics and finite-dimensional Koopman learning, with explicit and interpretable error guarantees.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Aug 28

Data-driven Koopman mode approximation: A neural power iteration algorithm

This paper introduces a data‑driven neural power‑iteration algorithm for approximating the dominant eigenfunctions (modes) of the Koopman operator in nonlinear dynamical systems. By avoiding explicit construction of the operator’s projection, the method sidesteps the curse of dimensionality that plagues expressive neural templates. The authors provide theoretical convergence guarantees tied to sample size and network width, and demonstrate through numerical experiments that the approach yields accurate, smooth mode approximations without the drawbacks of traditional techniques such as extended dynamic mode decomposition.

By Guillaume O. Berger, Rapha\"el M. Jungers
More like this →
arXiv Machine Learning
Jul 7

Nonparametric Control Koopman Operators

arXiv:2405. 07312v5 Announce Type: replace-cross Abstract: This paper presents a novel Koopman composition operator representation framework for control systems in reproducing kernel Hilbert spaces (RKHSs) that is free of explicit dictionary or input parametrizations.

By Petar Bevanda, Bas Driessen, Lucian Cristian Iacob, Stefan Sosnowski, Roland T\'oth, Sandra Hirche
More like this →
arXiv AI
Sep 17

Principled Koopman Representations with Kalman Inference for Efficient Time-Series Prediction

The paper introduces K$^2$SVD, a method that learns the leading singular functions of the Koopman operator by optimizing a Hilbert-Schmidt objective, producing a low‑rank, interpretable Koopman representation with a compact latent space. In this space, temporal evolution is modeled with a linear Gaussian state‑space model and inference is performed via Kalman filtering to reduce noise accumulation in multi‑step predictions. Experiments demonstrate that K$^2$SVD outperforms state‑of‑the‑art methods on multiple datasets, achieving faster prediction speeds and lower computational cost.

By Ruiquan Li, Yuheng Bu
diffusionbenchmarks
More like this →