Abstract
This paper provides an empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test problem anticipated by this hypothesis. The problem is tunably difficult, but has this property because tuning is accomplished through changes in structure. Content is not involved in tuning. The results support a prediction of the hypothesis — that GP search space is significantly constrained as an outcome of structural mechanisms.
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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J.M. Daida, “Limits to Expression in Genetic Programming: Lattice-Aggregate Modeling,” in Proceedings of the 2002 Congress on Evolutionary Computation, vol. 1. Piscataway: IEEE, 2002, pp. 273–278.
J.M. Daida and A. Hilss, “Identifying Structural Mechanisms in Standard GP,” in GECCO 2003.
L. Altenberg, “Emergent Phenomena in Genetic Programming,” in Evolutionary Programming — Proceedings, A.V. Sebald and L.J. Fogal, Eds. Singapore: World Scientific Publishing, 1994, pp. 233–241.
W.A. Tackett, “Recombination, Selection and the Genetic Construction of Computer Programs,” Ph.D. Dissertation, Electrical Engineering. Los Angeles: University of Southern California, 1994.
T. Soule, et al., “Code Growth in Genetic Programming,” in GP 1996 Proceedings, J. R. Koza, et al., Eds. Cambridge: The MIT Press, 1996, pp. 215–223.
T. Soule, et al., “Using Genetic Programming to Approximate Maximum Clique,” in GP 1996 Proceedings, J.R. Koza, et al. Eds. Cambridge: The MIT Press, 1996, pp. 400–405.
T. Soule and J.A. Foster, “Code Size and Depth Flows in Genetic Programming,” in GP 1997 Proceedings, J.R. Koza, et al. Eds. San Francisco: Morgan Kaufmann Publishers, 1997, pp. 313–320.
T. Soule and J.A. Foster, “Removal Bias: A New Cause of Code Growth in Tree Based Evolutionary Programming,” in 1998 IEEE ICEC Proceeding, vol. 1. Piscataway: IEEE Press, 1998, pp. 781–786.
W.B. Langdon, “Scaling of Program Fitness Spaces,” Evolutionary Computation, vol. 7, pp. 399–428, 1999.
W.B. Langdon, “Size Fair and Homologous Tree Crossovers for Tree Genetic Programming,” GP and Evolvable Machines, vol. 1, pp. 95–119, 2000.
W.B. Langdon, et al., “The Evolution of Size and Shape,” in Advances in Genetic Programming 3, L. Spector, et al., Eds. Cambridge: The MIT Press, 1999, pp. 163–190.
W.B. Langdon, “Size Fair and Homologous Tree Genetic Programming Crossover,” in GECCO 1999 Proceeding, vol. 2, W. Banzhaf, et al., Eds. San Francisco: Morgan Kaufmann Publishers, 1999, pp. 1092–1097.
U.-M. O’Reilly and D.E. Goldberg, “How Fitness Structure Affects Subsolution Acquisition in Genetic Programming,” in GP 1998 Proceedings, J. R. Koza, et al., Eds. San Francisco: Morgan Kaufmann Publishers, 1998, pp. 269–277.
D. E. Goldberg and U.-M. O’Reilly, “Where Does the Good Stuff Go, and Why?,” in Proceedings of the First European Conference on GP, W. Banzhaf, et al., Eds. Berlin: Springer-Verlag, 1998.
W. Punch, D. Zongker, and E. Goodman, “The Royal Tree Problem, A Benchmark for Single and Multiple Population Genetic Programming,” in Advances in Genetic Programming, vol. 2, P. J. Angeline and J. K.E. Kinnear, Eds. Cambridge: The MIT Press, 1996, pp. 299–316.
W. B. Langdon and R. Poli, Foundations of Genetic Programming. Berlin: Springer-Verlag, 2002.
D. Zongker and W. Punch, “lilgp,” v. 1.02 ed. Lansing: Michigan State University Genetic Algorithms Research and Applications Group, 1995.
J. M. Daida, et al., “Analysis of Single-Node (Building) Blocks in Genetic Programming,” in Advances in Genetic Programming 3, L. Spector, et al., Eds. Cambridge: The MIT Press, 1999, pp. 217–241.
M. Matsumoto and T. Nishimura, “Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudorandom Number Generator,” ACM Transactions on Modeling and Computer Simulation, vol. 8, pp. 3–30, 1998.
J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge: The MIT Press, 1992.
O. A. Chaudhri, et al., “Characterizing a Tunably Difficult Problem in Genetic Programming,” in GECCO 2000 Proceedings, L. D. Whitley, et al., Eds. San Francisco: Morgan Kaufmann Publishers, 2000, pp. 395–402.
J. M. Daida, et al., “What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming,” Journal of GP and Evolvable Hardware, vol. 2, pp. 165–191, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daida, J.M., Li, H., Tang, R., Hilss, A.M. (2003). What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_60
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive