Abstract
Two main weaknesses of GA and GP schema theorems are that they provide only information on the expected value of the number of instances of a given schema at the next generation E[m(H,t + 1)], and they can only give a lower bound for such a quantity. This paper presents new theoretical results on GP and GA schemata which largely overcome these weaknesses. Firstly, unlike previous results which concentrated on schema survival and disruption, our results extend to GP recent work on GA theory by Stephens and Waelbroeck, and make the effects and the mechanisms of schema creation explicit. This allows us to give an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. Thanks to this formulation we are then able to provide in improved version for an earlier GP schema theorem in which some schema creation events are accounted for, thus obtaining a tighter bound for E[m(H, t + 1)]. This bound is a function of the selection probabilities of the schema itself and of a set of lower-order schemata which one-point crossover uses to build instances of the schema. This result supports the existence of building blocks in GP which, however, are not necessarily all short, low-order or highly fit. Building on earlier work, we show how Stephens and Waelbroeck’s GA results and the new GP results described in the paper can be used to evaluate schema variance, signal-to-noise ratio and, in general, the probability distribution of m(H, t + 1). In addition, we show how the expectation operator can be removed from the schema theorem so as to predict with a known probability whether m(H, t + 1) (rather than E[m(H, t + 1)]) is going to be above a given threshold.
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
Holland, J.: Adaptation in Natural and Artificial Systems, 2nd edn. MIT Press, Cambridge (1992)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Poli, R., Langdon, W.B.: A new schema theory for genetic programming with one-point crossover and point mutation. In: Koza, J. R., Deb, K., Dorigo, M., Fogel, D. B., Garzon, M., Iba, H., Riolo, R. L. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, Stanford University, CA. USA, July 13-16, pp. 278–285. Morgan Kaufmann, San Francisco (1997)
Poli, R., Langdon, W.B.: Schema theory for genetic programming with one-point crossover and point mutation. Evolutionary Computation 6(3), 231–252 (1998)
Rosea, J.P.: Analysis of complexity drift in genetic programming. In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M., Iba, H., Riolo, R.L. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, Stanford University, CA, USA, July 13-16, pp. 286–294. Morgan Kaufmann, San Francisco (1997)
Altenberg, L.: The Schema Theorem and Price’s Theorem. In: Whitley, L.D., Vose, M.D. (eds.) Foundations of Genetic Algorithms, Estes Park, Colorado, USA, 31 July - 2 August 1994, vol. 3, pp. 23–49. Morgan Kaufmann, San Francisco (1995)
Macready, W.G., Wolpert, D.H.: On 2-armed gaussian bandits and optimization. In: Sante Fe Institute Working Paper 96-05-009 (March 1996)
Fogel, D.B., Ghozeil, A.: Schema processing under proportional selection in the presence of random effects. IEEE Transactions on Evolutionary Computation 1(4), 290–293 (1997)
Fogel, D.B., Ghozeil, A.: The schema theorem and the misallocation of trials in the presence of stochastic effects. In: Porto, D.W.V.W., Saravanan, N., Eiben, A. (eds.) Evolutionary Programming VII: Proc. of the 7th Ann. Conf. on Evolutionary Programming, pp. 313–321 (1998)
Nix, A.E., Vose, M.D.: Modeling genetic algorithms with markov chains. Annals of Mathematics and Artificial Intelligence 5, 79–88 (1992)
Davis, T.E., Principe, J.C.: A markov chain framework for the simple genetic algorithm. Evolutionary Computation 1(3), 269–288 (1993)
Rudolph, G.: Stochastic processes. In: Baeck, T., Fogel, D.B., Michalewicz, Z. (eds.) Handbook of Evolutionary Computation, pp. B2.2-1-8. Oxford University Press, Oxford (1997)
Rudolph, G.: Genetic algorithms. In: Baeck, T., Fogel, D.B., Michalewicz, Z. (eds.) Handbook of Evolutionary Computation, pp. B2.4-20-27. Oxford University Press, Oxford (1997)
Rudolph, G.: Convergence analysis of canonical genetic algorithm. IEEE Transactions on Neural Networks 5(1), 96–101 (1994)
Rudolph, G.: Modees of stochastic convergence. In: Baeck, T., Fogel, D.B., Michalewicz, Z. (eds.) Handbook of Evolutionary Computation, pp. B2.3-1-3. Oxford University Press, Oxford (1997)
Radcliffe, N.J.: Schema processing. In: Baeck, T., Fogel, D.B., Michalewicz, Z. (eds.) Handbook of Evolutionary Computation, pp. B2.5-1-10. Oxford University Press, Oxford (1997)
Stephens, C.R., Waelbroeck, H.: Effective degrees of freedom in genetic algorithms and the block hypothesis. In: Bäck, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA 1997). Morgan Kaufmann, San Francisco (1997) (East Lansing)
Stephens, C.R., Waelbroeck, H.: Schemata evolution and building blocks. Evolutionary Computation 7(2), 109–124 (1999)
Poli, R.: Probabilistic schema theorems without expectation, left-to-right convergence and population sizing in genetic algorithms, Tech. Rep. CSRP-99-3, University of Birmingham, School of Computer Science (January 1999)
Poli, R.: Schema theorems without expectations. In: Banzhaf, W., Daida, J., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M., Smith, R.E. (eds.) GECCO 1999: Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida, USA. Morgan Kaufmann, San Francisco (1999) (forthcoming)
Poli, R.: Schema theory without expectations for GP and GAs with one-point crossover in the presence of schema creation. In: Haynes, T., Langdon, W.B., O’Reilly, U.-M., Poli, R., Rosea, J. (eds.) Foundations of Genetic Programming, Orlando, Florida, USA, 13 July (1999)
Whitley, D.: A genetic algorithm tutorial,Tech. Rep. CS-93-103, Department of Computer Science, Colorado State University (August 1993)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
O’Reilly, U.-M.: An Analysis of Genetic Programming. PhD thesis, Carleton University, Ottawa-Carleton Institute for Computer Science, Ottawa, Ontario, Canada, 22 September (1995)
O’Reilly, U.-M., Oppacher, F.: The troubling aspects of a building block hypothesis for genetic programming. In: Whitley, L.D., Vose, M.D. (eds.) Foundations of Genetic Algorithms, Estes Park, Colorado, USA, 31 July-2 August 1994, vol. 3, pp. 73–88. Morgan Kaufmann, San Francisco (1995)
Whigham, P.A.: A schema theorem for context-free grammars. In: 1995 IEEE Conference on Evolutionary Computation, Perth, Australia, vol. 1, pp. 178–181. IEEE Press, Los Alamitos (1995)
Whigham, P.A.: Grammatical Bias for Evolutionary Learning. PhD thesis, School of Computer Science, University College, University of New South Wales, Australian Defence Force Academy, October 14 (1996)
Poli, R., Langdon, W.B.: An experimental analysis of schema creation, propagation and disruption in genetic programming. In: Back, T. (ed.) Genetic Algorithms: Proceedings of the Seventh International Conference, Michigan State University, East Lansing, MI, USA, pp. 18–25. Morgan Kaufmann, San Francisco (1997)
Poli, R., Langdon, W.B., O’Reilly, U.-M.: Analysis of schema variance and short term extinction likelihoods. In: Koza, J.R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M.H., Goldberg, D.E., Iba, H., Riolo, R. (eds.) Genetic Programming 1998: Proceedings of the Third Annual Conference, University of Wisconsin, Madison, Wisconsin, USA, pp. 284–292. Morgan Kaufmann, San Francisco (1998)
Whitley, D.: An executable model of a simple genetic algorithm. In: Whitley, D. (ed.) Foundations of Genetic Algorithms Workshop (FOGA 1992), Vail, Colorado (July 1992)
Nordin, P., Banzhaf, W.: Complexity compression and evolution. In: Es-helman, L. (ed.) Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA 1995), Pittsburgh, PA, USA, pp. 310–317. Morgan Kaufmann, San Francisco (1995)
Nordin, P., Francone, F., Banzhaf, W.: Explicitly defined introns and destructive crossover in genetic programming. In: Rosea, J.P. (ed.) Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, Tahoe City, California, USA, July 9, pp. 6–22 (1995)
Nordin, P., Francone, F., Banzhaf, W.: Explicitly defined introns and destructive crossover in genetic programming. In: Angeline, P.J., Kinnear Jr., K.E. (eds.) Advances in Genetic Programming, ch. 6, vol. 2, pp. 111–134. MIT Press, Cambridge (1996)
Grefenstette, J.J.: Deception considered harmful. In: FOGA 1992, Foundations of Genetic Algorithms, Vail, Colorado, July 24-29 (1992), Email: gref@aic.nrl.navy.mil
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poli, R. (2000). Hyperschema Theory for GP with One-Point Crossover, Building Blocks, and Some New Results in GA Theory. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds) Genetic Programming. EuroGP 2000. Lecture Notes in Computer Science, vol 1802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46239-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-46239-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67339-2
Online ISBN: 978-3-540-46239-2
eBook Packages: Springer Book Archive