ResKoopNet: Learning Koopman Representations for Complex Dynamics with Spectral Residuals

• URL: http://arxiv.org/abs/2501.00701v4
• Date: Tue, 27 May 2025 14:24:52 GMT
• Title: ResKoopNet: Learning Koopman Representations for Complex Dynamics with Spectral Residuals
• Authors: Yuanchao Xu, Kaidi Shao, Nikos Logothetis, Zhongwei Shen,
• Abstract summary: Methods for approximating spectral components of high-dimensional dynamical systems often face theoretical limitations.<n>We introduce ResKoopNet, which explicitly minimizes the emphspectral residual to compute Koopman eigenpairs.<n>Experiments on a variety of physical and biological systems show that ResKoopNet achieves more accurate spectral approximations than existing methods.
• Score: 1.8570740863168362
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Analyzing the long-term behavior of high-dimensional nonlinear dynamical systems remains a significant challenge. While the Koopman operator framework provides a powerful global linearization tool, current methods for approximating its spectral components often face theoretical limitations and depend on predefined dictionaries. Residual Dynamic Mode Decomposition (ResDMD) advanced the field by introducing the \emph{spectral residual} to assess Koopman operator approximation accuracy; however, its approach of only filtering precomputed spectra prevents the discovery of the operator's complete spectral information, a limitation known as the `spectral inclusion' problem. We introduce ResKoopNet (Residual-based Koopman-learning Network), a novel method that directly addresses this by explicitly minimizing the \emph{spectral residual} to compute Koopman eigenpairs. This enables the identification of a more precise and complete Koopman operator spectrum. Using neural networks, our approach provides theoretical guarantees while maintaining computational adaptability. Experiments on a variety of physical and biological systems show that ResKoopNet achieves more accurate spectral approximations than existing methods, particularly for high-dimensional systems and those with continuous spectra, which demonstrates its effectiveness as a tool for analyzing complex dynamical systems.

Related papers

• SKOLR: Structured Koopman Operator Linear RNN for Time-Series Forecasting [24.672521835707446]
  We establish a connection between Koopman operator approximation and linear Recurrent Neural Networks (RNNs)<n>We present SKOLR, which integrates a learnable spectral decomposition of the input signal with a multilayer perceptron (MLP) as the measurement functions.<n> Numerical experiments on various forecasting benchmarks and dynamical systems show that this streamlined, Koopman-theory-based design delivers exceptional performance.
  arXiv  Detail & Related papers  (2025-06-17T02:11:06Z)
• FourierSpecNet: Neural Collision Operator Approximation Inspired by the Fourier Spectral Method for Solving the Boltzmann Equation [10.910310257111414]
  We propose a hybrid framework that integrates the Fourier spectral method with deep learning to approximate the collision operator in Fourier space efficiently.<n>FourierSpecNet achieves resolution-invariant learning and supports zero-shot super-resolution, enabling accurate predictions at unseen resolutions without retraining.<n>We evaluate our method on several benchmark cases, including Maxwellian and hard-sphere molecular models, as well as inelastic collision scenarios.
  arXiv  Detail & Related papers  (2025-04-29T04:07:03Z)
• Understanding Inverse Reinforcement Learning under Overparameterization: Non-Asymptotic Analysis and Global Optimality [52.906438147288256]
  We show that our algorithm can identify the globally optimal reward and policy under certain neural network structures.<n>This is the first IRL algorithm with a non-asymptotic convergence guarantee that provably achieves global optimality.
  arXiv  Detail & Related papers  (2025-03-22T21:16:08Z)
• Nonparametric Sparse Online Learning of the Koopman Operator [11.710740395697128]
  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. We present an operator approximation algorithm to learn the Koopman operator iteratively with control over the complexity of the representation.
  arXiv  Detail & Related papers  (2025-01-27T20:48:10Z)
• Analytic Continuation by Feature Learning [8.498755880433713]
  Analytic continuation aims to reconstruct real-time spectral functions from imaginary-time Green's functions.<n>We propose a novel neural network architecture, named the Feature Learning Network (FL-net), to enhance the prediction accuracy of spectral functions.
  arXiv  Detail & Related papers  (2024-11-22T05:12:27Z)
• Point-Calibrated Spectral Neural Operators [54.13671100638092]
  We introduce Point-Calibrated Spectral Transform, which learns operator mappings by approximating functions with the point-level adaptive spectral basis. Point-Calibrated Spectral Neural Operators learn operator mappings by approximating functions with the point-level adaptive spectral basis.
  arXiv  Detail & Related papers  (2024-10-15T08:19:39Z)
• Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows [0.0]
  We introduce the framework of multi-observable dynamic mode decomposition (MODMD) We replace typical Hadamard-test circuits with a protocol designed to predict low-rank observables. Our work paves the path for efficient designs of measurement-driven algorithms on near-term and early fault-tolerant quantum devices.
  arXiv  Detail & Related papers  (2024-09-20T17:59:56Z)
