In Genetic Algorithms, the mutation operator is used to maintain genetic diversity in the population throughout the evolutionary process. Various kinds of mutation may occur over time, typically depending on a fixed probability value called mutation rate. In this work we make use of a novel data-science approach in order to adaptively generate mutation rates for each locus to the Neuroevolution of Augmenting Topologies (NEAT) algorithm. The trail of high quality candidate solutions obtained during the search process is represented as a third-order tensor; factorization of such a tensor reveals the latent relationship between solutions, determining the mutation probability which is likely to yield improvement at each locus. The single pole balancing problem is used as case study to analyze the effectiveness of the proposed approach. Results show that the tensor approach improves the performance of the standard NEAT algorithm for the case study.

A tensor-based mutation operator for Neuroevolution of Augmenting Topologies (NEAT)

MARZULLO, ALDO
;
STAMILE, CLAUDIO;TERRACINA, Giorgio;CALIMERI, Francesco
;
2017-01-01

Abstract

In Genetic Algorithms, the mutation operator is used to maintain genetic diversity in the population throughout the evolutionary process. Various kinds of mutation may occur over time, typically depending on a fixed probability value called mutation rate. In this work we make use of a novel data-science approach in order to adaptively generate mutation rates for each locus to the Neuroevolution of Augmenting Topologies (NEAT) algorithm. The trail of high quality candidate solutions obtained during the search process is represented as a third-order tensor; factorization of such a tensor reveals the latent relationship between solutions, determining the mutation probability which is likely to yield improvement at each locus. The single pole balancing problem is used as case study to analyze the effectiveness of the proposed approach. Results show that the tensor approach improves the performance of the standard NEAT algorithm for the case study.
2017
978-1-5090-4601-0
NEAT; Mutation; Tensor Decomposition; Genetic Algorithms
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/186306
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 2
social impact