Search arXivSearch

arXiv · 2111.14226

(Thesis) Reservoir Computing With Dynamical Systems

Abstract

A reservoir computer is a special type of neural network, where most of the weights are randomly fixed and only a subset are trained. In this thesis we prove results about reservoir computers trained on deterministic dynamical systems, and stochastic processes. We focus mostly on a special type of reservoir computer called an Echo State Network (ESN). In the deterministic case, we prove (under some assumptions) that if a reservoir computer has the Echo State Property (ESP), then there is a C1 generalised synchronisation between the input dynamical system and the dynamics in the reservoir space. Furthermore, we prove that a reservoir computer with the local ESP in several disjoint subsets of the reservoir space will admit several distinct generalised synchronisations. In the special case that the reservoir map is linear, and has the ESP, we prove that the generalised synchronisation is generically an embedding. This result admits Takens' embedding Theorem as a special case. We go to show that ESNs trained on scalar observations of an ergodic dynamical system can approximate an arbitrary target function, including the next step map used in time series forecasting. This universal approximation property holds despite the training process being entirely linear. We prove analogous results for ESNs trained on observations of a stochastic process, which are not be Markovian in general. We use these results to develop supervised learning, and reinforcement learning algorithms supported by an ESN. In the penultimate chapter of this thesis, we use a reservoir computer to numerically solve linear PDEs. In the final chapter, we conclude and discuss directions for future work.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Allen G Hart. 2021-12-24. (Thesis) Reservoir Computing With Dynamical Systems. https://arxiv.org/abs/2111.14226

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Equidistribution of saddle periodic points for Hénon-like maps

We prove that under a natural assumption on the dynamical degrees, the saddle periodic points of a Hénon-like map in any dimension equidistribute with respect to the equilibrium measure. Our work is a generalization of the results of Bedford-Lyubich-Smillie, Dujardin, and Dinh-Sibony along with improvements of their techniques. We also investigate some fine properties of Green currents associated with the map.

math.DS

On dissonance and orthogonal projections of self-conformal measures

Let $μ$ be a self-conformal measure on $\mathbb{R}^d$. We establish conditions for $μ$ under which $\dim(μ*ν) = \min\lbrace d,\dimμ+\dimν\rbrace$ holds when $ν$ is any Ahlfors-regular or self-conformal measure on $\mathbb{R}^d$. Our main result states the following sufficient condition: $μ$ is totally non-linear and not supported on a smooth hypersurface. We also establish sufficient (likely non-sharp) algebraic conditions for self-conformal measures which are not totally non-linear. In addition, we show that $\dim μ\circπ^{-1} = \min\{ k, \dim μ\}$ for every ortohogonal projection $π:\mathbb{R}^d\to\mathbb{R}^k$, $0<k<d$, when either $d=2$ and $μ$ is not self-similar and not supported on a line, or $d\geq 3$ and $μ$ is totally non-linear and not supported on a smooth hypersurface.

math.DS

Equation-Free Screening of Mittag-Leffler-Compatible Dynamics from Scalar Time Series via kNN Multi-Horizon Profiles

Fractional models provide a natural description of systems with memory, but a noninteger derivative should not be introduced solely because a time series is curved or slowly relaxing. We develop an equation-free preliminary screening framework that asks whether a scalar time series produces a multi-horizon k-nearest-neighbor (kNN) profile more compatible with Mittag-Leffler-type behavior than with selected conventional alternatives. In an ideal matched Caputo-relaxation benchmark, the complete generation-kNN-profile-model-comparison pipeline reproduces the expected Mittag-Leffler geometry and recovers the generating order to within approximately $10^{-3}$; this is interpreted as controlled calibration rather than as general fractional-order identification. Under 3% trajectory-specific observational noise, the held-out Mittag-Leffler preference is most consistent when the generating dynamics are well separated from the integer-order limit and becomes progressively less decisive as $α\rightarrow1$. The fitted order $α_{\mathrm{fit}}$, however, shows substantially larger realization-to-realization variability. Thus, relative model compatibility is more robust than single-realization order estimation in the present noisy benchmark. Noise-free nonfractional controls show a separate limitation of specificity: a stretched exponential can generate a strongly Mittag-Leffler-compatible profile, whereas inclusion of the generating rational/Hill family recovers that family and its parameters to numerical precision in the matched setting. A positive Mittag-Leffler-versus-exponential screen therefore does not uniquely establish fractional origin. A fractional chaotic system is treated only as an exploratory extension: the Mittag-Leffler growth family gives lower finite-window RMSE than exponential and logistic/saturating alternatives over the detected pre-transition interval.

math.DS