.png){kind=icon}
.png){kind=icon}
Return
ReLiCADA: Reservoir Computing Using Linear Cellular Automata design algorithm
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-023-01330-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a novel algorithm to optimize the design of Reservoir Computing using Cellular Automata models for time series applications. Besides selecting the models' hyperparameters, the proposed algorithm particularly solves the open problem of Linear Cellular Automaton rule selection. The selection method pre-selects only a few promising candidate rules out of an exponentially growing rule space. When applied to relevant benchmark datasets, the selected rules achieve low errors, with the best rules being among the top 5% of the overall rule space. The algorithm was developed based on mathematical analysis of Linear Cellular Automaton properties and is backed by almost one million experiments, adding up to a computational runtime of nearly one year. Comparisons to other state-of-the-art time series models show that the proposed Reservoir Computing using Cellular Automata models have lower computational complexity and, at the same time, achieve lower errors. Hence, our approach reduces the time needed for training and hyperparameter optimization by up to several orders of magnitude.
Keywords:
Cellular Automata
Dynamical system
Edge of Chaos
Field-programmable Gate Array
Reservoir Computing
Time series prediction
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K
Organization
No organization information available