Bloat control in genetic programming with a histogram-based accept-reject method

  • Authors:
  • Marc-André Gardner;Christian Gagné;Marc Parizeau

  • Affiliations:
  • Université Laval, Quebec City, PQ, Canada;Université Laval, Quebec City, PQ, Canada;Université Laval, Quebec City, PQ, Canada

  • Venue:
  • Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent bloat control methods such as dynamic depth limit (DynLimit) and Dynamic Operator Equalization (DynOpEq) aim at modifying the tree size distribution in a population of genetic programs. Although they are quite efficient for that purpose, these techniques have the disadvantage of evaluating the fitness of many bloated Genetic Programming (GP) trees, and then rejecting most of them, leading to an important waste of computational resources. We are proposing a method that makes a histogram-based model of current GP tree size distribution, and uses the so-called accept-reject method for generating a population with the desired target size distribution, in order to make a stochastic control of bloat in the course of the evolution. Experimental results show that the method is able to control bloat as well as other state-of-the-art methods, with minimal additionnal computational efforts compared to standard tree-based GP.