Exploiting oscillatory dynamics of delay systems for reservoir computing.

Nonlinear dynamical systems exhibiting inherent memory can process temporal information by exploiting their responses to input drives. Reservoir computing is a prominent approach to leverage this ability for time-series forecasting. The computational capabilities of analog computing systems often depend on both the dynamical regime of the system and the input drive. Most studies have focused on systems exhibiting a stable fixed-point solution in the absence of input. Here, we go beyond that limitation, investigating the computational capabilities of a paradigmatic delay system in three different dynamical regimes. The system we chose has an Ikeda-type nonlinearity and exhibits fixed point, bistable, and limit-cycle dynamics in the absence of input. When driving the system, new input-driven dynamics emerge from the autonomous ones featuring characteristic properties. Here, we show that it is feasible to attain consistent responses across all three regimes, which is an essential prerequisite for the successful execution of the tasks. Furthermore, we demonstrate that we can exploit all three regimes in two time-series forecasting tasks, showcasing the versatility of this paradigmatic delay system in an analog computing context. In all tasks, the lowest prediction errors were obtained in the regime that exhibits limit-cycle dynamics in the undriven reservoir. To gain further insights, we analyzed the diverse time-distributed node responses generated in the three regimes of the undriven system. An increase in the effective dimensionality of the reservoir response is shown to affect the prediction error, as also fine-tuning of the distribution of nonlinear responses. Finally, we demonstrate that a trade-off between prediction accuracy and computational speed is possible in our continuous delay systems. Our results not only provide valuable insights into the computational capabilities of complex dynamical systems but also open a new perspective on enhancing the potential of analog computing systems implemented on various hardware platforms.

Learn one size to infer all: Exploiting translational symmetries in delay-dynamical and spatiotemporal systems using scalable neural networks.

We design scalable neural networks adapted to translational symmetries in dynamical systems, capable of inferring untrained high-dimensional dynamics for different system sizes. We train these networks to predict the dynamics of delay-dynamical and spatiotemporal systems for a single size. Then, we drive the networks by their own predictions. We demonstrate that by scaling the size of the trained network, we can predict the complex dynamics for larger or smaller system sizes. Thus, the network learns from a single example and by exploiting symmetry properties infers entire bifurcation diagrams.

Deep time-delay reservoir computing: Dynamics and memory capacity.

The deep time-delay reservoir computing concept utilizes unidirectionally connected systems with time-delays for supervised learning. We present how the dynamical properties of a deep Ikeda-based reservoir are related to its memory capacity (MC) and how that can be used for optimization. In particular, we analyze bifurcations of the corresponding autonomous system and compute conditional Lyapunov exponents, which measure generalized synchronization between the input and the layer dynamics. We show how the MC is related to the systems' distance to bifurcations or magnitude of the conditional Lyapunov exponent. The interplay of different dynamical regimes leads to an adjustable distribution between the linear and nonlinear MC. Furthermore, numerical simulations show resonances between the clock cycle and delays of the layers in all degrees of MC. Contrary to MC losses in single-layer reservoirs, these resonances can boost separate degrees of MC and can be used, e.g., to design a system with maximum linear MC. Accordingly, we present two configurations that empower either high nonlinear MC or long time linear MC.