Positional Cartesian Genetic Programming

2018-10-09 · DG Wilson, Julian F. Miller, Sylvain Cussat-Blanc, Hervé Luga

Cartesian Genetic Programming (CGP) has many modifications across a variety of implementations, such as recursive connections and node weights. Alternative genetic operators have also been proposed for CGP, but have not been fully studied. In this work, we present a new form of genetic programming based on a floating point representation. In this new form of CGP, called Positional CGP, node positions are evolved. This allows for the evaluation of many different genetic operators while allowing for previous CGP improvements like recurrency. Using nine benchmark problems from three different classes, we evaluate the optimal parameters for CGP and PCGP, including novel genetic operators.

📄 PDF Abstract BibTeX arXiv:1810.04119

Code (0)

등록된 구현이 없습니다.

Tasks

Form

Towards Advanced Phenotypic Mutations in Cartesian Genetic Programming

2018-03-16 · Roman Kalkreuth

Cartesian Genetic Programming is often used with a point mutation as the sole genetic operator. In this paper, we propose two phenotypic mutation techniques and take a step towards advanced phenotypic mutations in Cartes…

regression Symbolic Regression

Analysing the Influence of Reorder Strategies for Cartesian Genetic Programming

2024-10-01 · Henning Cui, Andreas Margraf, Jörg Hähner

Cartesian Genetic Programming (CGP) suffers from a specific limitation: Positional bias, a phenomenon in which mostly genes at the start of the genome contribute to a program output, while genes at the end rarely do. Thi…

Symbolic Regression

Improving Evaluation of Recombination-based Cartesian Genetic Programming

2026-05-27 · Duy Long Tran, Anja Jankovic, Marie Anastacio, Holger Hoos 외 arxiv

Cartesian Genetic Programming has traditionally been using mutation as its main and often sole genetic operator to drive evolutionary search. Despite advancements in recent years, recombinationbased approaches have long …

Cartesian Genetic Programming Approach for Designing Convolutional Neural Networks

2024-09-30 · Maciej Krzywda, Szymon Łukasik, Amir Gandomi H

The present study covers an approach to neural architecture search (NAS) using Cartesian genetic programming (CGP) for the design and optimization of Convolutional Neural Networks (CNNs). In designing artificial neural n…

Neural Architecture Search

Differentiable Genetic Programming

2016-11-15 · Dario Izzo, Francesco Biscani, Alessio Mereta

We introduce the use of high order automatic differentiation, implemented via the algebra of truncated Taylor polynomials, in genetic programming. Using the Cartesian Genetic Programming encoding we obtain a high-order T…