Skip to main content

Covariant Tarpeian Method for Bloat Control in Genetic Programming

  • Chapter
  • First Online:

Part of the book series: Genetic and Evolutionary Computation ((GEVO,volume 8))

Abstract

In this paper a simple modification of the Tarpeian bloat-control method is presented which allows one to dynamically set the parameters of the method in such a way to guarantee that the mean program size will either keep a particular value (e.g., its initial value) or will follow a schedule chosen by the user. The mathematical derivation of the technique as well as its numerical and empirical corroboration are presented.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Alfaro-Cid, Eva, Merelo, J. J., Fernandez de Vega, Francisco, Esparcia-Alcazar, Anna I., and Sharman, Ken (2010). Bloat control operators and diversity in genetic programming: A comparative study. Evolutionary Computation, 18(2):305–332.

    Article  Google Scholar 

  • Allen, Sam, Burke, Edmund K., Hyde, Matthew R., and Kendall, Graham (2009). Evolving reusable 3D packing heuristics with genetic programming. In Raidl, Guenther, Rothlauf, Franz, Squillero, Giovanni, Drechsler, Rolf, Stuetzle, Thomas, Birattari, Mauro, Congdon, ClareBates, Middendorf , Martin, Blum, Christian, Cotta, Carlos, Bosman, Peter, Grahl, Joern, Knowles, Joshua, Corne, David, Beyer, Hans-Georg, Stanley, Ken, Miller, Julian F., van Hemert, Jano, Lenaerts, Tom, Ebner, Marc, Bacardit, Jaume, O’Neill, Michael, Di Penta, Massimiliano, Doerr, Benjamin, Jansen, Thomas, Poli, Riccardo, and Alba, Enrique, editors, GECCO ’09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pages 931–938, Montreal. ACM.

    Google Scholar 

  • Burke, Edmund K., Hyde,Matthew R., Kendall, Graham, andWoodward, John (2007). Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or amaster of one. In Thierens, Dirk, Beyer, Hans-Georg, Bongard, Josh, Branke, Jurgen, Clark, John Andrew, Cliff, Dave, Congdon, Clare Bates, Deb, Kalyanmoy, Doerr, Benjamin, Kovacs, Tim, Kumar, Sanjeev, Miller, Julian F.,Moore, Jason, Neumann, Frank, Pelikan, Martin, Poli, Riccardo, Sastry, Kumara, Stanley, Kenneth Owen, Stutzle, Thomas, Watson, Richard A, andWegener, Ingo, editors, GECCO’07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, volume 2, pages 1559–1565, London. ACM Press.

    Google Scholar 

  • Chouza, Mariano, Rancan, Claudio, Clua, Osvaldo, and Garcia-Martinez, Ramon (2009). Passive analog filter design using GP population control strategies. In Chien, Been-Chian and Hong, Tzung-Pei, editors, Opportunities and Challenges for Next-Generation Applied Intelligence: Proceedings of the International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems (IEA-AIE) 2009, volume 214 of Studies in Computational Intelligence, pages 153–158. Springer-Verlag.

    Google Scholar 

  • Garcia,Beatriz,Aler,Ricardo,Ledezma,Agapito, and Sanchis,Araceli (2008a). Genetic programming for predicting protein networks. In Geffner, Hector, Prada, Rui, Alexandre, Isabel Machado, and David, Nuno, editors, Proceedings of the 11th Ibero-American Conference on AI, IBERAMIA 2008, volume 5290 of Lecture Notes in Computer Science, pages 432–441, Lisbon, Portugal. Springer. Advances in Artificial Intelligence.

    Google Scholar 

  • Garcia, Beatriz, Aler, Ricardo, Ledezma, Agapito, and Sanchis, Araceli (2008b). Protein-protein functional association prediction using genetic programming. In Keijzer, Maarten, Antoniol, Giuliano, Congdon, Clare Bates, Deb, Kalyanmoy, Doerr, Benjamin, Hansen, Nikolaus, Holmes, John H., Hornby, Gregory S., Howard, Daniel, Kennedy, James, Kumar, Sanjeev, Lobo, Fernando G., Miller, Julian Francis, Moore, Jason, Neumann, Frank, Pelikan, Martin, Pollack, Jordan, Sastry, Kumara, Stanley, Kenneth, Stoica, Adrian, Talbi, El-Ghazali, andWegener, Ingo, editors, GECCO’08: Proceedings of the 10th annual conference onGenetic and evolutionary computation, pages 347–348, Atlanta, GA, USA. ACM.

    Google Scholar 

  • Garcia-Almanza, Alma Lilia and Tsang, Edward P. K. (2006). Simplifying decision trees learned by genetic programming. In Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 7906–7912,Vancouver. IEEE Press.

    Google Scholar 

  • Koza, John R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA.

    MATH  Google Scholar 

  • Luke, Sean and Panait, Liviu (2006). A comparison of bloat control methods for genetic programming. Evolutionary Computation, 14(3):309–344.

    Article  Google Scholar 

  • Mahler, Sébastien, Robilliard, Denis, and Fonlupt, Cyril (2005). Tarpeian bloat control and generalization accuracy. In Keijzer, Maarten, Tettamanzi, Andrea, Collet, Pierre, van Hemert, Jano I., and Tomassini, Marco, editors, Proceedings of the 8th European Conference on Genetic Programming, volume 3447 of Lecture Notes in Computer Science, pages 203–214, Lausanne, Switzerland. Springer.

    Google Scholar 

  • Martinez-Jaramillo, Serafin and Tsang, Edward P.K. (2009). An heterogeneous, endogenous and coevolutionary GP-based financial market. IEEE Transactions on Evolutionary Computation, 13(1):33–55.

    Article  Google Scholar 

  • Poli, Riccardo (2003). A simple but theoretically-motivated method to control bloat in genetic programming. In Ryan, Conor, Soule, Terence, Keijzer, Maarten, Tsang, Edward, Poli, Riccardo, and Costa, Ernesto, editors, Genetic Programming, Proceedings of EuroGP’2003, volume 2610 of LNCS, pages 204–217, Essex. Springer-Verlag.

    Google Scholar 

  • Poli, Riccardo, Langdon, William B., and McPhee, Nicholas Freitag (2008). A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk. (With contributions by J. R. Koza).

  • Poli, Riccardo and McPhee, Nicholas (2008). Parsimony pressure made easy. In Keijzer, Maarten, Antoniol, Giuliano, Congdon, Clare Bates, Deb, Kalyanmoy, Doerr, Benjamin, Hansen, Nikolaus, Holmes, John H., Hornby, Gregory S., Howard, Daniel, Kennedy, James, Kumar, Sanjeev, Lobo, Fernando G., Miller, Julian Francis, Moore, Jason, Neumann, Frank, Pelikan, Martin, Pollack, Jordan, Sastry, Kumara, Stanley, Kenneth, Stoica, Adrian, Talbi, El-Ghazali, and Wegener, Ingo, editors, GECCO ’08: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 1267–1274, Atlanta, GA, USA. ACM.

    Google Scholar 

  • Poli, Riccardo and McPhee, Nicholas Freitag (2003). General schema theory for genetic programming with subtree-swapping crossover: Part II. Evolutionary Computation, 11(2):169–206.

    Article  Google Scholar 

  • Price, George R. (1970). Selection and covariance. Nature, 227, August 1:520–521.

    Article  Google Scholar 

  • Roberts, Mark E. and Claridge, Ela (2004). Cooperative coevolution of image feature construction and object detection. In Yao, Xin, Burke, Edmund, Lozano, Jose A., Smith, Jim, Merelo-Guervós, Juan J., Bullinaria, John A., Rowe, Jonathan, Kabán, Peter Tiňo Ata, and Schwefel, Hans-Paul, editors, Parallel Problem Solving from Nature - PPSN VIII, volume 3242 of LNCS, pages 902–911, Birmingham, UK. Springer-Verlag.

    Google Scholar 

  • Silva, Sara (2008). Controlling Bloat: Individual and Population Based Approaches in Genetic Programming. PhD thesis, Coimbra University, Portugal. Full author name is Sara Guilherme Oliveira da Silva.

    Google Scholar 

  • Wyns, Bart and Boullart, Luc (2009). Efficient tree traversal to reduce code growth in tree-based genetic programming. Journal of Heuristics, 15(1):77–104.

    Article  Google Scholar 

  • Zhang, Byoung-Tak and Mühlenbein, Heinz (1993). Evolving optimal neural networks using genetic algorithms with Occam’s razor. Complex Systems, 7:199–220.

    Google Scholar 

  • Zhang, Byoung-Tak and Mühlenbein, Heinz (1995). Balancing accuracy and parsimony in genetic programming. Evolutionary Computation, 3(1):17–38.

    Article  Google Scholar 

  • Zhang, Byoung-Tak, Ohm, Peter, and Mühlenbein, Heinz (1997). Evolutionary induction of sparse neural trees. Evolutionary Computation, 5(2):213–236.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Poli, R. (2011). Covariant Tarpeian Method for Bloat Control in Genetic Programming. In: Riolo, R., McConaghy, T., Vladislavleva, E. (eds) Genetic Programming Theory and Practice VIII. Genetic and Evolutionary Computation, vol 8. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7747-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-7747-2_5

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4419-7746-5

  • Online ISBN: 978-1-4419-7747-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics