Research Repository

Parsimony pressure made easy: Solving the problem of bloat in GP

Poli, R and McPhee, NF (2014) 'Parsimony pressure made easy: Solving the problem of bloat in GP.' In: UNSPECIFIED, (ed.) Natural Computing Series. UNSPECIFIED, 181 - 204.

Full text not available from this repository.

Abstract

© Springer-Verlag Berlin Heidelberg 2014. The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming (GP). In this chapter we first reconsider the size evolution equation for genetic programming developed in Poli andMcPhee (Evol Comput 11(2):169-206, 2003) and rewrite it in a form that shows its direct relationship to Price’s theorem. We then use this new formulation to derive theoretical results that show how to practically and optimally set the parsimony coefficient dynamically during a run so as to achieve complete control over the growth of the programs in a population. Experimental results confirm the effectiveness of the method, as we are able to tightly control the average program size under a variety of conditions. These include such unusual cases as dynamically varying target sizes so that the mean program size is allowed to grow during some phases of a run, while being forced to shrink in others.

Item Type: Book Section
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Jim Jamieson
Date Deposited: 25 Aug 2015 13:20
Last Modified: 22 Jan 2019 22:15
URI: http://repository.essex.ac.uk/id/eprint/14600

Actions (login required)

View Item View Item