Unveiling evolutionary algorithm representation with DU maps
Genetic Programming and Evolvable Machines , Volume 19 p. 351- 389
Evolutionary algorithms (EAs) have proven to be effective in tackling problems in many different domains. However, users are often required to spend a significant amount of effort in fine-tuning the EA parameters in order to make the algorithm work. In principle, visualization tools may be of great help in this laborious task, but current visualization tools are either EA-specific, and hence hardly available to all users, or too general to convey detailed information. In this work, we study the Diversity and Usage map (DU map), a compact visualization for analyzing a key component of every EA, the representation of solutions. In a single heat map, the DU map visualizes for entire runs how diverse the genotype is across the population and to which degree each gene in the genotype contributes to the solution. We demonstrate the generality of the DU map concept by applying it to six EAs that use different representations (bit and integer strings, trees, ensembles of trees, and neural networks). We present the results of an online user study about the usability of the DU map which confirm the suitability of the proposed tool and provide important insights on our design choices. By providing a visualization tool that can be easily tailored by specifying the diversity (D) and usage (U) functions, the DU map aims at being a powerful analysis tool for EAs practitioners, making EAs more transparent and hence lowering the barrier for their use.
|, , , , , , , , , ,|
|Genetic Programming and Evolvable Machines|
|3D dose reconstruction for children with long-term follow-up Toward improved decision making in radiation treatment for children with cancer|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands|
Medvet, E, Virgolin, M, Castelli, M, Bosman, P.A.N, Gonçalves, I, & Tušar, T. (2018). Unveiling evolutionary algorithm representation with DU maps. Genetic Programming and Evolvable Machines, 19, 351–389. doi:10.1007/s10710-018-9332-5