Abstract. In this paper a new, general and exact schema theory for genetic programming is presented. The theory includes a microscopic schema theorem applicable to crossover operators which replace a subtree in one parent with a subtree from the other parent to produce the offspring. A more macroscopic schema theorem is also provided which is valid for crossover operators in which the probability of selecting any two crossover points in the parents depends only on their size and shape. The theory is based on the notions of Cartesian node reference systems and variable-arity hyperschemata both introduced here for the first time. In the paper we provide examples which show how the theory can be specialised to specific crossover operators and how it can be used to derive an exact definition of effective fitness and a size-evolution equation for GP. 1
|
4828
|
Genetic Algorithms
– Goldberg
- 1989
|
|
1827
|
Adaptation in nature and artificial system
– Holland
- 1992
|
|
1782
|
Genetic Programming: On the Programming of Computers by Means of Natural Selection Cambridge
– Koza
- 1992
|
|
157
|
Modeling genetic algorithms with Markov chains
– Nix, Vose
- 1992
|
|
153
|
A genetic algorithm tutorial
– Whitley
- 1993
|
|
149
|
Strongly typed genetic programming
– Montana
- 1995
|
|
130
|
The Simple Genetic Algorithm: Foundations and Theory
– Vose
- 1999
|
|
116
|
Foundations of Genetic Programming
– Langdon, Poli
- 2002
|
|
115
|
Complexity compression and evolution
– Nordin, Banzhaf
- 1995
|
|
90
|
A Compiling Genetic Programming System that Directly Manipulates the Machine-Code
– Nordin
- 1994
|
|
87
|
The Schema Theorem and Price’s Theorem
– Altenberg
- 1994
|
|
77
|
Explicitly defined introns and destructive crossover in genetic programming
– Nordin, Francone, et al.
- 1996
|
|
72
|
The troubling aspects of a building block hypothesis for genetic programming. Working Paper 94-02-001
– O’Reilly, Oppacher
- 1992
|
|
65
|
Analysis of genetic algorithms using statistical mechanics
– Pru¨gel-Bennett, Shapiro
- 1994
|
|
61
|
Size fair and homologous tree genetic programming crossovers. Genetic Programming and Evolvable Machines 1(1/2
– Langdon
- 2000
|
|
58
|
Analysis of complexity drift in genetic programming
– Rosca
- 1997
|
|
56
|
Accurate replication in genetic programming
– McPhee, Miller
- 1995
|
|
54
|
Schema theory for genetic programming with one-point crossover and point mutation
– Poli, Langdon
- 1998
|
|
51
|
Schemata evolution and building blocks
– Stephens, Waelbroeck
- 1999
|
|
48
|
Genetic programming and redundancy
– Blickle, Thiele
- 1994
|
|
46
|
A new schema theory for genetic programming with one-point crossover and point mutation
– Poli, Langdon
- 1997
|
|
40
|
Effective degrees of freedom in genetic algorithms and the block hypothesis
– Stephens, Waelbroeck
- 1997
|
|
39
|
Context preserving crossover in genetic programming
– D'Haeseleer
- 1994
|
|
39
|
A Markov chain framework for the simple genetic algorithm
– Davis, Principe
- 1993
|
|
37
|
C.: “Grammatical Evolution
– O’Neill, Ryan
- 2001
|
|
35
|
On the probability theory of linkage in Mendelian heredity
– Geiringer
- 1944
|
|
34
|
A schema theorem for context-free grammars
– Whigham
- 1995
|
|
27
|
Hyperschema theory for gp with one-point crossover, building blocks, and some new results in ga theory
– Poli
- 2000
|
|
27
|
Quadratic bloat in genetic programming
– Langdon
- 2000
|
|
25
|
Exact schema theorem and effective fitness for GP with one-point crossover
– Poli
- 2000
|
|
25
|
Exact schema theorems for GP with one-point and standard crossover operating on linear structures and their application to the study of the evolution of size
– Poli, McPhee
- 2001
|
|
24
|
A schema theory analysis of the evolution of size in genetic programming with linear representations
– McPhee, Poli
- 2001
|
|
22
|
Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover
– Poli
- 2001
|
|
22
|
Genetic Programming with One-Point Crossover
– Poli, Langdon
- 1997
|
|
21
|
Emergent phenomena in genetic programming
– Altenberg
- 1994
|
|
21
|
A schema theory analysis of mutation size biases in genetic programming with linear representations
– McPhee, Poli, et al.
- 2001
|
|
20
|
Search bias, language bias, and genetic programming
– Whigham
- 1996
|
|
19
|
The Schema Theorem and Price's Theorem. In: Foundations of Genetic Algorithms 3
– Altenberg
- 1995
|
|
19
|
A simple but theoretically-motivated method to control bloat in genetic programming. p. 204–217
– Poli
- 2003
|
|
17
|
Schema processing under proportional selection in the presence of random effects
– Fogel, Ghozeil
- 1997
|
|
16
|
Exact GP schema theory for headless chicken crossover and subtree mutation
– Poli, McPhee
- 2001
|
|
13
|
The schema theorem and the misallocation of trials in the presence of stochastic effects
– Fogel, Ghozeil
- 1998
|
|
12
|
Analysis of schema variance and short term extinction likelihoods
– Poli, Langdon, et al.
- 1998
|
|
12
|
Una-May O'Reilly
– Poli, Langdon
- 1998
|
|
12
|
Markov chain models for GP and variable-length GAs with homologous crossover
– Poli, Rowe, et al.
- 2001
|
|
11
|
Scaling of program tree fitness spaces
– Langdon
- 1999
|
|
11
|
Visualization of Evolutionary Algorithms - set of standard techniques and multidimensional visualization
– Pohlheim
- 1999
|
|
11
|
Exact schema theory for GP and variable-length GAs with homologous crossover
– Poli, McPhee
- 2001
|
|
10
|
Schema theorems without expectations
– Poli
- 1999
|
|
9
|
Emergent phenomena in genetic programming. In: Evolutionary Programming
– Altenberg
- 1994
|