• Multiplicative Dynamic Mode Decomposition [4.028503203417233]
  We introduce Multiplicative Dynamic Mode Decomposition (MultDMD), which enforces the multiplicative structure inherent in the Koopman operator within its finite-dimensional approximation. MultDMD presents a structured approach to finite-dimensional approximations and can accurately reflect the spectral properties of the Koopman operator. We elaborate on the theoretical framework of MultDMD, detailing its formulation, optimization strategy, and convergence properties.
  arXiv  Detail & Related papers  (2024-05-08T18:09:16Z)
• Rigged Dynamic Mode Decomposition: Data-Driven Generalized Eigenfunction Decompositions for Koopman Operators [0.0]
  We introduce the Rigged Dynamic Mode Decomposition (Rigged DMD) algorithm, which computes generalized eigenfunction decompositions of Koopman operators. We provide examples, including systems with a Lebesgue spectrum, integrable Hamiltonian systems, the Lorenz system, and a high-Reynolds number lid-driven flow in a two-dimensional square cavity.
  arXiv  Detail & Related papers  (2024-05-01T18:00:18Z)
• Generalization of Scaled Deep ResNets in the Mean-Field Regime [55.77054255101667]
  We investigate emphscaled ResNet in the limit of infinitely deep and wide neural networks. Our results offer new insights into the generalization ability of deep ResNet beyond the lazy training regime.
  arXiv  Detail & Related papers  (2024-03-14T21:48:00Z)
• Stability and Generalization Analysis of Gradient Methods for Shallow Neural Networks [59.142826407441106]
  We study the generalization behavior of shallow neural networks (SNNs) by leveraging the concept of algorithmic stability. We consider gradient descent (GD) and gradient descent (SGD) to train SNNs, for both of which we develop consistent excess bounds.
  arXiv  Detail & Related papers  (2022-09-19T18:48:00Z)
• 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)
• Momentum Diminishes the Effect of Spectral Bias in Physics-Informed Neural Networks [72.09574528342732]
  Physics-informed neural network (PINN) algorithms have shown promising results in solving a wide range of problems involving partial differential equations (PDEs) They often fail to converge to desirable solutions when the target function contains high-frequency features, due to a phenomenon known as spectral bias. In the present work, we exploit neural tangent kernels (NTKs) to investigate the training dynamics of PINNs evolving under gradient descent with momentum (SGDM)
  arXiv  Detail & Related papers  (2022-06-29T19:03:10Z)
• Residual Dynamic Mode Decomposition: Robust and verified Koopmanism [0.0]
  Dynamic Mode Decomposition (DMD) describes complex dynamic processes through a hierarchy of simpler coherent features. We present Residual Dynamic Mode Decomposition (ResDMD), which overcomes challenges through the data-driven computation of residuals associated with the full infinite-dimensional Koopman operator. ResDMD computes spectra and pseudospectra of general Koopman operators with error control, and computes smoothed approximations of spectral measures (including continuous spectra) with explicit high-order convergence theorems.
  arXiv  Detail & Related papers  (2022-05-19T18:02:44Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)
• Rigorous data-driven computation of spectral properties of Koopman operators for dynamical systems [2.0305676256390934]
  This paper describes algorithms with rigorous convergence guarantees for computing spectral information of Koopman operators. We compute smoothed approximations of spectral measures associated with general measure-preserving dynamical systems. We demonstrate our algorithms on the tent map, circle rotations, Gauss iterated map, nonlinear pendulum, double pendulum, and Lorenz system.
  arXiv  Detail & Related papers  (2021-11-29T19:01:26Z)
• Reconstructing spectral functions via automatic differentiation [30.015034534260664]
  Reconstructing spectral functions from Euclidean Green's functions is an important inverse problem in many-body physics. We propose an automatic differentiation(AD) framework as a generic tool for the spectral reconstruction from propagator observable.
  arXiv  Detail & Related papers  (2021-11-29T18:09:49Z)
• 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)
• Provably Efficient Neural Estimation of Structural Equation Model: An Adversarial Approach [144.21892195917758]
  We study estimation in a class of generalized Structural equation models (SEMs) We formulate the linear operator equation as a min-max game, where both players are parameterized by neural networks (NNs), and learn the parameters of these neural networks using a gradient descent. For the first time we provide a tractable estimation procedure for SEMs based on NNs with provable convergence and without the need for sample splitting.
  arXiv  Detail & Related papers  (2020-07-02T17:55:47Z)
• Lipschitz Recurrent Neural Networks [100.72827570987992]
  We show that our Lipschitz recurrent unit is more robust with respect to input and parameter perturbations as compared to other continuous-time RNNs. Our experiments demonstrate that the Lipschitz RNN can outperform existing recurrent units on a range of benchmark tasks.
  arXiv  Detail & Related papers  (2020-06-22T08:44:52Z)
• Applications of Koopman Mode Analysis to Neural Networks [52.77024349608834]
  We consider the training process of a neural network as a dynamical system acting on the high-dimensional weight space. We show how the Koopman spectrum can be used to determine the number of layers required for the architecture. We also show how using Koopman modes we can selectively prune the network to speed up the training procedure.
  arXiv  Detail & Related papers  (2020-06-21T11:00:04Z)

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.