What makes a problem GP-hard? validating a hypothesis of structural causes

  • Authors:

  • Jason M. Daida;Hsiaolei Li;Ricky Tang;Adam M. Hilss

  • Affiliations:

  • Center for the Study of Complex Systems and Space Physics Research Laboratory, The University of Michigan, Ann Arbor, Michigan;Center for the Study of Complex Systems and Space Physics Research Laboratory, The University of Michigan, Ann Arbor, Michigan;Center for the Study of Complex Systems and Space Physics Research Laboratory, The University of Michigan, Ann Arbor, Michigan;Center for the Study of Complex Systems and Space Physics Research Laboratory, The University of Michigan, Ann Arbor, Michigan

  • Venue:
  • GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper provides an empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test problem anticipated by this hypothesis. The problem is tunably difficult, but has this property because tuning is accomplished through changes in structure. Content is not involved in tuning. The results support a prediction of the hypothesis - that GP search space is significantly constrained as an outcome of structural mechanisms.