Research Article
Learning and Generalization in Random Automata Networks
@INPROCEEDINGS{10.1007/978-3-642-32615-8_19, author={Alireza Goudarzi and Christof Teuscher and Natali Gulbahce}, title={Learning and Generalization in Random Automata Networks}, proceedings={Bio-Inspired Models of Network, Information, and Computing Systems. 5th International ICST Conference, BIONETICS 2010, Boston, USA, December 1-3, 2010, Revised Selected Papers}, proceedings_a={BIONETICS}, year={2012}, month={10}, keywords={}, doi={10.1007/978-3-642-32615-8_19} }- Alireza Goudarzi
Christof Teuscher
Natali Gulbahce
Year: 2012
Learning and Generalization in Random Automata Networks
BIONETICS
Springer
DOI: 10.1007/978-3-642-32615-8_19
Abstract
It has been shown [7,6] that feedforward Boolean networks can learn to perform specific simple tasks and generalize well if only a subset of the learning examples is provided for learning. Here, we extend this body of work and show experimentally that random Boolean networks (RBNs), where both the interconnections and the Boolean transfer functions are chosen at random initially, can be evolved by using a state-topology evolution to solve simple tasks. We measure the learning and generalization performance, investigate the influence of the average node connectivity , the system size , and introduce a new measure that allows to better describe the network’s learning and generalization behavior. Our results show that networks with higher average connectivity (supercritical) achieve higher memorization and partial generalization. However, near critical connectivity, the networks show a higher perfect generalization on the even-odd task.
