Langdon, WB;
Banzhaf, W;
(2022)
Long-Term Evolution Experiment with Genetic Programming.
Artificial Life
, 28
(2)
pp. 173-204.
10.1162/artl_a_00360.
Preview |
Text
Langdon_artl_a_00360.pdf Download (6MB) | Preview |
Abstract
We evolve floating point Sextic polynomial populations of genetic programming binary trees for up to a million generations. We observe continued innovation but this is limited by tree depth. We suggest that deep expressions are resilient to learning as they disperse information, impeding evolvability, and the adaptation of highly nested organisms, and we argue instead for open complexity. Programs with more than 2,000,000,000 instructions (depth 20,000) are created by crossover. To support unbounded long-term evolution experiments in genetic programming (GP), we use incremental fitness evaluation and both SIMD parallel AVX 512-bit instructions and 16 threads to yield performance equivalent to 1.1 trillion GP operations per second, 1.1 tera GPops, on an Intel Xeon Gold 6136 CPU 3.00GHz server.
Type: | Article |
---|---|
Title: | Long-Term Evolution Experiment with Genetic Programming |
Location: | United States |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1162/artl_a_00360 |
Publisher version: | https://doi.org/10.1162/artl_a_00360 |
Language: | English |
Additional information: | This version is the version of record. For information on re-use, please refer to the publisher’s terms and conditions. |
Keywords: | Genetic programming, extended unlimited evolution, information theory limit on complexity, long-term evolution experiment (LTEE), open complexity, speed-up technique, Algorithms, Biological Evolution, Software |
UCL classification: | UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science UCL > Provost and Vice Provost Offices > UCL BEAMS UCL |
URI: | https://discovery.ucl.ac.uk/id/eprint/10152700 |




Archive Staff Only
![]() |
View Item |