A schema-based version of geiringer's theorem for nonlinear genetic programming with homologous crossover

Authors:
Boris Mitavskiy;Jonathan E. Rowe
Affiliations:
School of Computer Science, University of Birmingham, Birmingham, UK;School of Computer Science, University of Birmingham, Birmingham, UK
Venue:
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Year:
2005

Citing 11
Cited 7

Convergence rates for Markov chains

SIAM Review
A computational view of population genetics

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Theory of genetic algorithms

Theoretical Computer Science
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Group properties of crossover and mutation

Evolutionary Computation
Hyperschema Theory for GP with One-Point Crossover, Building Blocks, and Some New Results in GA Theory

Proceedings of the European Conference on Genetic Programming
Theory of genetic algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling

Theoretical Computer Science
Structural Search Spaces and Genetic Operators

Evolutionary Computation
Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms

Evolutionary Computation
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms.

Evolutionary Computation
Comparing evolutionary computation techniques via their representation

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

Understanding the Biases of Generalised Recombination: Part II

Evolutionary Computation
Quotients of Markov chains and asymptotic properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm

Genetic Programming and Evolvable Machines
Estimating the ratios of the stationary distribution values for markov chains modeling evolutionary algorithms

Evolutionary Computation
The halting probability in von neumann architectures

EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Exploiting quotients of markov chains to derive properties of the stationary distribution of the markov chain associated to an evolutionary algorithm

SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
A further generalization of the finite-population geiringer-like theorem for pomdps to allow recombination overarbitrary set covers

Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Geiringer's theorem is a statement which tells us something about the limiting frequency of occurrence of a certain individual when a classical genetic algorithm is executed in the absence of selection and mutation. Recently Poli, Stephens, Wright and Rowe extended the original theorem of Geiringer to include the case of variable length genetic algorithms and linear genetic programming. In the current paper a rather powerful version of Geiringer's theorem which has been established recently by Mitavskiy is used to derive a schema-based version of the theorem for nonlinear genetic programming with homologous crossover.