21772 articles – 15587 references  [version française]

hal-00642530, version 1

An empirical study of functional complexity as an indicator of overfitting in Genetic Programming

Leonardo Trujillo () 1, Sara Silva 23, Pierrick Legrand () 45, Leonardo Vanneschi 6

EuroGP (2011) 262-273

Abstract: Recently, it has been stated that the complexity of a solution is a good indicator of the amount of overfitting it incurs. However, measuring the complexity of a program, in Genetic Programming, is not a trivial task. In this paper, we study the functional complexity and how it relates with overfitting on symbolic regression problems.We consider two measures of complexity, Slope-based Functional Complexity, inspired by the concept of curvature, and Regularity-based Functional Complexity based on the concept of Holderian regularity. In general, both complexity measures appear to be poor indicators of program overfitting. However, results suggest that Regularity-based Functional Complexity could provide a good indication of overfitting in extreme cases.

  • 1:  Instituto Tecnológico de Tijuana
  • Instituto Tecnológico de Tijuana
  • 2:  Knowledge Discovery and Bioinformatics (KDBIO)
  • INESC-ID
  • 3:  Evolutionary and Complex Systems Group (ECOS Group)
  • CISUC
  • 4:  Institut de Mathématiques de Bordeaux (IMB)
  • CNRS : UMR5251 – Université Sciences et Technologies - Bordeaux I – Université Victor Segalen - Bordeaux II
  • 5:  ALEA (INRIA Bordeaux - Sud-Ouest)
  • INRIA – Université de Bordeaux – CNRS : UMR5251
  • 6:  Dipartimento di Informatica Sistemistica e Comunicazione (DISCo)
  • UNIVERSITÀ DEGLI STUDI DI MILANO-BICOCCA
  • Domain : Computer Science/Computational Complexity
    Computer Science/Artificial Intelligence
    Mathematics/Statistics
    Statistics/Statistics Theory
 
  • hal-00642530, version 1
  • oai:hal.archives-ouvertes.fr:hal-00642530
  • From: 
  • Submitted on: Friday, 18 November 2011 11:28:15
  • Updated on: Monday, 21 November 2011 16:46:45