Leveraging Evaluation Time to Produce Simple Machine Learning Models with Genetic Programming

  • Sambo, Aliyu Sani
Publication date
April 2022

Abstract

The quest for simple solutions is not new in machine learning (ML) and related methods such as genetic programming (GP). GP is a nature-inspired approach to the automatic programming of computers used to create solutions to a broad range of computational problems. However, the evolving solutions can grow unnecessarily complex, which presents considerable challenges. Typically, the control of complexity in GP means reducing the sizes of the evolved expressions – known as bloat-control. However, size is a function of solution representation, and hence it does not consistently capture complexity across diverse GP applications. Instead, this thesis proposes to estimate the complexity of the evolving solutions by their evaluation time – the comp...

Extracted data

Loading...

Related items

Leveraging Evaluation Time to Produce Simple Machine Learning Models with Genetic Programming
  • Sambo, Aliyu Sani
April 2022

The quest for simple solutions is not new in machine learning (ML) and related methods such as genet...

Leveraging Asynchronous Parallel Computing to Produce Simple Genetic Programming Computational Models
  • Sambo, Aliyu Sani
  • Azad, R. Muhammad Atif
  • Kovalchuk, Yevgeniya
  • Indramohan, Vivek
  • Shah, H.
April 2020

Traditionally, reducing complexity in Machine Learning promises benefits such as less overfitting. H...

Improving the generalisation of genetic programming models with evaluation time and asynchronous parallel computing
  • Sambo, Aliyu Sani
  • Azad, R Muhammad Atif
  • Kovalchuk, Yevgeniya
  • Padmanaabhan, Vivek
  • Shah, Hanifa
July 2021

In genetic programming (GP), controlling complexity often means reducing the size of evolved express...

We use cookies to provide a better user experience.