Skip navigation
PDF (970 KB)
DOI: http://dx.doi.org/10.7551/978-0-262-31050-5-ch035
Pages 259-266
First published 2 July 2012

Finding Optimal Random Boolean Networks for Reservoir Computing

David Snyder, Alireza Goudarzi, Christof Teuscher

Abstract

Reservoir Computing (RC) is a computational model in which a trained readout layer interprets the dynamics of a component called a reservoir that is excited by external input stimuli. The reservoir is often constructed using homogeneous neural networks in which a neuron's in-degree distributions as well as its functions are uniform. RC lends itself to computing with physical and biological systems. However, most such systems are not homogeneous. In this paper, we use Random Boolean Networks (RBN) to build the reservoir. We explore the computational capabilities of such a RC device using the temporal parity task and the temporal density classification. We study the sufficient dynamics of RBNs using kernel quality and generalization rank measures. We verify findings by Lizier et al. (2008) that the critical connectivity of RBNs optimizes the balance between the high memory capacity of RBNs with 〈K〉 < 2 and the higher information processing of RBNs with 〈K〉 > 2. We show that in a RBN-based RC system, the optimal connectivity for the parity task, a processing intensive task, and the density classification task, a memory intensive task, agree with Lizier et al.'s theoretical results. Our findings may contribute to the development of optimal selfassembled nanoelectronic computer architectures and biologically-inspired computing paradigms.