Abstract | ||
---|---|---|
Genetic Programming (GP) is a dynamic field of research where empirical testing plays an important role in validating new ideas and algorithms. The ability to easily prototype new algorithms by reusing key components and quickly obtain results is therefore important for the researcher.
In this paper we introduce Operon, a C++ GP framework focused on performance, modularity and usability, featuring an efficient linear tree encoding and a scalable concurrency model where each logical thread is responsible for generating a new individual. We model the GP evolutionary process around the concept of an offspring generator, a streaming operator that defines how new individuals are obtained. The approach allows different algorithmic variants to be expressed using high-level constructs within the same generational basic loop. The evaluation routine supports both scalar and dual numbers, making it possible to calculate model derivatives via automatic differentiation. This functionality allows seamless integration with gradient-based local search approaches.
We discuss the design choices behind the proposed framework and compare against two other popular GP frameworks, DEAP and HeuristicLab. We empirically show that Operon is competitive in terms of solution quality, while being able to generate results significantly faster.
|
Year | DOI | Venue |
---|---|---|
2020 | 10.1145/3377929.3398099 | GECCO '20: Genetic and Evolutionary Computation Conference
Cancún
Mexico
July, 2020 |
DocType | ISBN | Citations |
Conference | 978-1-4503-7127-8 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bogdan Burlacu | 1 | 21 | 4.85 |
Gabriel Kronberger | 2 | 192 | 25.40 |
Michael Kommenda | 3 | 97 | 15.58 |