Pith. sign in

REVIEW 2 cited by

Koopman-informed recurrent neural networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.23467 v3 pith:QAEVMT75 submitted 2024-10-30 cs.LG cs.NAmath.NA

Koopman-informed recurrent neural networks

classification cs.LG cs.NAmath.NA
keywords recurrentnetworksneuraldynamicalsystemstimeapproachforecasting
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Recurrent neural networks are a successful neural architecture for many time-dependent problems, including time series analysis, forecasting, and modeling of dynamical systems. In the context of dynamical systems, training with backpropagation through time can lead to challenges arising from exploding or vanishing gradients. In this contribution, we introduce Koopman-informed recurrent neural networks, a computational approach to construct all weights and biases of a recurrent neural network without using gradient-based methods. The approach is based on a combination of random feature networks and Koopman operator theory for dynamical systems. The hidden parameters of a single recurrent block are sampled at random, while the outer weights are constructed using extended dynamic mode decomposition. This approach alleviates some problems with backpropagation commonly related to recurrent networks. The connection to Koopman operator theory also allows us to start using results in this area to analyze recurrent neural networks. In computational experiments on time series, forecasting for chaotic dynamical systems, control problems, and on real-world data, we observe that with comparable forecasting accuracy, the training time of the Koopman-informed recurrent neural networks is significantly improved when compared to models trained with commonly used gradient-based methods.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adaptive Kernel Selection for Kernelized Diffusion Maps

    stat.ML 2026-04 unverdicted novelty 7.0

    Two adaptive kernel selection techniques for Kernelized Diffusion Maps are developed, backed by proofs of Lipschitz dependence on kernel weights, spectral projector continuity under gap conditions, residual control, a...

  2. Rapid training of Hamiltonian graph networks using random features

    cs.LG 2025-06 unverdicted novelty 5.0

    Hamiltonian Graph Networks achieve 150-600x faster training via random feature parameter construction while retaining comparable accuracy and physical invariances on N-body systems up to 10,000 particles.