Langdon, WB;
Petke, J;
Clark, D;
(2021)
Dissipative polynomials.
In:
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference Companion.
(pp. pp. 1683-1691).
ACM
Preview |
Text
Langdon_2021_LAHS.pdf - Accepted Version Download (9MB) | Preview |
Abstract
Limited precision floating point computer implementations of large polynomial arithmetic expressions are nonlinear and dissipative. They are not reversible (irreversible, lack conservation), lose information, and so are robust to perturbations (anti-fragile) and resilient to fluctuations. This gives a largely stable locally flat evolutionary neutral fitness search landscape. Thus even with a large number of test cases, both large and small changes deep within software typically have no effect and are invisible externally. Shallow mutations are easier to detect but their RMS error need not be simple.
| Type: | Proceedings paper |
|---|---|
| Title: | Dissipative polynomials |
| Event: | GECCO '21 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1145/3449726.3463147 |
| Publisher version: | https://doi.org/10.1145/3449726.3463147 |
| 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. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS 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 |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10133301 |
Archive Staff Only
 |
View Item |
