Evolving graphs with semantic neutral drift

DOI10.1007/S11047-019-09772-4MaRDI QIDQ6095481zbMATH OpenOpenAlexWikidataFDO

Authors Timothy Atkinson, Detlef Plump, Susan Stepney

Publication date 8 September 2023

Published in Natural Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1810.10453

zbMATH Keywords

evolutionary algorithmsgenetic programminggraph programmingmutation operatorsneutral driftsemantic equivalence

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Abstract: We introduce the concept of Semantic Neutral Drift (SND) for genetic programming (GP), where we exploit equivalence laws to design semantics preserving mutations guaranteed to preserve individuals' fitness scores. A number of digital circuit benchmark problems have been implemented with rule-based graph programs and empirically evaluated, demonstrating quantitative improvements in evolutionary performance. Analysis reveals that the benefits of the designed SND reside in more complex processes than simple growth of individuals, and that there are circumstances where it is beneficial to choose otherwise detrimental parameters for a GP system if that facilitates the inclusion of SND.

Cites work

• 10.1162/153244302760200696
• A review on evolutionary algorithms in Bayesian network learning and inference tasks
• A study of the neutrality of Boolean function landscapes in genetic programming
• Cartesian genetic programming.
• From imperative to rule-based graph programs
• scientific article; zbMATH DE number 4080885 (Why is no real title available?)
• scientific article; zbMATH DE number 2087177 (Why is no real title available?)
• scientific article; zbMATH DE number 795587 (Why is no real title available?)
• Interacting quantum observables: categorical algebra and diagrammatics
• On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
• Probabilistic graph programs for randomised and evolutionary algorithms

This page was built for publication: Evolving graphs with semantic neutral drift

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6095481)