Using phylogenetic analysis to enhance genetic improvement

Rainford, Penelope and Porter, Barry (2022) Using phylogenetic analysis to enhance genetic improvement. In: GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference. ACM, USA, pp. 849-957. ISBN 9781450392372

Text (main)
main.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.

Download (1MB)


Genetic code improvement systems (GI) start from an existing piece of program code and search for alternative versions with better performance according to a metric of interest. The search space of source code is a large, rough fitness landscape which can be extremely difficult to navigate. Most approaches to enhancing search capability in this domain involve either novelty search, where low-fitness areas are remembered and avoided, or formal analysis which attempts to find high-utility parameterizations for the GI process. In this paper we propose the use of phylogenetic analysis over genetic history to understand how different mutations and crossovers affect the fitness of a population over time for a particular problem; we use the results of that analysis to tune a GI process during its operation to enhance its ability to locate better program candidates. Using phylogenetic analysis on 600 runs of a genetic improver targeting a hash function, we demonstrate how the results of this analysis yield tuned mutation types over the course of a GI process (dynamically and continually set according to individual's ancestors' ranks within the population) to give hash functions with over 20% improved fitness compared to a baseline GI process.

Item Type:
Contribution in Book/Report/Proceedings
Additional Information:
© ACM, 2022. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference, July 2022
ID Code:
Deposited By:
Deposited On:
25 Oct 2022 15:50
Last Modified:
16 Sep 2023 03:25