mlsanityData to 14 Oct 2026

Free-Probability Kernels for Zero-Rollout Hyperparameter Selection in Reservoir Computing

arXiv 2608.20998 ↗First posted 21 Aug 2026cs.LG cs.NE stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Reservoir computing (RC) couples a fixed recurrent dynamical system with a trained lightweight readout, but this efficiency is partly lost during hyperparameter selection: the recurrent gain, input scale, and leakage rate determine the reservoir's stability and temporal processing regime and are usually tuned through many rollouts. We introduce a deterministic, pilot-informed selector for leaky linear reservoirs followed by coordinate-wise nonlinear features. Free probability yields cross-lag propagation coefficients that summarize how the reservoir mixes past inputs. In the large-width limit, these coefficients define a deterministic temporal kernel that approximates the finite-reservoir feature geometry. Kernel ridge regression on a short labelled pilot sequence therefore ranks candidate operating regimes without instantiating or rolling out a reservoir, and the selected configuration transfers across widths. Across ten synthetic temporal benchmarks, zero-rollout selection obtains a mean deployment score of 0.772, compared with 0.774 for exhaustive simulation-based search, while avoiding 156,600 selection rollouts. With a small rollout budget, the proposed ranking provides the strongest mean performance at every tested budget and reaches the exhaustive reference using 4.8% of its rollout cost. On four public electricity-transformer-temperature (ETT) forecasting datasets, five retained candidates recover the exhaustive operating point on three datasets. On multivariate cellular-traffic forecasting, 15 rollouts per cell reach the 462-rollout exhaustive reference and outperform random search and Bayesian optimization at low budgets. These results position free-probability kernels as deterministic surrogates for selecting reservoir operating regimes when validation rollouts are scarce.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 35 references that are in the map. First posted on arXiv 21 Aug 2026.

Builds on

11 of 35 references.

References · 11

  1. 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
  2. 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,169
  3. 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 408
  4. 2018Reservoir Computing Universality With Stochastic Inputscited by 48
  5. 2021Robust Optimization and Validation of Echo State Networks for learning chaotic dynamicscited by 27
  6. 2020Reservoir Computing meets Recurrent Kernels and Structured Transformscited by 16
  7. 2019Efficient Optimization of Echo State Networks for Time Series Datasetscited by 10
  8. 2022Reservoir kernels and Volterra seriescited by 8
  9. 2019Efficient Cross-Validation of Echo State Networkscited by 3
  10. 2024Comparison of Reservoir Computing topologies using the Recurrent Kernel approachcited by 3
  11. 2022Hyperparameter Tuning in Echo State Networkscited by 2

Built on by

Not cited yet.