Operator equalisation was recently proposed as a new bloat control technique for genetic programming. By controlling the distribution of program lengths inside the population, it can bias the search towards smaller or larger programs. In this paper we propose a new implementation of operator equalisation and compare it to a previous version, using a hard real-world regression problem where bloat and overfitting are major issues. The results show that both implementations of operator equalisation are completely bloat-free, producing smaller individuals than standard genetic programming, without compromising the generalization ability. We also show that the new implementation of operator equalisation is more efficient and exhibits a more predictable and reliable behavior than the previous version. We advance some arguable ideas regarding the relationship between bloat and overfitting, and support them with our results.
|Title of host publication||Proceedings of the 11th Annual conference on Genetic and evolutionary computation|
|Publisher||ACM - Association for Computing Machinery|
|Publication status||Published - 1 Jan 2009|
|Event||GECCO ’09 - |
Duration: 1 Jan 2009 → …
|Period||1/01/09 → …|