Toeplitz Based Spectral Methods for Data-driven Dynamical Systems

• URL: http://arxiv.org/abs/2602.09791v1
• Date: Tue, 10 Feb 2026 13:53:21 GMT
• Title: Toeplitz Based Spectral Methods for Data-driven Dynamical Systems
• Authors: Vladimir R. Kostic, Karim Lounici, Massimiliano Pontil,
• Abstract summary: We introduce a Toeplitz-based framework for data-driven spectral estimation of linear evolution operators in dynamical systems.<n>Our method applies Toeplitz filters to the infinitesimal generator to extract eigenvalues, eigenfunctions, and spectral measures.
• Score: 27.882467972636316
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a Toeplitz-based framework for data-driven spectral estimation of linear evolution operators in dynamical systems. Focusing on transfer and Koopman operators from equilibrium trajectories without access to the underlying equations of motion, our method applies Toeplitz filters to the infinitesimal generator to extract eigenvalues, eigenfunctions, and spectral measures. Structural prior knowledge, such as self-adjointness or skew-symmetry, can be incorporated by design. The approach is statistically consistent and computationally efficient, leveraging both primal and dual algorithms commonly used in statistical learning. Numerical experiments on deterministic and chaotic systems demonstrate that the framework can recover spectral properties beyond the reach of standard data-driven methods.

Related papers

• KoopGen: Koopman Generator Networks for Representing and Predicting Dynamical Systems with Continuous Spectra [65.11254608352982]
  We introduce a generator-based neural Koopman framework that models dynamics through a structured, state-dependent representation of Koopman generators.<n>By exploiting the intrinsic Cartesian decomposition into skew-adjoint and self-adjoint components, KoopGen separates conservative transport from irreversible dissipation.
  arXiv  Detail & Related papers  (2026-02-15T06:32:23Z)
• Profiling systematic uncertainties in Simulation-Based Inference with Factorizable Normalizing Flows [0.0]
  We propose a general framework for Simulation-Based Inference that efficiently profiles nuisance parameters.<n>We introduce Factorizable Normalizing Flows to model systematic variations as a parametrics of a nominal density.<n>We develop an amortized training strategy that learns the conditional dependence of the DoI on nuisance parameters in a single optimization process.<n>This allows for the simultaneous extraction of the underlying distribution and the robust profiling of nuisances.
  arXiv  Detail & Related papers  (2026-02-13T18:48:12Z)
• Disordered Dynamics in High Dimensions: Connections to Random Matrices and Machine Learning [52.26396748560348]
  We provide an overview of high dimensional dynamical systems driven by random matrices.<n>We focus on applications to simple models of learning and generalization in machine learning theory.
  arXiv  Detail & Related papers  (2026-01-03T00:12:32Z)
• A Spectral-Grassmann Wasserstein metric for operator representations of dynamical systems [13.799022330476236]
  We propose a novel approach representing each system as a distribution of its joint operator eigenvalues and spectral projectors.<n> Experiments on simulated and real-world datasets show that our approach consistently outperforms standard operator-based distances in machine learning applications.
  arXiv  Detail & Related papers  (2025-09-29T15:24:05Z)
• Efficient Parametric SVD of Koopman Operator for Stochastic Dynamical Systems [51.54065545849027]
  The Koopman operator provides a principled framework for analyzing nonlinear dynamical systems.<n>VAMPnet and DPNet have been proposed to learn the leading singular subspaces of the Koopman operator.<n>We propose a scalable and conceptually simple method for learning the top-$k$ singular functions of the Koopman operator.
  arXiv  Detail & Related papers  (2025-07-09T18:55:48Z)
• Machine Learning-Enhanced Characterisation of Structured Spectral Densities: Leveraging the Reaction Coordinate Mapping [41.94295877935867]
  Spectral densities encode essential information about system-environment interactions in open-quantum systems.<n>We leverage machine learning techniques to reconstruct key environmental features using the reaction coordinate mapping.<n>For a dissipative spin-boson model with a structured spectral density expressed as a sum of Lorentzian peaks, we demonstrate that the time evolution of a system observable can be used by a neural network to classify the spectral density as comprising one, two, or three Lorentzian peaks.
  arXiv  Detail & Related papers  (2025-01-13T17:02:04Z)
• Learning Controlled Stochastic Differential Equations [61.82896036131116]
  This work proposes a novel method for estimating both drift and diffusion coefficients of continuous, multidimensional, nonlinear controlled differential equations with non-uniform diffusion. We provide strong theoretical guarantees, including finite-sample bounds for (L2), (Linfty), and risk metrics, with learning rates adaptive to coefficients' regularity. Our method is available as an open-source Python library.
  arXiv  Detail & Related papers  (2024-11-04T11:09:58Z)
• Capturing dynamical correlations using implicit neural representations [85.66456606776552]
  We develop an artificial intelligence framework which combines a neural network trained to mimic simulated data from a model Hamiltonian with automatic differentiation to recover unknown parameters from experimental data. In doing so, we illustrate the ability to build and train a differentiable model only once, which then can be applied in real-time to multi-dimensional scattering data.
  arXiv  Detail & Related papers  (2023-04-08T07:55:36Z)
• Spectral learning of Bernoulli linear dynamical systems models [21.3534487101893]
  We develop a learning method for fast, efficient fitting of latent linear dynamical system models. Our approach extends traditional subspace identification methods to the Bernoulli setting. We show that the estimator provides real world settings by analyzing data from mice performing a sensory decision-making task.
  arXiv  Detail & Related papers  (2023-03-03T16:29:12Z)
• Spectral Decomposition Representation for Reinforcement Learning [100.0424588013549]
  We propose an alternative spectral method, Spectral Decomposition Representation (SPEDER), that extracts a state-action abstraction from the dynamics without inducing spurious dependence on the data collection policy. A theoretical analysis establishes the sample efficiency of the proposed algorithm in both the online and offline settings. An experimental investigation demonstrates superior performance over current state-of-the-art algorithms across several benchmarks.
  arXiv  Detail & Related papers  (2022-08-19T19:01:30Z)
• Spectral Methods for Data Science: A Statistical Perspective [37.2486912080998]
  Spectral methods have emerged as a simple yet surprisingly effective approach for extracting information from massive, noisy and incomplete data. This book aims to present a systematic, comprehensive, yet accessible introduction to spectral methods from a modern statistical perspective.
  arXiv  Detail & Related papers  (2020-12-15T18:40:56Z)
• Neural Dynamic Mode Decomposition for End-to-End Modeling of Nonlinear Dynamics [49.41640137945938]
  We propose a neural dynamic mode decomposition for estimating a lift function based on neural networks. With our proposed method, the forecast error is backpropagated through the neural networks and the spectral decomposition. Our experiments demonstrate the effectiveness of our proposed method in terms of eigenvalue estimation and forecast performance.
  arXiv  Detail & Related papers  (2020-12-11T08:34:26Z)
• Data Assimilation Networks [1.5545257664210517]
  Data assimilation aims at forecasting the state of a dynamical system by combining a mathematical representation of the system with noisy observations. We propose a fully data driven deep learning architecture generalizing recurrent Elman networks and data assimilation algorithms. Our architecture achieves comparable performance to EnKF on both the analysis and the propagation of probability density functions of the system state at a given time without using any explicit regularization technique.
  arXiv  Detail & Related papers  (2020-10-19T17:35:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.