Investigation of efficiency of Liquid State Machine spiking neural networks in chaotic time series forecasting using software simulation methods

The subject of the study is the application of spiking neural networks of the Liquid State Machine (LSM) type to the problem of chaotic time series forecasting. The objective is to establish a theoretical and software foundation for modeling the LSM utilizing the BindsNET library, alongside performing a reproducible comparative analysis against a Long Short-Term Memory (LSTM) recurrent neural network using the Mackey–Glass benchmark. The methodology includes building a reservoir of Leaky Integrate-and-Fire neurons, rate coding of the input signal via a Poisson spike generator, and training a linear readout using Ridge regression. A single-layer Long Short-Term Memory network served as the reference model. The scientific novelty of the work lies in the reproducible comparison of a spiking reservoir based on Leaky Integrate-and-Fire neurons with a Long Short-Term Memory network on a standard benchmark with open-source code. The emphasis is placed on comparing the number of trainable parameters and the practical cost of readout retraining. Main results are: the LSM achieves root mean square error (RMSE) at 0.0083 and mean absolute error (MAE) at 0.0061; readout training time is 12.4 s, full pipeline time (including reservoir simulation) is approximately 58 s. The recurrent network achieves RMSE at 0.0071 and MAE at 0.0052 with a total training time of 47.8 s. Reservoir activation sparsity is 9.3%. The optimal spectral radius ρ = 0.9 is selected by grid search over ρ ∈ {0.5; 0.7; 0.9; 1.0; 1.2} using minimum RMSE on the validation set as the selection criterion (Table 4). Statistical significance by Welch’s t-test (p < 0.05) should be considered preliminary given the limited number of runs (n = 5). The LSM underperforms the recurrent network in accuracy by no more than 17 % while training 34 times fewer parameters (501 versus 17 217). Although the full pipeline time of the LSM (~58 s) slightly exceeds the total training time of the recurrent network (47.8 s), in scenarios requiring repeated readout retraining on new data without re-simulating the reservoir, the adaptation time is reduced to 12.4 s versus 47.8 s, making the LSM a practically viable alternative when the number of trainable readout parameters does not exceed 10³ and the model re-adaptation time must not exceed 15 s on a dataset of 2 000 points.

1. Hochreiter S., Schmidhuber J. Long short-term memory // Neural Computation. 1997. Vol. 9, no. 8. P. 1735–1780. https://doi.org/10.1162/neco.1997.9.8.1735.

2. Maass W., Natschläger T., Markram H. Real-time computing without stable states: A new framework for neural computation based on perturbations // Neural Computation. 2002. Vol. 14, no. 11. P. 2531–2560. https://doi.org/10.1162/089976602760407955.

3. Jaeger H. The “echo state” approach to analysing and training recurrent neural networks. URL: https://publica.fraunhofer.de/entities/publication/7d4a7eec-a22c-4df0-903d-93f9cd5aca02 (дата обращения: 01.03.2026).

4. Maass W. Networks of spiking neurons: The third generation of neural network models // Neural Networks. 1997. Vol. 10, no. 9. P. 1659–1671. https://doi.org/10.1016/S0893-6080(97)00011-7.

5. Maass W. Liquid state machines: Motivation, theory, and applications // Computability in Context: Computation and Logic in the Real World / S. B. Cooper, A. Sorbi, eds. London : Imperial College Press, 2011. P. 275–296.

6. Lukoševičius M. A practical guide to applying echo state networks // Neural Networks: Tricks of the Trade / G. Montavon, G. B. Orr, K.-R. Müller, eds. 2nd ed. Berlin/Heidelberg : Springer, 2012. Vol. 7700. P. 659–686. https://doi.org/10.1007/978-3-642-35289-8_36.

7. Hazan H., Saunders D. J., Khan H. et al. BindsNET: Amachine learning-oriented spiking neural networks library in Python // Frontiers in Neuroinformatics. 2018. Vol. 12. https://doi.org/10.3389/fninf.2018.00089.

8. Vlachas P. R., Pathak J., Hunt B. R. et al. Backpropagation algorithms and reservoir computing in recurrent neural networks for the forecasting of complex spatiotemporal dynamics // Neural Networks. 2020. Vol. 126. P. 191–217. https://doi.org/10.1016/j.neunet.2020.02.016.

9. Farmer J. D. Chaotic attractors of an infinite-dimensional dynamical system // Physica D: Nonlinear Phenomena. 1982. Vol. 4, no. 3. P. 366–393. https://doi.org/10.1016/0167-2789(82)90042-2.

10. Grassberger P., Procaccia I. Dimensions and entropies of strange attractors from a fluctuating dynamics approach // Physica D: Nonlinear Phenomena. 1984. Vol. 13, no. 1–2. P. 34–54. https://doi.org/10.1016/0167-2789(84)90269-0.

11. Wolf A., Swift J. B., Swinney H. L. et al. Determining Lyapunov exponents from a time series // Physica D: Nonlinear Phenomena. 1985. Vol. 16. P. 285–317. https://doi.org/10.1016/0167-2789(85)90011-9.

12. Jaeger H. Echo state network // Scholarpedia. URL: http://www.scholarpedia.org/article/Echo_state_network (дата обращения: 01.04.2026).