The Troubling Aspects of a Building Block Hypothesis for Genetic Programming

https://doi.org/10.1016/B978-1-55860-356-1.50008-XGet rights and content

Abstract

In this paper we carefully formulate a Schema Theorem for Genetic Programming (GP) using a schema definition that accounts for the variable length and the non-homologous nature of GP's representation. In a manner similar to early GA research, we use interpretations of our GP Schema Theorem to obtain a GP Building Block definition and to state a “classical” Building Block Hypothesis (BBH): that GP searches by hierarchically combining building blocks. We report that this approach is not convincing for several reasons: it is difficult to find support for the promotion and combination of building blocks solely by rigourous interpretation of a GP Schema Theorem; even if there were such support for a BBH, it is empirically questionable whether building blocks always exist because partial solutions of consistently above average fitness and resilience to disruption are not assured; also, a BBH constitutes a narrow and imprecise account of GP search behavior.

References (16)

  • AltenbergL.

    The evolution of evolvability in genetic programming

  • Altenberg, L. (1994). The Schema Theorem and Price's Theorem. In these...
  • ForrestS. et al.

    Relative building-block fitness and the building block hypothesis

  • Grefenstette, J. J. and J. E. Baker (1989). How genetic algorithms work: a critical look at implicit parallelism. In...
  • GrefenstetteJ.J.

    Deception Considered Harmful

  • GoldbergD.E.

    Genetic Algorithms in Search, Optimization, and Machine Learning

    (1989)
  • HollandJ.H.

    Adaptation in Natural and Artificial Systems

    (1975/1992)
  • KozaJ.R.

    Genetic Programming; On the Programming of Computers by Means of Natural Selection

    (1992)
There are more references available in the full text version of this article.

Cited by (0)

View full text