Finding needles in haystacks is harder with neutrality

This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of sampling used by the CGP is significantly less effective at locating solutions than the solution density of the corresponding formula space would warrant. We present results indicating that the loss of performance is caused by the sampling bias of the CGP, due to the neutrality friendly representation. We implement a simple intron free random sampling algorithm which performs considerably better on the same problem and then explain how such performance is possible. Categories and Subject Descriptors I.2 [ARTIFICIAL INTELLIGENCE]: Automatic Programming; D.2.8 [Software Engineering]: Metrics—complexity measures, performance measures General Terms Algorithms Keywords Reduced Boolean Parity, Cartesian Genetic Programming, Search Space

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: M. Collins
• Keywords: Boolean Parity, Boolean Parity Problem, Cartesian Genetic Programming, GECCO 2005