A novel generative encoding for evolving modular, regular and scalable networks
@inproceedings{Suchorzewski2011ANG, title={A novel generative encoding for evolving modular, regular and scalable networks}, author={Marcin Suchorzewski and Jeff Clune}, booktitle={Annual Conference on Genetic and Evolutionary Computation}, year={2011} }
In this paper we introduce the Developmental Symbolic Encoding (DSE), a new generative encoding for evolving networks (e.g. neural or boolean). DSE combines elements of two powerful generative encodings, Cellular Encoding and HyperNEAT, in order to evolve networks that are modular, regular, scale-free, and scalable. Generating networks with these properties is important because they can enhance performance and evolvability. We test DSE's ability to generate scale-free and modular networks by…
Figures and Tables from this paper
18 Citations
Evolving neural networks that are both modular and regular: HyperNEAT plus the connection cost technique
- Computer ScienceGECCO
- 2014
It is shown that adding the connection cost technique to Hyper NEAT produces neural networks that are significantly more modular, regular, and higher performing than HyperNEAT without a connection cost, even when compared to a variant of HyperNEat that was specifically designed to encourage modularity.
HyperNeat Plus the Connection Cost Technique
- Computer Science
- 2018
It is shown that adding the connection cost technique to Hyper NEAT produces neural networks that are significantly more modular, regular, and higher performing than HyperNEAT without a connection cost, even when compared to a variant of HyperNEat that was specifically designed to encourage modularity.
Critical factors in the performance of hyperNEAT
- Computer ScienceGECCO '13
- 2013
The hypothesis that fracture in the problem space, known to be challenging for regular NEAT, is even more so for HyperNEAT is examined, suggesting quite complex networks are needed to cope with fracture and Hyper NEAT can have difficulty discovering them.
Evolving programs to build artificial neural networks
- Computer Science, BiologyFrom Astrophysics to Unconventional Computation
- 2019
This chapter evolves a pair of programs that build the network, one of which runs inside neurons and allows them to move, change, die or replicate, and the other is executed inside dendrites and allowing them to change length and weight, be removed, or replicate.
Modularity in NEAT Reinforcement Learning Networks
- Computer ScienceArXiv
- 2022
It was shown that the ideal level of network modularity in the explored parameter space is highly dependent on other network variables, dispelling theories that modularity has a straightforward relationship to network performance and demonstrating that rewarding modularity directly did not improve fitness.
IMPROBED: Multiple Problem-Solving Brain via Evolved Developmental Programs
- Biology, Computer ScienceArtificial Life
- 2022
A simple neural model, called IMPROBED, is described, in which two neural programs construct an artificial brain that can simultaneously solve multiple computational problems.
Evolving Developmental Programs That Build Neural Networks for Solving Multiple Problems
- Computer Science, BiologyGPTP
- 2018
This model appears to be the first attempt to solve multiple standard classification problems using a developmental approach and can generate artificial neural networks that perform reasonably well on all three benchmark problems simultaneously.
Chapter 1 Artificial Neurogenesis : An Introduction and Selective Review
- Biology
- 2016
The hypothesis that adaptive growth is a means of producing brain-like machines is explored and a strong synergy, sometimes interchangeability, between developmental and epigenetic processes is shown—a topic that has remained largely under-explored in the literature.
Artificial Neurogenesis: An Introduction and Selective Review
- ArtGrowing Adaptive Machines
- 2014
The hypothesis that adaptive growth is a means of producing brain-like machines is explored and a strong synergy, sometimes interchangeability, between developmental and epigenetic processes is shown—a topic that has remained largely under-explored in the literature.
Solving Multiple Isolated, Interleaved, and Blended Tasks through Modular Neuroevolution
- Computer ScienceEvolutionary Computation
- 2016
Modular neuroevolution is shown to be capable of finding useful, unexpected task divisions better than those apparent to a human designer when applied to three variants of the challenging Ms. Pac-Man video game.
References
SHOWING 1-10 OF 21 REFERENCES
Evolving scalable and modular adaptive networks with Developmental Symbolic Encoding
- Computer ScienceEvol. Intell.
- 2011
A novel developmental encoding for networks, featuring scalability, modularity, regularity and hierarchy is proposed, which allows to represent structural regularities of networks and build them from encapsulated and possibly reused subnetworks.
On the Performance of Indirect Encoding Across the Continuum of Regularity
- Computer ScienceIEEE Transactions on Evolutionary Computation
- 2011
This paper presents the first comprehensive study showing that phenotypic regularity enables an indirect encoding to outperform direct encoding controls as problem regularity increases, and suggests a path forward that combines indirect encodings with a separate process of refinement.
A Hypercube-Based Encoding for Evolving Large-Scale Neural Networks
- Biology, Computer ScienceArtificial Life
- 2009
The main conclusion is that the ability to explore the space of regular connectivity patterns opens up a new class of complex high-dimensional tasks to neuroevolution.
Investigating whether hyperNEAT produces modular neural networks
- Computer ScienceGECCO '10
- 2010
The first documented case of HyperNEAT producing a modular phenotype is presented, but the inability to encourage modularity on harder problems where modularity would have been beneficial suggests that more work is needed to increase the likelihood that Hyper NEAT and similar algorithms produce modular ANNs in response to challenging, decomposable problems.
Constraining connectivity to encourage modularity in HyperNEAT
- Computer ScienceGECCO '11
- 2011
This paper investigates how altering the traditional approach to determining whether connections are expressed in HyperNEAT influences modularity, and provides an important clue to how an indirect encoding of network structure can be encouraged to evolve modularity.
A Taxonomy for Artificial Embryogeny
- BiologyArtificial Life
- 2003
This taxonomy provides a unified context for long-term research in AE, so that implementation decisions can be compared and contrasted along known dimensions in the design space of embryogenic systems, and allows predicting how the settings of various AE parameters affect the capacity to efficiently evolve complex phenotypes.
Creating High-Level Components with a Generative Representation for Body-Brain Evolution
- Computer Science, BiologyArtificial Life
- 2002
Applying GENRE to the task of evolving robots for locomotion and comparing it against a non-generative (direct) representation shows that the generative representation system rapidly produces robots with significantly greater fitness.
Generative representations for the automated design of modular physical robots
- Computer Science, BiologyIEEE Trans. Robotics Autom.
- 2003
This work demonstrates an automatic design system that produces complex robots by exploiting the principles of regularity, modularity, hierarchy, and reuse, and demonstrates for the first time the evolution and construction of modular, three-dimensional, physically locomoting robots.
Self modifying Cartesian Genetic Programming: Parity
- Computer Science2009 IEEE Congress on Evolutionary Computation
- 2009
It is shown that it is easier to solve difficult parity problems with SMCGP than either with CGP or Modular CGP, and that the increase in efficiency grows with problem size.
Measuring, enabling and comparing modularity, regularity and hierarchy in evolutionary design
- Computer ScienceGECCO '05
- 2005
This work uses an evolutionary algorithm to evolve solutions to different sizes of a table design problem using five different representations, each with different combinations of modularity, regularity and hierarchy enabled and shows that the best performance happens when all three of these attributes are enabled.