SearcharxivSearch

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

BibTeXRIS

Allen G Hart. 2021-11-28. (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

Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications

We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive H\"older class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-H\"older continuity of the integrated density of states for the associated quasiperiodic Schr\"odinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.

math.DS

Dynamics inside the attracting basins of some skew products

Polynomial skew products in $\mathbb{C}^2$ are maps of the form $F(z,w)=(P(z),Q(z,w))$, where $P$ and $Q$ are polynomials. Their local dynamics have been widely investigated. In this paper, we study the global dynamics inside Fatou components of some skew products. We consider all the inverse images in a Fatou component of a given point and use the Kobayashi metric to measure the distance between points. In the cases we consider, there are always arbitrarily large Kobayashi balls in the complement of these inverse sets.

math.DS

Ergodicity of dynamical systems without uniqueness of orbits

Recently, there has been considerable interest in the study of non-deterministic dynamical systems. To analyze the chaotic behavior of such systems from a measure-theoretic viewpoint, it is desirable to consider ergodicity. However, the classical definition of ergodicity involves invariant sets, whose definition is not unique for non-deterministic dynamical systems. Thus, we are led to the question of which invariance yields an interesting definition of ergodicity. Here, we propose a definition based on the strong backward invariance and show that analogs of classical results hold. We also consider implications of the Birkhoff ergodic theorem for systems without uniqueness of orbits.

math.DS