Model Selection and Overfitting in Genetic Programming: Empirical Study [Extended Version]
Jan \v{Z}egklitz, Petr Po\v{s}\'ik

TL;DR
This paper investigates overfitting and model selection in genetic programming, comparing various techniques like RST and validation sets through extensive experiments on artificial and real datasets.
Contribution
It provides an empirical comparison of overfitting mitigation methods and model selection strategies in genetic programming, highlighting their effectiveness.
Findings
Validation set approach reduces overfitting more effectively.
Random Sampling Technique improves model generalization.
Standard full-data approach is often less robust.
Abstract
Genetic Programming has been very successful in solving a large area of problems but its use as a machine learning algorithm has been limited so far. One of the reasons is the problem of overfitting which cannot be solved or suppresed as easily as in more traditional approaches. Another problem, closely related to overfitting, is the selection of the final model from the population. In this article we present our research that addresses both problems: overfitting and model selection. We compare several ways of dealing with ovefitting, based on Random Sampling Technique (RST) and on using a validation set, all with an emphasis on model selection. We subject each approach to a thorough testing on artificial and real--world datasets and compare them with the standard approach, which uses the full training data, as a baseline.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Algorithms and Applications · Metaheuristic Optimization Algorithms Research · Viral Infectious Diseases and Gene Expression in Insects
