Skip to main content

Memory with Memory in Tree-Based Genetic Programming

  • Conference paper
Genetic Programming (EuroGP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5481))

Included in the following conference series:

Abstract

In recent work on linear register-based genetic programming (GP) we introduced the notion of Memory-with-Memory (MwM), where the results of operations are stored in registers using a form of soft assignment which blends a result into the current content of a register rather than entirely replace it. The MwM system yielded very promising results on a set of symbolic regression problems. In this paper, we propose a way of introducing MwM style behaviour in tree-based GP systems. The technique requires only very minor modifications to existing code, and, therefore, is easy to apply. Experiments on a variety of synthetic and real-world problems show that MwM is very beneficial in tree-based GP, too.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angeline, P.J.: An alternative to indexed memory for evolving programs with explicit state representations. 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. 423–430. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  2. Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming – An Introduction; On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann, San Francisco (1998)

    MATH  Google Scholar 

  3. Brave, S.: Evolving recursive programs for tree search. In: Angeline, P.J., Kinnear Jr., K.E. (eds.) Advances in Genetic Programming 2, ch. 10, pp. 203–220. MIT Press, Cambridge (1996)

    Google Scholar 

  4. Bruce, W.S.: Automatic generation of object-oriented programs using genetic programming. In: Koza, J.R., Goldberg, D.E., Fogel, D.B., Riolo, R.L. (eds.) Genetic Programming 1996: Proceedings of the First Annual Conference, Stanford University, CA, USA, July 28–31, pp. 267–272. MIT Press, Cambridge (1996)

    Google Scholar 

  5. Langdon, W.B.: Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! Genetic Programming, vol. 1. Kluwer, Boston (1998)

    Book  MATH  Google Scholar 

  6. Luck, S.J.: An Introduction to the Event-Related Potential Technique. MIT Press, Cambridge (2005)

    Google Scholar 

  7. McPhee, N.F., Poli, R.: Memory with memory: Soft assignment in genetic programming. In: Keijzer, M., Antoniol, G., Congdon, C.B., Deb, K., Doerr, B., Hansen, N., Holmes, J.H., Hornby, G.S., Howard, D., Kennedy, J., Kumar, S., Lobo, F.G., Miller, J.F., Moore, J., Neumann, F., Pelikan, M., Pollack, J., Sastry, K., Stanley, K., Stoica, A., Talbi, E.-G., Wegener, I. (eds.) GECCO 2008: Proceedings of the 10th annual conference on Genetic and evolutionary computation, Atlanta, GA, USA, pp. 1235–1242. ACM, New York (2008)

    Google Scholar 

  8. Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming. Published via (2008) (With contributions by Koza, J.R.), http://lulu.com , http://www.gp-field-guide.org.uk

  9. Spector, L., Klein, J., Keijzer, M.: The push3 execution stack and the evolution of control. In: Beyer, H.-G., O’Reilly, U.-M., Arnold, D.V., Banzhaf, W., Blum, C., Bonabeau, E.W., Cantu-Paz, E., Dasgupta, D., Deb, K., Foster, J.A., de Jong, E.D., Lipson, H., Llora, X., Mancoridis, S., Pelikan, M., Raidl, G.R., Soule, T., Tyrrell, A.M., Watson, J.-P., Zitzler, E. (eds.) GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, Washington DC, USA, vol. 2, pp. 1689–1696. ACM Press, New York (2005)

    Google Scholar 

  10. Spector, L., Robinson, A.: Genetic programming and autoconstructive evolution with the push programming language. Genetic Programming and Evolvable Machines 3(1), 7–40 (2002)

    Article  MATH  Google Scholar 

  11. Teller, A.: The evolution of mental models. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming, ch. 9, pp. 199–219. MIT Press, Cambridge (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Poli, R., McPhee, N.F., Citi, L., Crane, E. (2009). Memory with Memory in Tree-Based Genetic Programming. In: Vanneschi, L., Gustafson, S., Moraglio, A., De Falco, I., Ebner, M. (eds) Genetic Programming. EuroGP 2009. Lecture Notes in Computer Science, vol 5481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01181-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01181-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01180-1

  • Online ISBN: 978-3-642-01181-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics