Moraglio et al. have recently introduced new genetic operators for genetic programming, called geometric semantic operators. These operators induce a unimodal fitness landscape for all the problems consisting in matching input data with known target outputs (like regression and classification). This feature facilitates genetic programming evolvability, which makes these operators extremely promising. Nevertheless, Moraglio et al. leave open problems, the most important one being the fact that these operators, by construction, always produce offspring that are larger than their parents, causing an exponential growth in the size of the individuals, which actually renders them useless in practice. In this paper we overcome this limitation by presenting a new efficient implementation of the geometric semantic operators. This allows us, for the first time, to use them on complex real-life applications, like the two problems in pharmacokinetics that we address here. Our results confirm the excellent evolvability of geometric semantic operators, demonstrated by the good results obtained on training data. Furthermore, we have also achieved a surprisingly good generalization ability, a fact that can be explained considering some properties of geometric semantic operators, which makes them even more appealing than before. © 2013 Springer-Verlag.

Vanneschi, L., Castelli, M., Manzoni, L., Silva, S. (2013). A new implementation of geometric semantic GP and its application to problems in pharmacokinetics. In Genetic Programming (pp.205-216) [10.1007/978-3-642-37207-0_18].

A new implementation of geometric semantic GP and its application to problems in pharmacokinetics

VANNESCHI, LEONARDO;CASTELLI, MAURO;MANZONI, LUCA;
2013

Abstract

Moraglio et al. have recently introduced new genetic operators for genetic programming, called geometric semantic operators. These operators induce a unimodal fitness landscape for all the problems consisting in matching input data with known target outputs (like regression and classification). This feature facilitates genetic programming evolvability, which makes these operators extremely promising. Nevertheless, Moraglio et al. leave open problems, the most important one being the fact that these operators, by construction, always produce offspring that are larger than their parents, causing an exponential growth in the size of the individuals, which actually renders them useless in practice. In this paper we overcome this limitation by presenting a new efficient implementation of the geometric semantic operators. This allows us, for the first time, to use them on complex real-life applications, like the two problems in pharmacokinetics that we address here. Our results confirm the excellent evolvability of geometric semantic operators, demonstrated by the good results obtained on training data. Furthermore, we have also achieved a surprisingly good generalization ability, a fact that can be explained considering some properties of geometric semantic operators, which makes them even more appealing than before. © 2013 Springer-Verlag.
Si
paper
Computer Science (all); Theoretical Computer Science
English
16th European Conference on Genetic Programming, EuroGP 2013
9783642372063
Vanneschi, L., Castelli, M., Manzoni, L., Silva, S. (2013). A new implementation of geometric semantic GP and its application to problems in pharmacokinetics. In Genetic Programming (pp.205-216) [10.1007/978-3-642-37207-0_18].
Vanneschi, L; Castelli, M; Manzoni, L; Silva, S
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/10281/60820
Citazioni
  • Scopus 88
  • ???jsp.display-item.citation.isi??? ND
Social impact