Roberts, Ian and Hunter, Andrew (1999) Evolving neural networks using matrix grammars. Project Report. University of Sunderland, Sunderland. (Unpublished)

PDF Evolving_Neural_Networks_Using_Matrix_Grammars_-_AH.pdf - Whole Document Restricted to Repository staff only Download (3513Kb) | Request a copy

Abstract

Methods of evolving Neural Networks using Matrix Grammars are described. Because these methods generate network architectures structurally, reusing symbols to describe sub-sections of the architecture, they tend to produce well-structured networks and are suitable for similarly well-structured problems. Methods which generate the architecture only, and methods which also generate weights, are described. Evolution is combined with backpropagation training. The techniques are compared with previously published work, and show several distinct advantages. The main advantage of all the methods is the ability to overcome the Genetic Algorithm scaling problem. The inclusion of weights gives better convergence. The Matrix Grammars presented here further separate the evolution of weights and architecture than previous methods, widening the search-space. The suitability of the techniques for more substantial problems is discussed. We also show how large improvements can be achieved by progressive evolution: the pretraining of the population on related, simpler problems.

Item Type:	Monograph (Project Report)
Additional Information:	Methods of evolving Neural Networks using Matrix Grammars are described. Because these methods generate network architectures structurally, reusing symbols to describe sub-sections of the architecture, they tend to produce well-structured networks and are suitable for similarly well-structured problems. Methods which generate the architecture only, and methods which also generate weights, are described. Evolution is combined with backpropagation training. The techniques are compared with previously published work, and show several distinct advantages. The main advantage of all the methods is the ability to overcome the Genetic Algorithm scaling problem. The inclusion of weights gives better convergence. The Matrix Grammars presented here further separate the evolution of weights and architecture than previous methods, widening the search-space. The suitability of the techniques for more substantial problems is discussed. We also show how large improvements can be achieved by progressive evolution: the pretraining of the population on related, simpler problems.
Keywords:	Neural networks, Matrix grammars, Network architectures
Subjects:	G Mathematical and Computer Sciences > G400 Computer Science
Divisions:	College of Sciences > Faculty of Science > Lincoln School of Computer Science
Depositing User:	Tammie Farley
Date Deposited:	26 Sep 2010 16:44
Last Modified:	13 Mar 2013 08:47
URI:	http://eprints.lincoln.ac.uk/id/eprint/3387

Actions (login required)

View Item