Solution-Locked averages and solution-time binning in genetic programming

  • Authors:

  • Riccardo Poli

  • Affiliations:

  • School of Computer Science and Electronic Engineering, University of Essex, UK

  • Venue:
  • EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Averaging data collected in multiple independent runs across generations is the standard method to study the behaviour of GP. We show that while averaging may represent with good resolution GP's behaviour in the early stages of a run, it blurs later components of the dynamics. We propose two techniques to improve the situation: solution-locked averaging and solution-time binning. Results indicate that there are significant benefits in adopting these techniques.