Tree-Based Indirect Encodings for Evolutionary Development of Neural Networks

  • Authors:
  • Jan Drchal;Miroslav Šnorek

  • Affiliations:
  • Faculty of Electrical Engineering, Department of Computer Science and Engineering, Czech Technical University, Prague, Czech Republic 121 35;Faculty of Electrical Engineering, Department of Computer Science and Engineering, Czech Technical University, Prague, Czech Republic 121 35

  • Venue:
  • ICANN '08 Proceedings of the 18th international conference on Artificial Neural Networks, Part II
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper focuses on TWEANN (Topology and Weight Evolving Artificial Neural Network) methods based on indirect developmental encodings. TWEANNs are Evolutionary Algorithms (EAs) which evolve both topology and parameters (weights) of neural networks. Indirect developmental encoding is an approach inspired by multi-cellular organisms' development from a single cell (zygote) known from Nature. The possible benefits of such encoding can be seen in Nature: for example, human genome consists of roughly 30 000 genes, which describe more than 20 billion neurons, each linked to as many as 10 000 others. In this work we examine properties of known tree-based indirect developmental encodings: Cellular Encoding and Edge Encoding. Well known Genetic Programming is usualy used to evolve tree structures. We have employed its successors: Gene Expression Programming (GEP) and Grammatical Evolution (GE) to optimize the trees. The combination of well designed developmental encoding and proper optimization method should bring compact genomes able to describe large-scale, modular neural networks. We have compared GE and GEP using a benchmark and found that GE was able to find solution about 7 times faster then GEP. On the other hand GEP solutions were more compact.