Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Semantic Geometric Initialization

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee

Year of publication

2016

Chapter type

paper

Publication language

english

Keywords
EN
  • geometric semantic genetic programming
  • semantic initialization
  • population
Abstract

EN A common approach in Geometric Semantic Genetic Programming (GSGP) is to seed initial populations using conventional, semantic-unaware methods like Ramped Half-and-Half. We formally demonstrate that this may limit GSGP’s ability to find a program with the sought semantics. To overcome this issue, we determine the desired properties of geometric-aware semantic initialization and implement them in Semantic Geometric Initialization (Sgi) algorithm, which we instantiate for symbolic regression and Boolean function synthesis problems. Properties of Sgi and its impact on GSGP search are verified experimentally on nine symbolic regression and nine Boolean function synthesis benchmarks. When assessed experimentally, Sgi leads to superior performance of GSGP search: better best-of-run fitness and higher probability of finding the optimal program.

Pages (from - to)

261 - 277

DOI

10.1007/978-3-319-30668-1_17

URL

https://link.springer.com/chapter/10.1007/978-3-319-30668-1_17

Book

Genetic Programming : 19th European Conference, EuroGP 2016, Porto, Portugal, March 30 - April 1, 2016 : Proceedings

Presented on

19th European Conference on Genetic Programming, EuroGP 2016, 30.03.2016 - 01.04.2016, Porto, Portugal

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.