Genetic Programming Based on Novelty Search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Theses Year : 2016

Genetic Programming Based on Novelty Search


Novelty Search (NS) is a unique approach towards search and optimization, where an explicit objective function is replaced by a measure of solution novelty. However, NS has been mostly used in evolutionary robotics, its usefulness in classic machine learning problems has been unexplored. This thesis presents a NS-based Genetic Programming (GP) algorithms for common machine learning problems, with the following contributions. It is shown that NS can solve real-world classification, clustering and symbolic regression tasks, validated on realworld benchmarks and synthetic problems. These results are made possible by using a domain-specific behavior descriptor, related to the concept of semantics in GP. Moreover, two new versions of the NS algorithm are proposed, Probabilistic NS (PNS) and a variant of Minimal Criteria NS (MCNS). The former models the behavior of each solution as a random vector and eliminates all the NS parameters while reducing the computational overhead of the NS algorithm; the latter uses a standard objective function to constrain and bias the search towards high performance solutions. The thesis also discusses the effects of NS on GP search dynamics and code growth. Results show that NS can be used as a realistic alternative for machine learning, and particularly for GP-based classification.
Fichier principal
Vignette du fichier
NaredoFINALThesis.pdf (12.05 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

tel-01668776 , version 1 (20-12-2017)


  • HAL Id : tel-01668776 , version 1


Enrique Naredo. Genetic Programming Based on Novelty Search. Artificial Intelligence [cs.AI]. ITT, Instituto tecnologico de Tijuana, 2016. English. ⟨NNT : ⟩. ⟨tel-01668776⟩


259 View
591 Download


Gmail Facebook X LinkedIn More