When is Reservoir Computing with Cellular Automata Beneficial?
摘要
Reservoir Computing with Cellular Automata (ReCA) is a relatively novel and promising approach. It consists of 3 steps: encoding the problem into the CA, the CA iterations step, and a simple classifying step. This paper demonstrates that the ReCA concept is effective even in arguably the simplest implementation of a ReCA system. However, we also report a failed attempt on the UCR Time Series Classification Archive where ReCA seems to work, but only because of the encoding scheme, not the CA. This highlights the need for ablation testing, i.e., comparing internally without sub-parts of one model, but also raises an open question on what kind of tasks ReCA is best suited for.