More on Computational Effort Statistics for Genetic Programming
In this contribution we take a look at the computational effort statistics as described by Koza. We transfer the notion from generational genetic programming to tournament-selection (steady-state) GP and show why, in both cases, the measured value of the effort often differs from its theoretical counterpart. It is discussed how systematic estimation errors are introduced by a low number of experiments. Two reasons examined are the number of unsuccessful experiments and the variation in the number of fitness evaluations necessary to find a solution among the successful experiments.
Unable to display preview. Download preview PDF.
- 2.S. Christensen and F. Oppacher: An Analysis of Koza’s Computational Effort Statistic for Genetic In: J. A. Foster, E. Lutton, J. Miller, C. Ryan, and A. G. B. Tettamanzi,(eds.), Proceedings of the 5th European Conference on Genetic Programming, EuroGP 2002, volume 2278 of LNCS, Kinsale, Ireland, 3–5 April 2002. Springer-Verlag, pages 182–191Google Scholar
- 3.M. Keijzer, et al: Adaptive Logic Programming. In: Spector, L., et al (eds.): Proceedings of the 2001 Genetic and Evolutionary Computation Conference: GECCO 2001, Morgan Kaufmann, pages 42–49Google Scholar
- 5.S. Luke and L. Panait: Is the Perfect the Enemy of the Good? In: W. B. Langdon et al. (eds.), Proceedings of the 2002 Genetic and Evolutionary Computation Conference: GECCO 2002, Morgan Kaufman, pages 820–828Google Scholar