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.
arXiv:2607. 01819v1 Announce Type: cross Abstract: The Koopman operator has gained considerable attention due to its ability to provide a global linear representation of highly complex dynamical systems.
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.
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.
arXiv:2608. 11831v1 Announce Type: new Abstract: Learning mappings between infinite-dimensional objects is a central challenge in scientific machine learning.
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.
arXiv:2504.18184v5 Announce Type: replace Abstract: We consider a class of statistical inverse problems involving the estimation of a regression operator from a Polish space to a separable Hilbert sp...
arXiv:2403.12187v2 Announce Type: replace-cross Abstract: Motivated by the abundance of functional data, such as time series and images, we study the approximation and statistical learning of nonline...
The paper introduces a structured method for learning linear operators in control systems using data. It leverages the framework of (semi)groups for evolution equations to establish structural assumptions and applies inverse‑problems theory to analyze learning algorithms, revealing error decompositions, convergence guarantees, and optimal regularization. Focusing on bounded operators on Hilbert spaces, the authors derive a convergent estimator for time‑varying systems, illustrating the practical power of their approach.
arXiv:2608. 04471v1 Announce Type: cross Abstract: Time series in real-world applications are often generated by nonlinear dynamical systems, making accurate forecasting challenging.
The paper presents a finite‑sample learning‑to‑control framework for geometrically supervised latent models of nonlinear deterministic systems. It introduces an encoder‑only local–global metric hinge that ensures directional resolution and state discrimination, and proves that any approximate empirical minimizer is pointwise co‑Lipschitz and uniformly approximately semiconjugate to the true dynamics under regularity assumptions. The results provide explicit bounds on approximation, sampling, and optimization errors, and demonstrate through controlled experiments that restoring metric resolution improves control performance.
arXiv:2605. 01835v2 Announce Type: replace Abstract: Nonlinear coupled systems are ubiquitous in science and engineering.
arXiv:2606. 04930v1 Announce Type: cross Abstract: Real-time data analysis requires the ability to accurately and adaptively address nonlinear dynamics in a nonstationary data stream while preserving computational efficiency.