On the performance effects of unbiased module encapsulation

  title={On the performance effects of unbiased module encapsulation},
  author={R. Paul Wiegand and Gautham Anil and Ivan I. Garibay and Ozlem O. Garibay and Annie S. Wu},
  journal={Proceedings of the 11th Annual conference on Genetic and evolutionary computation},
  • R. P. Wiegand, G. Anil, +2 authors A. Wu
  • Published 8 July 2009
  • Computer Science
  • Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and empirical investigations were used to connect formal results to performance. Here we replace this experimentation with an introductory runtime analysis of performance. We study a base-line, unbiased modularization that makes use of a complete module set (CMS), with special focus on strings that grow logarithmically with… 
Tag-based modules in genetic programming
It is demonstrated that tag-based modules readily evolve and that this allows problem solving effort to scale well with problem size and is effective even in complex, non-uniform problem environments for which previous techniques perform poorly.
Constraining connectivity to encourage modularity in HyperNEAT
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.
Effective Task Transfer Through Indirect Encoding
This dissertation demonstrates how the Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) approach evolves an indirect encoding, which compresses the representation by exploiting its geometry, and explores further exploiting the power of such encoding.
The Effect of Connection Cost on Modularity in Evolved Neural Networks
It is found that adding a small fitness cost for each connection between neurons does not increase the modularity of the best network produced by each run of the NEAT neuroevolution algorithm, but that it does lead to increased consistency in the level of modularity produced by the algorithm.
Teaching simulated biped robots to walk is a popular problem in machine learning. However, until this thesis, evolving a biped controller has not been attempted through an indirect encoding, i.e. a


Effects of Module Encapsulation in Repetitively Modular Genotypes on the Search Space
It is proved, under a set of assumptions, that the systematic encapsulation of lower order modules into higher order modules does not change the size or bias of a search space and that this process produces a hierarchy of equivalent search spaces.
Analyzing the effects of modularity on search spaces
We are continuously challenged by ever increasing problem complexity and the need to develop algorithms that can solve complex problems and solve them within a reasonable amount of time. Modularity
Analyzing the effects of module encapsulation on search space bias
The effects of modular representations on the search space bias are analyzed and it is shown that the use of modularity improves performance and scalability of evolutionary algorithms for certain applications.
The Modular Genetic Algorithm: Exploiting Regularities in the Problem Space
A limited version of the modular genetic algorithm is compared with a canonical genetic algorithm applied to the checkerboard-pattern discovery problem and it is observed that the MGA significantly outperforms the GA for high complexities.
Compact Genetic Codes as a Search Strategy of Evolutionary Processes
The core result is a relation between the Kullback-Leibler divergence and the description length of the encoding in the specific scenario, stating that compact codes provide a way to minimize this divergence.
Bridging the Gap Between Theory and Practice
It is believed that providing theorists with empirical studies that are well-suited for formal analysis will help bridge the gap between theory and practice, benefitting the empiricist, the theorist, and the community at large.
Defining Modularity , Hierarchy , and Repetition
In order to benefit from the presence of modularity, hierarchy, or repetition in a problem, a necessary first step is to identify precise notions of these problem features. Modularity, hierarchy, and
Measuring, enabling and comparing modularity, regularity and hierarchy in evolutionary design
  • G. Hornby
  • Mathematics, Computer Science
    GECCO '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.
Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results
This paper presents a survey of the results obtained in the last decade along computational time complexity analyzes of evolutionary algorithms, and the most common mathematical techniques are introduced.
Fitness Distance Correlation Analysis: An Instructive Counterexample
The suspicion that predictors for genetic algorithm performance are vulnerable if they are based on arbitrary properties of the search space, and not the actual dynamics of the genetic algorithm, is confirmed by a counterexample to Hamming-distance based FDC.