arXiv:2607. 17858v1 Announce Type: cross Abstract: Reservoir computing exploits nonlinear dynamical systems to encode temporal inputs into high-dimensional state space representations.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
The paper investigates how training shapes the geometry of recurrent network dynamics in Reservoir Computing (RC) networks used for temporal forecasting. It demonstrates that, in a linear continuous-time reservoir with infinite data, training data create an invariant subspace whose dimension matches the number of dominant modes. For a simplified diagonal linear reservoir, the study connects dominant eigenvalues and eigenvectors to the spectrum of a backward Dynamic Mode Decomposition matrix, providing a finite-dimensional approximation of the backward-time Koopman operator, and illustrates these phenomena through simulation while suggesting extensions to nonlinear RC.
arXiv:2607. 24420v1 Announce Type: cross Abstract: Reservoir computing has emerged as an efficient machine learning framework for predicting time series generated by dynamical systems.
arXiv:2607. 17909v1 Announce Type: cross Abstract: The edge-of-chaos heuristic has long served as a guiding principle for designing reservoir computers, yet its relevance to machine performance remains elusive.
arXiv:2504. 17503v2 Announce Type: replace Abstract: We study how the degree of nonlinearity in the input data affects the optimal design of reservoir computers, focusing on how closely the model's nonlinearity should align with that of the data.
The paper introduces task‑resolved Fisher spectroscopy for quantum reservoir computing, defining orthonormal score coordinates from prediction targets that reweight labeled histories to produce an affine family of reservoir states and measurement outcomes. It establishes a Fisher‑information hierarchy linking state quantum Fisher information, measurement record Fisher information, and moment matrices up to many‑body order, providing a quadratic form that equals the stationary capacity of the optimal linear readout. The method requires only stationary labeled records and measured outcomes, enabling predictions of held‑out capacities, necessary feature order, and measurement‑budget dependence, and demonstrates how optimizing local measurement axes can recover hidden task information in a five‑spin open reservoir.
arXiv:2606. 19984v1 Announce Type: new Abstract: Reservoir computing offers a lightweight framework for forecasting dynamical systems but may struggle to capture long-range dependencies due to limited representational capacity.