Sciweavers

Share
GECCO
1999
Springer

Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson's Magic

9 years 5 months ago
Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson's Magic
This paper examines some of the reporting and research practices concerning empirical work in genetic programming. We describe several common loopholes and offer three case studies—two in data modeling and one in robotics—that illustrate each. We show that by exploiting these loopholes, one can achieve performance gains of up two orders of magnitude without any substantiative changes to GP. We subsequently offer several recommendations.
Jason M. Daida, Derrick S. Ampy, Michael Ratanasav
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where GECCO
Authors Jason M. Daida, Derrick S. Ampy, Michael Ratanasavetavadhana, Hsiaolei Li, Omar A. Chaudhri
Comments (0)
books