Genetic Programming with Active Data Selection

Genetic programming evolves Lisp-like programs rather than fixed size linear strings. This representational power combined with generality makes genetic programming an interesting tool for automatic programming and machine learning. One weakness is the enormous time required for evolving complex programs. In this paper we present a method for accelerating evolution speed of genetic programming by active selection of fitness cases during the run. In contrast to conventional genetic programming in which all the given training data are used repeatedly, the presented method evolves programs using only a subset of given data chosen incrementally at each generation. This method is applied to the evolution of collective behaviors for multiple robotic agents. Experimental evidence supports that evolving programs on an incrementally selected subset of fitness cases can significantly reduce the fitness evaluation time without sacrificing generalization accuracy of the evolved programs.

• Type: Conference
• Year: 1998
• Where: SEAL
• Authors: Byoung-Tak Zhang, Dong-Yeon Cho
• Keywords: Fitness Cases, Genetic Programming, Machine Learning, Method Evolves Programs, SEAL 1998