Langdon, WB;
(2021)
Incremental Evaluation in Genetic Programming.
In:
Genetic Programming. EuroGP 2021. Lecture Notes in Computer Science.
(pp. pp. 229-246).
Springer International Publishing: Cham, Switzerland.
Preview |
Text
langdon_2021_EuroGP.pdf - Other Download (1MB) | Preview |
Abstract
Often GP evolves side effect free trees. These pure functional expressions can be evaluated in any order. In particular they can be interpreted from the genetic modification point outwards. Incremental evaluation exploits the fact that: in highly evolved children the semantic difference between child and parent falls with distance from the syntactic disruption (e.g. crossover point) and can reach zero before the whole child has been interpreted. If so, its fitness is identical to its parent (mum). Considerable savings in bloated binary tree GP runs are given by exploiting population convergence with existing GPquick data structures, leading to near linear O(gens) runtime. With multi-threading and SIMD AVX parallel computing a 16 core desktop can deliver the equivalent of 571 billion GP operations per second, 571 giga GPop/s. GP convergence is viewed via information theory as evolving a smooth landscape and software plasticity. Which gives rise to functional resilience to source code changes. On average a mixture of 100 +, −, × and (protected) ÷ tree nodes remove test case effectiveness at exposing changes and so fail to propagate crossover infected errors.
| Type: | Proceedings paper |
|---|---|
| Title: | Incremental Evaluation in Genetic Programming |
| Event: | Genetic Programming 24th European Conference, EuroGP 2021 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1007/978-3-030-72812-0_15 |
| Publisher version: | https://doi.org/10.1007/978-3-030-72812-0_15 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | Parallel computing, Mutational robustness, Antifragile correctness attraction, PIE, SBSE, Software resilience, Entropy loss, Theory |
| 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/10146199 |
Loading...
Loading...Loading...Loading...Archive Staff Only
 |
View Item |
