- author = "Aliyu Sani Sambo and R. Muhammad Atif Azad and Yevgeniya Kovalchuk and Vivek Padmanaabhan Indramohan and Hanifa Shah",
- title = "Improving the Generalisation of Genetic Programming Models with Evaluation Time and Asynchronous Parallel Computing",
- booktitle = "Proceedings of the 2021 Genetic and Evolutionary Computation Conference Companion",
- year = "2021",
- editor = "Francisco Chicano and Alberto Tonda and Krzysztof Krawiec and Marde Helbig and Christopher W. Cleghorn and Dennis G. Wilson and Georgios Yannakakis and Luis Paquete and Gabriela Ochoa and Jaume Bacardit and Christian Gagne and Sanaz Mostaghim and Laetitia Jourdan and Oliver Schuetze and Petr Posik and Carlos Segura and Renato Tinos and Carlos Cotta and Malcolm Heywood and Mengjie Zhang and Leonardo Trujillo and Risto Miikkulainen and Bing Xue and Aneta Neumann and Richard Allmendinger and Fuyuki Ishikawa and Inmaculada Medina-Bulo and Frank Neumann and Andrew M. Sutton",
- pages = "265--266",
- address = "internet",
- series = "GECCO '21",
- month = jul # " 10-14",
- organisation = "SIGEVO",
- publisher = "Association for Computing Machinery",
- publisher_address = "New York, NY, USA",
- keywords = "genetic algorithms, genetic programming, generalisation, regression, complexity: Poster",
- isbn13 = "978-1-4503-8351-6",
-
URL = "
https://doi.org/10.1145/3449726.3459583",
-
DOI = "
doi:10.1145/3449726.3459583",
- size = "2 pages",
- abstract = "In genetic programming (GP), controlling complexity often means reducing the size of evolved expressions. However, previous studies show that size reduction may not avoid model overfitting. Therefore, in this study, we use the evaluation time, the computational time required to evaluate a GP model on data, as the estimate of model complexity. The evaluation time depends not only on the size of evolved expressions but also their composition, thus acting as a more nuanced measure of model complexity than size alone.To constrain complexity using this measure of complexity, we employed an explicit control technique and a method that creates a race condition. We used a hybridisation of GP and multiple linear regression (MLRGP) that discovers useful features to boost training performance in our experiments. The improved training increases the chances of overfitting and facilitates a study of how managing complexity with evaluation time can address overfitting. Also, MLRGP allows us to observe the relationship between evaluation time and the number of features in a model. The results show that constraining evaluation time of MLRGP leads to better generalisation than both plain MLRGP and with an effective bloat-control.",
-
notes = "
GECCO-2021 A Recombination of the 30th International Conference on Genetic Algorithms (ICGA) and the 26th Annual Genetic Programming Conference (GP)",
