paper-with-me

홈 › Papers

Model Selection and Overfitting in Genetic Programming: Empirical Study [Extended Version]

2015-04-30 · Jan Žegklitz, Petr Pošík

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.

📄 PDF Abstract BibTeX arXiv:1504.08168

Code (0)

등록된 구현이 없습니다.

Tasks

Model Selection

Similar Papers 제목 키워드 기반

Guiding Multi-Objective Genetic Programming with Description Length Improves Symbolic Regression Solutions

2026-05-21 · Gabriel Kronberger, Fabricio Olivetti de Franca, Deaglan J. Bartlett, Harry Desmond 외 arxiv

Symbolic regression with genetic programming (GPSR) may suffer from overfitting and structural bloat, especially when noise is present. In this paper we evaluate description length (DL) and fractional Bayes factor (FBF) …

Enhancing Generalization in Evolutionary Feature Construction for Symbolic Regression through Vicinal Jensen Gap Minimization

2026-02-02 · Hengzhe Zhang, Qi Chen, Bing Xue, Wolfgang Banzhaf 외 arxiv

Genetic programming-based feature construction has achieved significant success in recent years as an automated machine learning technique to enhance learning performance. However, overfitting remains a challenge that li…

Intrusion DetectionData AugmentationNoise Estimation

Population Diversity Leads to Short Running Times of Lexicase Selection

2022-04-13 · Thomas Helmuth, Johannes Lengler, William La Cava

In this paper we investigate why the running time of lexicase parent selection is empirically much lower than its worst-case bound of O(N*C). We define a measure of population diversity and prove that high diversity lead…

DiversityProgram Synthesis

Genetic programming approaches to learning fair classifiers

2020-04-28 · William La Cava, Jason H. Moore

Society has come to rely on algorithms like classifiers for important decision making, giving rise to the need for ethical guarantees such as fairness. Fairness is typically defined by asking that some statistic of a cla…

Decision MakingFairness

On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection

2013-09-23 · Gabriel Kronberger, Stephan Winkler, Michael Affenzeller, Andreas Beham 외

Genetic programming is a powerful heuristic search technique that is used for a number of real world applications to solve among others regression, classification, and time-series forecasting problems. A lot of progress …

Heuristic SearchTime SeriesTime Series AnalysisTime Series Forecasting