Abstract
Ordinarily, Genetic Programming uses little or no mutation. Crossover is the predominant operator. This study tests the effect of a very aggressive use of the mutation operator on the generalization performance of our Compiling Genetic Programming System (‘CPGS’). We ran our tests on two benchmark classification problems on very sparse training sets. In all, we performed 240 complete runs of population 3000 for each of the problems, varying mutation rate between 5% and 80%. We found that increasing the mutation rate can significantly improve the generalization capabilities of GP. The mechanism by which mutation affects the generalization capability of GP is not entirely clear. What is clear is that changing the balance between mutation and crossover effects the course of GP training substantially — for example, increasing mutation greatly extends the number of generations for which the GP system can train before the population converges.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
T. Bäck: Optimal Mutation Rates in Genetic Search. In: S. Forrest (Ed.): Proc. 5th Int. Conference on Genetic Algorithms, ICGA-93. San Mateo: Morgan Kaufmann 1993
D. Fogel, L. Stayton: On the Effectiveness of Crossover in Simulated Evolutionary Optimization. Biosystems 32 171–182 (1994)
D. Goldberg: Genetic Algorithms in Search Optimization & Learning, Reading: Addison-Wesley 1989
J.R. Koza: Genetic Programming. Cambridge (USA): MIT Press 1992
K. Lang: Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis Problem of Koza's. In: A. Prieditis, S. Russell (Eds.): Proc. 12th Int. Conference on Machine Learning. San Mateo: Morgan Kaufmann 1995
T. Masters: Advanced Algorithms for Neural Networks. New York: Wiley 1995
J.P. Nordin, J.P.: A Compiling Genetic Programming System that Directly Manipulates the Machine Code. In: K. Kinnear, Jr. (ed.). Advances in Genetic Programming. Cambridge MA: MIT Press 1994
J.P. Nordin, W. Banzhaf: Complexity Compression and Evolution. In:L. Eshelman (Ed.): Proc. 6th Int. Conference on Genetic Algorithms, ICGA-95. San Mateo: Morgan Kaufmann 1995
J.P. Nordin, W. Banzhaf: Evolving Turing Complete Programs for a Register Machine with Self Modifying Code. In: L. Eshelman (Ed.): Proc. 6th Int. Conference on Genetic Algorithms, ICGA-95. San Mateo: Morgan Kaufmann 1995
J.P. Nordin, F.D. Francone, W. Banzhaf: Explicitly Defined Introns and Destructive Crossover in Genetic Programming. In: K. Kinnear, Jr., P. Angeline (eds.): Advances in Genetic Programming 2. Cambridge MA: MIT Press 1996, in press
I. Rechenberg: Evolutionsstrategie 94. Stuttgart: Holzmann-Froboog 1994 (2nd. ed.)
H.P. Schwefel: Evolution and Optimum Seeking. New York: Wiley 1995 (2nd. ed.)
The ELENA Partners: C. Jutten, Project Coordinator: ESPRIT Basic Research Project Number 6891, Document Number R3-B1-P. Available via ftp at either ics.uci.edu or at satie.dice.ucl.ac.be, 1995
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Banzhaf, W., Francone, F.D., Nordin, P. (1996). The effect of extensive use of the mutation operator on generalization in genetic programming using sparse data sets. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_994
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_994
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61723-5
Online ISBN: 978-3-540-70668-7
eBook Packages: Springer Book Archive