Krzysztof Krawiec
PrzemysBaw Polewski
ABSTRACT
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation algorithm estimates the maximum possible gain in fitness of an individual's direct offspring. The value of the potential fitness is calculated by analyzing the context semantics and subtree semantics for all contexts (schemata) of the evaluated tree. The key feature of the proposed approach is that a tree is rewarded for the correctly classified fitness cases, but it is not penalized for the incorrectly classified ones, provided that such errors are recoverable by substitution of an appropriate subtree (which is however not explicitly considered by the algorithm). The experimental evaluation on a set of seven boolean benchmarks shows that the use of potential fitness may lead to better convergence and higher success rate of the evolutionary run.
- Koza, J. R. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992. Google Scholar
Digital Library
- Lones, M. A., and Tyrrell, A. M. Modelling biological evolvability: Implicit context and variation altering in enzyme genetic programming. BioSystems 76, 1--3 (Aug.-Oct. 2004), 229--238.Google ScholarCross Ref
- Luke, S. ECJ evolutionary computation system, 2002. (http://cs.gmu.edu/ eclab/projects/ecj/).Google Scholar
- Luke, S., and Panait, L. Lexicographic parsimony pressure. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference (New York, 9--13 July 2002), W. B. Langdon, E. Cantu-Paz, Google ScholarDigital Library
- K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska, Eds., Morgan Kaufmann Publishers, pp. 829--836.Google Scholar
- Majeed, H., and Ryan, C. A less destructive, context-aware crossover operator for GP. In Proceedings of the 9th European Conference on Genetic Programming (Budapest, Hungary, 10 -- 12 Apr. 2006) Google ScholarDigital Library
- P. Collet, M. Tomassini, M. Ebner, S. Gustafson, and A. Ekart, Eds., vol. 3905 of Lecture Notes in Computer Science, Springer, pp. 36--48.Google Scholar
- Majeed, H., Ryan, C., and Azad, R. M. A. Evaluating GP schema in context. In GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation (Washington DC, USA, 25--29 June 2005), H.-G. Beyer, U.-M. O'Reilly, D. V. Arnold, W. Banzhaf, C. Blum, E. W. Bonabeau, E. Cantu-Paz, D. Dasgupta, K. Deb, J. A. Foster, E. D. de Jong, H. Lipson, X. Llora, S. Mancoridis, M. Pelikan, G. R. Raidl, T. Soule, A. M. Tyrrell, J.-P. Watson, and E. Zitzler, Eds., vol. 2, ACM Press, pp. 1773--1774. Google ScholarDigital Library
- McPhee, N. F., Ohs, B., and Hutchison, T. Semantic building blocks in genetic programming. In Genetic Programming (2008), M. O'Neill, L. Vanneschi, S. Gustafson, A. I. E. Alcazar, I. D. Falco, A. D. Cioppa, and E. Tarantino, Eds., vol. 4971 of LNCS, Springer, pp. 134--145. Google ScholarDigital Library
- Poli, R., and Page, J. Solving high-order boolean parity problems with smooth uniform crossover, sub-machine code GP and demes. Genetic Programming and Evolvable Machines 1, 1/2 (Apr. 2000), 37--56. Google ScholarDigital Library
- Potential fitness for genetic programming
Recommendations
Fitness landscapes and problem hardness in genetic programming
GECCO '09: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking PapersThe performance of searching agents, or metaheuristics, like evolutionary algorithms (genetics algorithms, genetic programming, etc.) or local search algorithms (simulated annealing, tabu search, etc.) depend on some properties of the search space ...
Self-tuning geometric semantic Genetic Programming
The process of tuning the parameters that characterize evolutionary algorithms is difficult and can be time consuming. This paper presents a self-tuning algorithm for dynamically updating the crossover and mutation probabilities during a run of genetic ...
Segment-based genetic programming
GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computationGenetic Programming (GP) is one of the successful evolutionary computation techniques applied to solve classification problems, by searching for the best classification model applying the fitness evaluation. The fitness evaluation process greatly ...
Comments