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

Created by W.Langdon from gp-bibliography.bib Revision:1.7630

@PhdThesis{Thesis_AliyuSambo_Jan2022,

• author = "Aliyu Sani Sambo",
• title = "Leveraging Evaluation Time to Produce Simple Machine Learning Models with Genetic Programming",
• school = "School of Computing and Digital Technology, Birmingham City University",
• year = "2022",
• address = "UK",
• month = "25 " # jan,
• keywords = "genetic algorithms, genetic programming, machine learning, APGP",
• URL = "https://www.open-access.bcu.ac.uk/13439/",
• URL = "https://www.open-access.bcu.ac.uk/id/eprint/13439",
• URL = "https://www.open-access.bcu.ac.uk/13439/1/Aliyu%20Sani%20Sambo_PhD%20Thesis_Final%20Version_Submitted%20Jan%202022_Final%20Award%20Apr%202022.pdf",
• URL = "http://dx.doi.org/10.13140/RG.2.2.32039.01440",
• size = "269 pages",
• 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 computational time required to evaluate a GP evolved solution on the given task. After all, the evaluation time depends not only on the size of the evolved expressions but also on other aspects such as their composition, thus acting as a more nuanced measure of model complexity than the expression size alone. Also, GP evaluates all the solutions in a population identically to determine their relative performance, for example, with the same dataset. Therefore, evaluation time can consistently compare the relative complexity.

  To discourage complexity using the proposed evaluation time, two approaches are used.The first approach explicitly penalises models with long evaluation times by customising well-tested techniques that traditionally control the size. The second uses a novel technique that implicitly discourages long evaluation times by incorporating a race condition in the GP process. The proposed methods yield accurate yet simple solutions; furthermore, the implicit method improves the runtime and training speed of GP.

  Across a diverse suite of GP applications, the evaluation time methods proffer several qualitative advantages over the bloat-control methods. They effectively manage the functional complexity of regression models to enable them to predict unseen data (generalise) better than those produced by bloat-control. In two feature engineering applications, they decrease the number of features, principally responsible for model complexity, while bloat-control does not. In a robot control application, they evolve accurate and efficient routines, efficient routines use fewer time steps to complete their tasks; bloat-control could not detect the efficiency of the programs. In Boolean logic problems where size emerges as the major cause of complexity, these methods are not hindered and perform at least as well as bloat-control. Overall, the proposed system characterises and manages various forms of complexity; also, it is broadly applicable and, hence, suitable for an automatic programming system.",

• notes = "15142485

  Supervisors: R. Muhammad Atif Azad, Yevgeniya Kovalchuk, Hanifa Shah, Vivek Indramohan",

}

Genetic Programming entries for Aliyu Sani Sambo

Citations