In this paper we focus on
issues solved with Genetic Programming (
). Excessive code growth or
often happens in GP, greatly slowing down the evolution process. In Pol03, Poli proposed the
method to reduce bloat, but possible side-effects of this method on the generalization accuracy of GP hypotheses remained to be tested. In particular, since Tarpeian Control puts a brake on code growth, it could behave as a kind of
, promoting shorter hypotheses more able to extend their knowledge to cases apart from any learning steps.
To answer this question, we experiment Tarpeian Control with symbolic regression. The results are contrasted, showing that it can either increase or reduce the generalization power of GP hypotheses, depending on the problem at hand. Experiments also confirm the decrease in size of programs. We conclude that Tarpeian Control might be useful if carefully tuned to the problem at hand.