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

Citations

6071	Genetic Algorithms - Goldberg - 1989
2458	Genetic Programming: On the Programming of Computers by Means of Natural Selection - Koza - 1992
2289	Adaptation in Natural and Artificial Systems - Holland - 1975
206	Strongly typed genetic programming - Montana - 1993
193	Generalisation in genetic programming - Langdon - 2011
192	A genetic algorithm tutorial - Mitchell, Whitley - 1994
180	The Simple Genetic Algorithm: Foundations and Theory Cambridge:MIT - Vose - 1999
170	M: Modeling genetic algorithms with markov chains - Nix, Vose - 1992
137	Complexity compression and evolution - Nordin, Banzhaf - 1995
108	A compiling genetic programming system that directly manipulates the machine code - Nordin - 1994
96	Explicitly defined introns and destructive crossover in genetic programming - Nordin, Francone, et al. - 1996
87	The Schema Theorem and Price’s Theorem - Altenberg - 1995
78	The troubling aspects of a building block hypothesis for genetic programming - O'Reilly, Oppacher - 1994
75	An analysis of genetic algorithms using statistical mechanics - Prügel-Bennett, Shapiro - 1994
74	Size fair and homologous tree genetic programming crossovers. Genetic Programming And Evolvable Machines, 1(1/2):95--119 - Langdon - 2000
66	Accurate replication in genetic programming - McPhee, Miller - 1995
64	Grammatical evolution - O’Neill, Ryan - 2001
64	Analysis of complexity drift in genetic programming - Rosca - 1997
62	Genetic Programming and Redundancy - Blickle, Thiele - 1994
55	A new schema theory for genetic programming with one-point crossover and point mutation - Poli, Langdon - 1997
55	Schemata evolution and building blocks - Stephens, Waelbroeck - 1999
43	A Markov chain framework for the simple genetic algorithm - Davis, Principa - 1993
43	Effective Degrees of Freedom of Genetic Algorithms and the Block Hypothesis - Stephens, Waelbroeck - 1997
43	Context preserving crossover in genetic programming - D’haeseleer - 1994
39	A Schema Theorem for ContextFree Grammars - Whigham - 1995
37	On the probability theory of linkage in Mendelian heredity - Geiringer - 1944
36	A simple but theoretically-motivated method to control bloat in genetic programming - Poli - 2003
32	Quadratic bloat in genetic programming - Langdon - 2000
27	Exact schema theory for genetic programming and variablelength genetic algorithms with one-point crossover,” Genetic Program - Poli - 2001
26	Exact schema theorem and effective fitness for GP with one-point crossover - Poli - 2000
26	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
26	Search bias, language bias, and genetic programming - Whigham - 1996
25	Emergent phenomena in genetic programming - Altenberg - 1994
24	A schema theory analysis of the evolution of size in genetic programming with linear representations - McPhee, Poli - 2001
23	Hyperschema theory for GP with one-point crossover, building blocks, and some new results in GA theory - Poli - 2000
21	A schema theory analysis of mutation size biases in genetic programming with linear representations - McPhee, Poli, et al. - 2005
21	Genetic programming with one-point crossover - Poli, Langdon - 1997
17	Visualization of Evolutionary Algorithms - Set of Standard Techniques and Multidimensional - Pohlheim - 1999
16	Schema processing under proportional selection in the presence of random effects - Fogel, Ghozeil - 1997
16	Scaling of program tree fitness spaces - Langdon - 1999
16	Exact GP schema theory for headless chicken crossover and subtree mutation - Poli, McPhee - 2001
14	Markov chain models for GP and variable-length GAs with homologous crossover - Poli, Rowe, et al. - 2001
13	The schema theorem and the misallocation of trials in the presence of stochastic effects - Fogel, Ghozeil - 1998
13	Analysis of schema variance and short term extinction likelihoods - Poli, Langdon, et al. - 1998
11	Schema theorems without expectations - Poli - 1999
11	Exact schema theory for GP and variable-length GAs with homologous crossover - Poli, McPhee - 2001
10	Using schema theory to explore interactions of multiple operators - McPhee, Poli - 2002
10	Recursive conditional schema theorem, convergence and population sizing in genetic algorithms. Foundations of Genetic Algorithms - Poli - 2000
7	Schema processing - Radcliffe - 1997
6	A.H.: Allele diffusion in linear genetic programming and variable-length genetic algorithms with subtree crossover - Poli, Rowe, et al.