102 research outputs found
Artificial evolution with Binary Decision Diagrams: a study in evolvability in neutral spaces
This thesis develops a new approach to evolving Binary Decision Diagrams, and uses it to study evolvability issues. For reasons that are not yet fully understood, current approaches to artificial evolution fail to exhibit the evolvability so readily exhibited in nature. To be able to apply evolvability to artificial evolution the field must first understand and characterise it; this will then lead to systems which are much more capable than they are currently. An experimental approach is taken. Carefully crafted, controlled experiments elucidate the mechanisms and properties that facilitate evolvability, focusing on the roles and interplay between neutrality, modularity, gradualism, robustness and diversity. Evolvability is found to emerge under gradual evolution as a biased distribution of functionality within the genotype-phenotype map, which serves to direct phenotypic variation. Neutrality facilitates fitness-conserving exploration, completely alleviating local optima. Population diversity, in conjunction with neutrality, is shown to facilitate the evolution of evolvability. The search is robust, scalable, and insensitive to the absence of initial diversity. The thesis concludes that gradual evolution in a search space that is free of local optima by way of neutrality can be a viable alternative to problematic evolution on multi-modal landscapes
Evolvability and redundancy in shared grammar evolution
Los Alamitos, C
Online Diversity Control in Symbolic Regression via a Fast Hash-based Tree Similarity Measure
Diversity represents an important aspect of genetic programming, being
directly correlated with search performance. When considered at the genotype
level, diversity often requires expensive tree distance measures which have a
negative impact on the algorithm's runtime performance. In this work we
introduce a fast, hash-based tree distance measure to massively speed-up the
calculation of population diversity during the algorithmic run. We combine this
measure with the standard GA and the NSGA-II genetic algorithms to steer the
search towards higher diversity. We validate the approach on a collection of
benchmark problems for symbolic regression where our method consistently
outperforms the standard GA as well as NSGA-II configurations with different
secondary objectives.Comment: 8 pages, conference, submitted to congress on evolutionary
computatio
Long-Term Evolution Experiment with Genetic Programming
We evolve floating point Sextic polynomial populations of genetic programming binary trees for up to a million generations. We observe continued innovation but this is limited by tree depth. We suggest that deep expressions are resilient to learning as they disperse information, impeding evolvability, and the adaptation of highly nested organisms, and we argue instead for open complexity. Programs with more than 2,000,000,000 instructions (depth 20,000) are created by crossover. To support unbounded long-term evolution experiments in genetic programming (GP), we use incremental fitness evaluation and both SIMD parallel AVX 512-bit instructions and 16 threads to yield performance equivalent to 1.1 trillion GP operations per second, 1.1 tera GPops, on an Intel Xeon Gold 6136 CPU 3.00GHz server
Recommended from our members
Meta-parametric design
Parametric modelling software often maintains an explicit history of design development in the form of a graph. However, as the graph increases in complexity it quickly becomes inflexible and unsuitable for exploring a wide design space. By contrast, implicit low-level rule systems can offer wide design exploration due to their lack of structure, but often act as black boxes to human observers with only initial conditions and final designs cognisable. In response to these two extremes, the authors propose a new approach called Meta-Parametric Design, combining graph-based parametric modelling with genetic programming. The advantages of this approach are demonstrated using two real case-study projects that widen design exploration whilst maintaining the benefits of a graph representation
Package Evolvability and its Relationship with Refactoring
In this paper, we address a set of research questions investigating trends in changes to an open-source system (OSS). An interesting âpeak and troughâ effect trend was found to exist in the system studied, suggesting that developer activity comprises of a set of high and low periods. Trends in overall changes applied to the system were complemented with empirical evidence in refactoring data for the same system; this showed a similar peak and trough effect but at different versions of the same system. This result suggests a contrasting motivation between regular maintenance practice and that of refactoring. Our analysis of high-level package trends informed some interesting cross-comparisons with refactoring practice, and some insights into why refactoring might be applied after a burst of regular change activity, rather than consistently. We use data extracted from seven Java OSS as a basis for our refactoring analysis
Generalized disjunction decomposition for evolvable hardware
Evolvable hardware (EHW) refers to self-reconfiguration hardware design, where the configuration is under the control of an evolutionary algorithm (EA). One of the main difficulties in using EHW to solve real-world problems is scalability, which limits the size of the circuit that may be evolved. This paper outlines a new type of decomposition strategy for EHW, the “generalized disjunction decomposition” (GDD), which allows the evolution of large circuits. The proposed method has been extensively tested, not only with multipliers and parity bit problems traditionally used in the EHW community, but also with logic circuits taken from the Microelectronics Center of North Carolina (MCNC) benchmark library and randomly generated circuits. In order to achieve statistically relevant results, each analyzed logic circuit has been evolved 100 times, and the average of these results is presented and compared with other EHW techniques. This approach is necessary because of the probabilistic nature of EA; the same logic circuit may not be solved in the same way if tested several times. The proposed method has been examined in an extrinsic EHW system using theevolution strategy. The results obtained demonstrate that GDD significantly improves the evolution of logic circuits in terms of the number of generations, reduces computational time as it is able to reduce the required time for a single iteration of the EA, and enables the evolution of larger circuits never before evolved. In addition to the proposed method, a short overview of EHW systems together with the most recent applications in electrical circuit design is provided
Modelling evolvability in genetic programming
We develop a tree-based genetic programming system, capable of modelling evolvability during evolution through artificial neural networks (ANN) and exploiting
those networks to increase the generational fitness of the system. This thesis is empirically focused; we study the effects of evolvability selection under varying conditions
to demonstrate the effectiveness of evolvability selection. Evolvability is the capacity of an individual to improve its future fitness. In genetic programming (GP), we
typically measure how well a program performs a given task at its current capacity
only. We improve upon GP by directly selecting for evolvability. We construct a
system, Sample-Evolvability Genetic Programming (SEGP), that estimates the true
evolvability of a program by conducting a limited number of evolvability samples.
Evolvability is sampled by conducting a number of genetic operations upon a program and comparing the fitnesses of resulting programs with the original. SEGP is
able to achieve an increase in fitness at a cost of increased computational complexity.
We then construct a system which improves upon SEGP, Model-Evolvability Genetic
Programming (MEGP), that models the true evolvability of a program by training
an ANN to predict its evolvability. MEGP reduces the computational cost of sampling evolvability while maintaining the fitness gains. MEGP is empirically shown
to improve generational fitness for a streaming domain, in exchange for an upfront
increase in computational time
- …