Regularization approach to inductive genetic programming

doi:10.1109/4235.942530

Regularization approach to inductive genetic programming

2001-01-01

58

PRE

AI

DOI：10.1109/4235.942530

Original

Original request for help

Save

Abstract

En 中文

This paper presents an approach to regularization of inductive genetic programming tuned for learning polynomials. The objective is to achieve optimal evolutionary performance when searching high-order multivariate polynomials represented as tree structures. We show how to improve the genetic programming of polynomials by balancing its statistical bias with its variance. Bias reduction is achieved by employing a set of basis polynomials in the tree nodes for better agreement with the examples. Since this often leads to overfitting, such tendencies are counteracted by decreasing the variance through regularization of the fitness function. We demonstrate that this balance facilitates the search as well as enables discovery of parsimonious, accurate, and predictive polynomials. The presented experimental results show that this regularization approach outperforms traditional genetic programming on benchmark data mining and practical time-series prediction tasks.

Keywords:

genetic programming

Kolmogorov-Gabor polynomials

regularization

time series prediction

Regularization approach to inductive genetic programming

Abstract

Journal

Organization