Sciweavers

Share
GECCO
2004
Springer

Shortcomings with Tree-Structured Edge Encodings for Neural Networks

10 years 3 days ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties in specifying edge weights and these operators are execution-order dependent, an alternative is to use edge operators. Here we identify three problems with edge operators: in the initialization phase most randomly created genotypes produce an incorrect number of inputs and outputs; variation operators can easily change the number of input/output (I/O) units; and units have a connectivity bias based on their order of creation. Instead of creating I/O nodes as part of the construction process we propose using parameterized operators to connect to pre-existing I/O units. Results from experiments show that these parameterized operators greatly improve the probability of creating and maintaining networks with the correct number of I/O units, remove the connectivity bias with I/O units and produce better controlle...
Gregory Hornby
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where GECCO
Authors Gregory Hornby
Comments (0)
books