Organizations: Graduate School of Information and Computer Science, Chiba Institute of Technology, Narashino, Chiba 275-0016, Japan · Department of Computer Science, Chiba Institute of Technology, Narashino, Chiba 275-0016, Japan · Research Center for Mathematical Engineering, Chiba Institute of Technology, Narashino, Chiba 275-0016, Japan · Department of Preventive Intervention for Psychiatric Disorders, National Institute of Mental Health, National Center of Neurology and Psychiatry, Kodaira, Tokyo 187-8551, Japan · International Research Center for Neurointelligence (WPI-IRCN), The University of Tokyo, Bunkyo-ku, Tokyo 113-0033, Japan · Department of Mechanical Science and Engineering, School of Advanced Engineering, Kogakuin University, Hachioji, Tokyo 192-0015, Japan · Department of Intelligent Systems, Tokyo City University, Setagaya-ku, Tokyo 158-8557, Japan
In reservoir computing, performance depends on whether the fixed dynamics of the reservoir suit the task, and the appropriate memory length and frequency response differ across tasks. The reservoir settings are found by a search on each task, and driving the reservoir with the input and collecting its states for every candidate setting dominates the cost of the search. In a reservoir with a linear recurrence, the dynamics decompose into modes, one per eigenvalue, and the eigenvalue distribution becomes a design variable. We propose the Sector-Ring Linear Reservoir (SRLR), in which the eigenvalue angles are fixed at evenly spaced positions around a circle and one decay timescale, chosen from a few values, is assigned to each sector of consecutive angles. To keep the scale of each mode's state equal across candidates, the input weights are scaled using the power spectrum of the training input. To reduce the cost of the search, the states of the modes for each decay-timescale value are computed once and reused across candidates. On prediction and reconstruction benchmarks built from chaotic systems, the SRLR achieved, in all eight cases, a lower mean test error than a reference model in which all modes share one decay timescale, and was competitive with nonlinear echo state network and leaky-integrator echo state network baselines. The selected decay-timescale profiles changed with the prediction target and horizon. The state reuse reduced the number of computed mode trajectories in the search by 99.8% relative to per-candidate recomputation.
Figures & tables
Fig. 1: Concept of the Sector-Ring Linear Reservoir. The preprocessed input ut enters through input weights scaled using the power spectral density (PSD) of the training input (Section III-A3c). Rotation–decay blocks assigned to sectors generate the states of the modes, which a fixed orthogonal mixing and a fixed tanh map transform into features for the ridge readout. Here q(ϕ)=[cosϕ,sinϕ]T denotes the unit direction of the input weights of one mode. In the pipeline and the bottom row, H denotes the states ht stacked in rows over time, so that the rows of HQ are the mixed states QTht (Section III-B3). The upper-right callout summarizes the candidate-evaluation computation (Section III-B3): a state bank indexed by the half-life value (the per-sector decay timescale, Section III-A3b) reuses states across candidates. An associative scan is invoked only for a half-life value that the candidate requires and the bank does not yet hold.
TABLE I: Search spaces. Realized evaluation counts are given per case in Appendix B . Here (lin) and (log) denote uniform sampling on a linear and a logarithmic scale, respectively.
Fig. 2: Test NRMSE of the SRLR and the common-radius reference on (a) the four Lorenz tasks and (b) the four Rössler tasks. For each system, the panels show, in order, x→x prediction at horizon 1, x→x prediction at horizon 12, x→z reconstruction at horizon 0, and x→z reconstruction at horizon 12. Bars show means over ten model seeds, and error bars show population SD.
Task
Common-radius reference
SRLR
Lorenz
x→x , horizon 1
(8.29±1.63)×10−6
(4.36±0.507)×10−6
x→x , horizon 12
0.0283±0.00190
0.0209±0.00167
x→z , horizon 0
0.132±0.00748
0.109±0.0112
x→z , horizon 12
0.162±0.00862
0.144±0.0121
Rössler
TABLE II: Test NRMSE for the common-radius reference and the SRLR: mean ± population SD over ten model seeds. The lowest mean in each row is in bold.
Fig. 3: Test NRMSE of the ESN, the LI-ESN, and the SRLR on (a) the four Lorenz tasks and (b) the four Rössler tasks, in the task order of Fig. 2 . Bars show means over ten model seeds, and error bars show population SD.
Task
ESN
LI-ESN
SRLR
Lorenz
x→x , horizon 1
(19.5±3.09)×10−6
(19.7±3.33)×10−6
(4.36±0.507)×10−6
x→x , horizon 12
0.0536±0.00418
0.0395±0.00456
0.0209±0.00167
x→z , horizon 0
0.0853±0.0200
0.0328±0.0100
0.109±0.0112
x→z , horizon 12
0.204±0.0167
0.126±0.0104
0.144±0.0121
Rössler
TABLE III: Test NRMSE for the ESN, the LI-ESN, and the SRLR: mean ± population SD over ten model seeds. The lowest mean in each row is in bold.
Fig. 4: Half-life profiles selected by the validation searches for the SRLR on (a) the four Lorenz tasks and (b) the four Rössler tasks, in the task order of Fig. 2 . Each task panel is a heatmap with the six half-life values ηk∈{0.25,0.5,1,2,4,8} (in reservoir updates) as rows and the sectors 0–7 as columns (sector 0 contains the smallest angles θj , near 0, and sector 7 the largest, near π ; see ( 6 )). The color of a cell indicates the fraction of the ten model seeds that selected that half-life for that sector, and cells selected by at least five seeds are labeled with the seed count.
Fig. 5: Test NRMSE of the three input-weight designs of the SRLR (PSD-scaled, γ -normalized, and uniform random) on (a) the four Lorenz tasks and (b) the four Rössler tasks, in the task order of Fig. 2 , each design with the settings selected by its own search. Bars show means over ten model seeds, and error bars show population SD.
Task
PSD-scaled
γ -normalized
Uniform random
Lorenz
x→x , horizon 1
(4.36±0.507)×10−6
(5.56±0.691)×10−6
(4.59±0.424)×10−6
x→x , horizon 12
0.0209±0.00167
0.0245±0.00222
0.0265±0.00286
x→z , horizon 0
0.109±0.0112
0.0923±0.0113
0.0864±0.00990
x→z , horizon 12
0.144±0.0121
0.147±0.00614
0.154±0.00806
Rössler
TABLE IV: Test NRMSE for the three input-weight designs of the SRLR: mean ± population SD over ten model seeds. The lowest mean in each row is in bold.
Fig. 6: Ratio of the 90th to the 10th percentile (P90/P10) of the 64 coordinate scales within each profile, where each scale is the population SD of one coordinate of the states of the modes, for the PSD-scaled, γ -normalized, and uniform random input-weight designs (Section III-A3c) on (a) the Lorenz tasks and (b) the Rössler tasks. Each thin line connects the values of one profile (40 profiles, one per task and model seed) across the three designs. Large outlined symbols mark medians, and vertical bars span the interquartile range. The dotted line marks a ratio of 1.
Fig. 7: Computational cost of the validation searches. (a) Full operational wall time and number of evaluations that returned a finite validation NRMSE for the SRLR, the ESN, the LI-ESN, and the common-radius reference (80 searches per search configuration). The searches of the four configurations ran sequentially, the ten seeds of each case ran concurrently, and other workloads on the machine were not controlled. (b) Time per evaluated candidate for the first 30 of the 128 replayed candidates (the first 128 candidates recorded in each search, re-evaluated in their recorded order) in each of 80 searches per search configuration, one per system, task, and model seed, measured with one worker process and one BLAS thread on one machine, using a fresh process for each search and, for the SRLR, a fresh state bank per search. Lines show medians across searches, and shading covers the middle 50% (25th–75th percentile range). For the SRLR, all six half-life values of the state bank had been computed by the third evaluation in all 80 searches, and a half-life value computed in an earlier evaluation could be reused before the bank was complete. (c) Mean evaluation-time components from the same measurements as panel (b), over all 128 replayed candidates (10,240 per search configuration). (d) Median time for Optuna to generate the next candidate before evaluation, recorded during the searches, over successive blocks of 1,024 candidates, separately for each case and for the four search configurations of panel (a) (10,240 measurements per point, 1,024 candidates × ten seeds). Solid and dashed lines denote Lorenz and Rössler, respectively.
Appendix figures & tables3 assets
Supplementary material from the paper’s appendix.
Appendix
Task
ESN
LI-ESN
SRLR (PSD-scaled)
Common-radius reference
SRLR ( γ -normalized)
SRLR (uniform random)
Lorenz
x→x , horizon 1
3,072
3,072
3,072
3,072
3,072
4,096
x→x , horizon 12
3,072
3,072
3,072
3,072
3,072
3,072
x→z , horizon 0
3,072
3,072
3,072
3,072
3,072
3,072
x→z , horizon 12
3,072
3,072
3,072
3,072
3,072
3,072
Rössler
Appendix
TABLE VI: Final evaluation counts of the validation searches for each search configuration and system–task case. Each entry is the count shared by the ten model seeds of that case. All 48 configuration–case pairs met the stopping rule of Section III-B2 before reaching the budget of 8,192 evaluations.
Fig. 8: Best validation NRMSE found so far versus the number of evaluated candidates for the six search configurations on the eight system–task cases ((a) Lorenz, (b) Rössler). Lines show the median across the ten model seeds, and bands span the interquartile range. Each curve ends at the evaluation count in Table VI . The vertical axis is truncated at the top so that the later part of the searches is visible, and the first evaluations of each curve lie above the plotted range.
Fig. 9: Best validation NRMSE found so far versus the number of evaluated candidates for the SRLR with the PSD-scaled design, shown separately for the ten model seeds ((a) Lorenz, (b) Rössler). Each line ends at the evaluation count of its case in Table VI , and a marker shows the final value of each line. The vertical axis is truncated at the top as in Fig. 8 .
Echo-state networks enable efficient temporal learning by fixing the recurrent dynamics and training only a linear readout. However, conventional reservoirs typically accommodate signal mixing, memory retention, and stability within a single random recurrent matrix. Existing structured designs improve topology, norm preservation, leakage, or depth, but generally do not provide separate modal control of reversible mixing and irreversible forgetting together with a direct global stability guarantee. We introduce a classical Lindblad-inspired multi-timescale reservoir that bridges open-system dynamical principles with structured state-space modeling. The recurrent operator is assembled from exactly discretized damped rotational modes, so rotation and decay become independent design variables governing phase mixing and memory loss. Orthogonal mode mixing preserves normality, while the decay spectrum directly determines the echo-state stability margin without post-hoc spectral-radius rescaling. We evaluate the method over ten aligned seeds against standard, leaky, deep, orthogonal, cycle, and next-generation reservoirs, together with a compact trained gated recurrent unit, across linear memory, nonlinear recurrence, chaotic forecasting, delayed logic, and real sensor calibration. Across the benchmark suite, the proposed reservoir achieves the best fixed-reservoir performance on bounded NARMA-20 and the lowest mean error on Lorenz-63, matches the strongest linear-memory result, and remains broadly competitive across broad range of benchmarks. Ablation studies show that rotation increases state diversity, whereas dissipation provides controlled forgetting and improves predictive conditioning. The resulting framework offers an interpretable recurrent architecture in which mixing, memory, and stability are explicit and independently tunable design variables.
Jyotiranjan Beuria, Amit Shukla
IKS Research Centre, ISS, Delhi, India · Indian Institute of Technology Mandi, Himachal Pradesh, India
Reservoir computing exploits nonlinear dynamical systems to encode temporal inputs into high-dimensional state space representations. Although reservoir performance is often characterized through memory, nonlinearity, and their tradeoff, such aggregate measures do not reveal how task-relevant information is organized within the state space. Here, we introduce an eigen-spectral decomposition framework linking the degree-wise information processing capacity to the corresponding state space modes. As a result, we are able to quantify the degree-wise representation energy, and show that in some cases, substantial amounts of information processing capacity may reside in low-energy modes that are vulnerable to experimental noise. These results suggest that useful reservoir computation depends not only on dimensionality expansion, but also on the geometric organization of task-relevant information, with direct implications on physical reservoir computers.
Mohab Abdalla, Damien Rontani
CentraleSupélec, Université de Lorraine, LMOPS EA-4423 Laboratory, 57070 Metz, France
Reservoir computing typically relies on large, randomly generated reservoirs, enabling simple, often linear readouts. Over the past two decades, most constructions have exploited the freedom to select the reservoir, constrained primarily by stability conditions based on state contraction or memory capacity. However, these designs are largely independent of the input data and learning objective, resulting in a trial-and-error methodology driven by randomness. In high dimensions, the reservoir acts as a random embedding of the input history, implicitly relying on Johnson--Lindenstrauss--type concentration phenomena to preserve information. In contrast, we develop reservoir design principles from a geometric perspective for inputs generated by deterministic dynamical systems. Rather than relying on random embeddings, we require reservoir state increments to align within a cone around an input-determined vector subspace, and prove that such a cone concentration reduces ridge-regression training error. When the cone angle is small, the variance of reservoir states concentrates in the input-determined subspace, improving conditioning of the empirical second-moment matrix and strengthening alignment between dominant covariance directions and the state-target cross-covariance. For echo state networks, we provide a constructive approach to reservoir design. The reservoir matrix is chosen so that associated Krylov-chain directions remain nearly closed within an input-determined subspace while permitting controlled mixing in its orthogonal complement. We also provide a spectral diagnostic for ridge regression training that identifies when reservoir geometry concentrates predictive information into a few dominant covariance modes and when ``spectral pollution'' inhibits forecasting. Numerical experiments demonstrate consistent performance gains over arbitrary reservoir constructions.
G Manjunath, Juan-Pablo Ortega, Alma van der Merwe
University of Pretoria. Department of Mathematics and Applied Mathematics. Pretoria 0002, South Africa. · Nanyang Technological University. Division of Mathematical Sciences. School of Physical and Mathematical Sciences. Singapore.