Pith. sign in

REVIEW 1 cited by

Positional Cartesian Genetic Programming

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.04119 v1 pith:IT3FIXHU submitted 2018-10-09 cs.NE

classification cs.NE
keywords geneticoperatorsprogrammingbeencartesiandifferentformmany
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A New Deterministic Technique for Symbolic Regression

    cs.LG 2019-08 conditional novelty 6.0 of 10

    A deterministic symbolic regression method grows a single expression tree by locally improving nodes, returning compact equations that the authors report to be competitive with a neural network on one dataset.

Pith tools