An improved representation for evolving programs

Withall, Mark S.; Hinde, Chris J.; Stone, Roger G.

doi:10.1007/s10710-008-9069-7

Cited by 7 publications

(1 citation statement)

References 19 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most recent work on evolving sorting algorithms is that of Withall et al [72]. They developed a new GP representation, comprising fixed-length blocks of genes, representing single program statements.…”

Section: Related Work On Evolutionary Algorithm Designmentioning

confidence: 99%

Have your spaghetti and eat it too: evolutionary algorithmics and post-evolutionary analysis

Wolfson

Zakov

Sipper

et al. 2010

Genet Program Evolvable Mach

View full text Add to dashboard Cite

This paper focuses on two issues, first perusing the idea of algorithmic design through genetic programming (GP), and, second, introducing a novel approach for analyzing and understanding the evolved solution trees. Considering the problem of list search, we evolve iterative algorithms for searching for a given key in an array of integers, showing that both correct linear-time and far more efficient logarithmic-time algorithms can be repeatedly designed by Darwinian means. Next, we turn to the (evolved) dish of spaghetti (code) served by GP. Faced with the all-too-familiar conundrum of understanding convoluted-and usually bloated-GP-evolved trees, we present a novel analysis approach, based on ideas borrowed from the field of bioinformatics. Our system, dubbed G-PEA (GP PostEvolutionary Analysis), consists of two parts: (1) Defining a functionality-based similarity score between expressions, G-PEA uses this score to find subtrees that carry out similar semantic tasks; (2) Clustering similar sub-expressions from a number of independently evolved fit solutions, thus identifying important semantic building blocks ensconced within the hard-to-read GP trees. These blocks help identify the important parts of the evolved solutions and are a crucial step in understanding how they work. Other related GP aspects, such as code simplification, bloat control, and building-block preserving crossover, may be extended by applying the concepts we present.

show abstract

Section: Related Work On Evolutionary Algorithm Designmentioning

confidence: 99%