mlsanityData to 7 Oct 2026

Reservoir kernels and Volterra series

arXiv 2212.14641 ↗First posted 30 Dec 2022cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

A universal kernel is constructed whose sections approximate any causal and time-invariant filter in the fading memory category with inputs and outputs in a finite-dimensional Euclidean space. This kernel is built using the reservoir functional associated with a state-space representation of the Volterra series expansion available for any analytic fading memory filter, and it is hence called the Volterra reservoir kernel. Even though the state-space representation and the corresponding reservoir feature map are defined on an infinite-dimensional tensor algebra space, the kernel map is characterized by explicit recursions that are readily computable for specific data sets when employed in estimation problems using the representer theorem. The empirical performance of the Volterra reservoir kernel is showcased and compared to other standard static and sequential kernels in a multidimensional and highly nonlinear learning task for the conditional covariances of financial asset returns.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 18 of its 75 references that are in the map. First posted on arXiv 30 Dec 2022.

Builds on

18 of 75 references.

References · 18

  1. 2018The UEA multivariate time series classification archive, 2018cited by 330
  2. 2021Next Generation Reservoir Computingcited by 160
  3. 2020Benchmarking Multivariate Time Series Classification Algorithmscited by 145
  4. 2018Echo state networks are universalcited by 86
  5. 2016Kernels for sequentially ordered datacited by 83
  6. 2020The Signature Kernel is the solution of a Goursat PDEcited by 58
  7. 2020Approximation Bounds for Random Neural Networks and Reservoir Systemscited by 52
  8. 2018Reservoir Computing Universality With Stochastic Inputscited by 48
  9. 2017Universal discrete-time reservoir computers with stochastic inputs and linear readouts using non-homogeneous state-affine systemscited by 39
  10. 2020Fading memory echo state networks are universalcited by 31
  11. 2020Discrete-time signatures and randomness in reservoir computingcited by 23
  12. 2019Risk bounds for reservoir computingcited by 22
6 more
  1. 2022Designing Universal Causal Deep Learning Models: The Case of Infinite-Dimensional Dynamical Systems from Stochastic Analysiscited by 22
  2. 2020Echo State Networks trained by Tikhonov least squares are L2(μ) approximators of ergodic dynamical systemscited by 21
  3. 2019Differentiable reservoir computingcited by 20
  4. 2021Learning strange attractors with reservoir systemscited by 16
  5. 2019Dynamical Systems as Temporal Feature Spacescited by 12
  6. 2020Dimension reduction in recurrent networks by canonicalizationcited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 2; 2025: 2; 2026: 2.

8 papers.