Infinite-dimensional next-generation reservoir computing
Not on the map. Why?
Abstract (arXiv)
Next-generation reservoir computing (NG-RC) has attracted much attention due to its excellent performance in spatio-temporal forecasting of complex systems and its ease of implementation. This paper shows that NG-RC can be encoded as a kernel ridge regression that makes training efficient and feasible even when the space of chosen polynomial features is very large. Additionally, an extension to an infinite number of covariates is possible, which makes the methodology agnostic with respect to the lags into the past that are considered as explanatory factors, as well as with respect to the number of polynomial covariates, an important hyperparameter in traditional NG-RC. We show that this approach has solid theoretical backing and good behavior based on kernel universality properties previously established in the literature. Various numerical illustrations show that these generalizations of NG-RC outperform the traditional approach in several forecasting applications.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 11 of its 51 references that are in the map. First posted on arXiv 13 Dec 2024.
Builds on
11 of 51 references.
References · 11
- 2021Next Generation Reservoir Computingcited by 160
- 2018Echo state networks are universalcited by 86
- 2018Reservoir Computing Universality With Stochastic Inputscited by 48
- 2017Universal discrete-time reservoir computers with stochastic inputs and linear readouts using non-homogeneous state-affine systemscited by 39
- 2020Fading memory echo state networks are universalcited by 31
- 2022Learning Spatiotemporal Chaos Using Next-Generation Reservoir Computingcited by 20
- 2021Using Data Assimilation to Train a Hybrid Forecast System that Combines Machine-Learning and Knowledge-Based Componentscited by 18
- 2021Learning strange attractors with reservoir systemscited by 16
- 2024Controlling Chaos Using Edge Computing Hardwarecited by 11
- 2023Controlling Chaotic Maps using Next-Generation Reservoir Computingcited by 7
- 2013Universalities of Reproducing Kernels Revisitedcited by 1
Built on by
Citing papers per year: 2025: 7; 2026: 2.
9 papers.
- 2025Context parroting: A simple but tough-to-beat baseline for foundation models in scientific machine learningcited by 14
- 2025On the emergence of numerical instabilities in Next Generation Reservoir Computingcited by 3
- 2025Adaptive Nonlinear Vector Autoregression: Robust Forecasting for Noisy Chaotic Time Seriescited by 2
- 2026Kernel-based optimization of measurement operators for quantum reservoir computerscited by 2
- 2025Next-Generation Reservoir Computing for Dynamical Inferencecited by 1
- 2025A tensor network approach for chaotic time series predictioncited by 0
- 2025Reservoir Computing via Multi-Scale Random Fourier Features for Forecasting Fast-Slow Dynamical Systemscited by 0
- 2025Next-generation reservoir computing validated by classification taskcited by 0
- 2026Kolmogorov-Arnold Reservoir Computingcited by 0
- 2026Kolmogorov-Arnold Reservoir Computing18 Jun 2026
- 2026Kernel-based optimization of measurement operators for quantum reservoir computers16 Feb 2026
- 2025Next-generation reservoir computing validated by classification task15 Dec 2025
- 2025Reservoir Computing via Multi-Scale Random Fourier Features for Forecasting Fast-Slow Dynamical Systems4 Nov 2025
- 2025Next-Generation Reservoir Computing for Dynamical Inference14 Sep 2025
- 2025Adaptive Nonlinear Vector Autoregression: Robust Forecasting for Noisy Chaotic Time Series11 Jul 2025
- 2025A tensor network approach for chaotic time series prediction23 May 2025
- 2025Context parroting: A simple but tough-to-beat baseline for foundation models in scientific machine learning16 May 2025
- 2025On the emergence of numerical instabilities in Next Generation Reservoir Computing1 May 2025