Deterministic Reservoir Computing for Chaotic Time Series Prediction

Johannes Viehweg, Constanze Poll, Patrick Mäder
1/26/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Reservoir Computing was shown in recent years to be useful as efficient to learn networks in the field of time series tasks. Their randomized initialization, a computational benefit, results in drawbacks in theoretical analysis of large random graphs, because of which deterministic variations are an still open field of research. Building upon Next-Gen Reservoir Computing and the Temporal Convolution Derived Reservoir Computing, we propose a deterministic alternative to the higher-dimensional mapping therein, TCRC-LM and TCRC-CM, utilizing the parametrized but deterministic Logistic mapping and Chebyshev maps. To further enhance the predictive capabilities in the task of time series forecasting, we propose the novel utilization of the Lobachevsky function as non-linear activation function. As a result, we observe a new, fully deterministic network being able to outperform TCRCs and classical Reservoir Computing in the form of the prominent Echo State Networks by up to $99.99\%$ for the non-chaotic time series and $87.13\%$ for the chaotic ones.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{viehweg2025deterministic,
  title  = {Deterministic Reservoir Computing for Chaotic Time Series Prediction},
  author = {Johannes Viehweg and Constanze Poll and Patrick Mäder},
  year   = {2025},
  eprint = {2501.15615},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.15615v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.15615.svg)](https://codeofpaper.com/paper/2501.15615)

Discussion