Fast Parameter Optimization of Delayed Feedback Reservoir with Backpropagation and Gradient Descent
Sosei Ikeda, Hiromitsu Awano, Takashi Sato
TL;DR
This work tackles the slow offline hyperparameter tuning of delayed feedback reservoirs (DFRs) by introducing a backpropagation-based optimization framework built on a modular DFR. By decomposing the nonlinear element into blocks and learning the two scalars $A$ and $B$ alongside the output regularization, the approach enables fast, online adaptation with gradient descent and a truncated backpropagation strategy to curb memory usage. The authors demonstrate that their method achieves comparable or superior accuracy to grid search while reducing computation time by up to about 700x and cutting memory by roughly half in many cases. The practical impact is enabling scalable, hardware-friendly reservoir learning with online capabilities for time-series classification tasks.
Abstract
A delayed feedback reservoir (DFR) is a reservoir computing system well-suited for hardware implementations. However, achieving high accuracy in DFRs depends heavily on selecting appropriate hyperparameters. Conventionally, due to the presence of a non-linear circuit block in the DFR, the grid search has only been the preferred method, which is computationally intensive and time-consuming and thus performed offline. This paper presents a fast and accurate parameter optimization method for DFRs. To this end, we leverage the well-known backpropagation and gradient descent framework with the state-of-the-art DFR model for the first time to facilitate parameter optimization. We further propose a truncated backpropagation strategy applicable to the recursive dot-product reservoir representation to achieve the highest accuracy with reduced memory usage. With the proposed lightweight implementation, the computation time has been significantly reduced by up to 1/700 of the grid search.
