EUVIMEDEUVIMED entdecken
Crossref

Deep Genetic Programming Trees Are Robust

William B. Langdon

ACM Transactions on Evolutionary Learning and Optimization · 2022

DOI: 10.1145/3539738 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Evolutionary Learning and Optimization, 2022. Verfasst von William B. Langdon. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 65 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We sample the genetic programming tree search space and show it is smooth, since many mutations on many test cases have little or no fitness impact. We generate uniformly at random high-order polynomials composed of 12,500 and 750,000 additions and multiplications and follow the impact of small changes to them. From information theory, 32 bit floating point arithmetic is dissipative, and even with 1,501 test cases, deep mutations seldom have any impact on fitness. Absolute difference between parent and child evaluation can grow as well as fall further from the code change location, but the number of disrupted fitness tests falls monotonically. In many cases, deeply nested expressions are robust to crossover syntax changes, bugs, errors, run time glitches, perturbations, and so on, because their disruption falls to zero, and so it fails to propagate beyond the program.

Zitieren

APA

Langdon, W. B. (2022). Deep Genetic Programming Trees Are Robust. ACM Transactions on Evolutionary Learning and Optimization. https://doi.org/10.1145/3539738

Vancouver

Langdon WB. Deep Genetic Programming Trees Are Robust. ACM Transactions on Evolutionary Learning and Optimization. 2022. doi:10.1145/3539738

BibTeX
@article{Langdon2022,
  author = {Langdon, William B.},
  title = {Deep Genetic Programming Trees Are Robust},
  journal = {ACM Transactions on Evolutionary Learning and Optimization},
  year = {2022},
  doi = {10.1145/3539738}
}
Kostenlos starten →