Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Automatic definition of modular neural networks
Adaptive Behavior
Neuroanatomy in a computational perspective
The handbook of brain theory and neural networks
Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
On Intelligence
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Simdist: a distribution system for easy parallelization of evolutionary computation
Genetic Programming and Evolvable Machines
| Hi-index | 0.00 |
Modularity is an omnipresent feature of biological neural networks. It is also a cornerstone of indirect genetic encodings and developmental evolutionary algorithms for neural networks. Modularity may give evolution the ability to reflect regularities in the environment in its solutions, thus making good solutions easier to find. Furthermore, it has been proposed that the density of highly fit solutions is higher in modular networks than in non-modular networks. In this paper we investigate how the degree of modularity in neural networks affects the search landscape for neuroevolution. We use multi-objective evolution to explicitly guide evolution towards modular and non-modular areas of network search space. We find that the fitness landscape is radically different in these different areas, but that network modularity is not accompanied by increased efficiency on a modular classification task. We therefore cannot find support for the popular assumption that modular networks are "better" than non-modular networks.