Predict the Performance of GE with an ACO Based Machine Learning Algorithm

Azad, R. Muhammad Atif and Chennupati, Gopinath and Ryan, Conor (2014) Predict the Performance of GE with an ACO Based Machine Learning Algorithm. In: GECCO '14 Companion: Proceeding of the sixteenth annual conference companion on Genetic and Evolutionary Computation Conference, GECCO '14. ACM, pp. 1353-1360. ISBN 978-1-4503-2881-4/14/07

Full text not available from this repository. (Request a copy)

Abstract

The quality of the evolved solutions of an evolutionary algorithm (EA) varies across different runs and a significant percentage of runs can produce solutions of undesirable quality. These runs are a waste of computational resources, particularly in difficult problems where practitioners have time
bound limitations in repeating runs. This paper proposes a completely novel approach, that of a Run Prediction Model (RPM) in which we identify and
terminate evolutionary runs that are likely to produce lowquality solutions. This is justified with an Ant Colony Optimization (ACO) based classifier that learns from the early generations of a run and decides whether to continue or not. We apply RPM to Grammatical Evolution (GE) applied to four benchmark symbolic regression problems and consider several contemporary machine learning algorithms to train the predictive models and find that ACO produces the best results and acceptable predictive accuracy for this first investigation. The ACO discovered prediction models are in
the form of a list of simple rules. We further analyse that list manually to tune them in order to predict poor GE runs. We then apply the analysed model to GE runs on the regression problems and terminate the runs identified by the model likely to be poor, thus increasing the rate of production of successful runs while reducing the computational effort required. We demonstrate that, although there is a high bootstrapping cost for RPM, further investigation is warranted as the mean success rate and the total execution time enjoys a statistically significant boost on all the four
benchmark problems.

Item Type: Book Section
Identification Number: https://doi.org/10.1145/2598394.2609860
Dates:
DateEvent
2014Published
Subjects: CAH11 - computing > CAH11-01 - computing > CAH11-01-01 - computer science
Divisions: Faculty of Computing, Engineering and the Built Environment
Faculty of Computing, Engineering and the Built Environment > School of Computing and Digital Technology
Depositing User: Oana-Andreea Dumitrascu
Date Deposited: 12 Jun 2017 13:01
Last Modified: 22 Mar 2023 12:02
URI: https://www.open-access.bcu.ac.uk/id/eprint/4605

Actions (login required)

View Item View Item

Research

In this section...