Temporal Convolution Derived Multi-Layered Reservoir Computing
Johannes Viehweg, Dominik Walther, Patrick Mäder
TL;DR
This work tackles time-series prediction, especially chaotic and history-dependent dynamics, where traditional RC suffers from randomness and variance across initializations. It introduces Temporal Convolution Derived Reservoir Computing (TCRC) and the TC-ELM variant, embedding temporal convolution-inspired state mappings into reservoir-like architectures to improve memory handling while reducing randomness. Across Mackey-Glass variants and the SantaFe Laser dataset, the proposed methods achieve substantial reductions in prediction error compared to established baselines such as ESN, GRU, NG-RC, and AEESN, with multi-layer TCRC offering notable gains for non-chaotic data and TCRC-ELM enhancing chaotic predictions through random projection. The results highlight improved parallelizability, memory retention, and robustness, while acknowledging limitations related to dataset scope and parameter sensitivity, pointing to future work on scaling and non-random mappings.
Abstract
The prediction of time series is a challenging task relevant in such diverse applications as analyzing financial data, forecasting flow dynamics or understanding biological processes. Especially chaotic time series that depend on a long history pose an exceptionally difficult problem. While machine learning has shown to be a promising approach for predicting such time series, it either demands long training time and much training data when using deep Recurrent Neural Networks. Alternative, when using a Reservoir Computing approach it comes with high uncertainty and typically a high number of random initializations and extensive hyper-parameter tuning. In this paper, we focus on the Reservoir Computing approach and propose a new mapping of input data into the reservoir's state space. Furthermore, we incorporate this method in two novel network architectures increasing parallelizability, depth and predictive capabilities of the neural network while reducing the dependence on randomness. For the evaluation, we approximate a set of time series from the Mackey-Glass equation, inhabiting non-chaotic as well as chaotic behavior as well as the SantaFe Laser dataset and compare our approaches in regard to their predictive capabilities to Echo State Networks, Autoencoder connected Echo State Networks and Gated Recurrent Units. For the chaotic time series, we observe an error reduction of up to $85.45\%$ compared to Echo State Networks and $90.72\%$ compared to Gated Recurrent Units. Furthermore, we also observe tremendous improvements for non-chaotic time series of up to $99.99\%$ in contrast to the existing approaches.
