Autoconstructive evolution is a process in which the entities undergoing evolutionary change are themselves responsible for the construction of their own offspring and thus for aspects of the evolutionary process itself. Because biological evolution is always autoconstructive, this term mainly occurs in evolutionary computation, to distinguish artificial life type systems from conventional genetic algorithms where the GA performs replication artificially.[1][2][3][4][5] The term was coined by Lee Spector.[6][7][8][9][10]
Importance of autoconstructive evolution
Autoconstructive evolution is a good platform for answering theoretical questions about the evolution of evolvability. Preliminary evidence suggests that the way in which offspring are generated changes substantially over the course of evolution.[11] By studying these patterns, we can begin to understand how evolving systems organize themselves to evolve faster. Ultimately, such an understanding could allow us to improve our ability to solve problems with evolutionary computation.
This increased ability for the process of self-replication to evolve is also thought to be important for recreating the open-ended evolutionary process observed on earth[12]
Examples of autoconstructive evolution
Tierra and Avida
A relatively simple form of autoconstruction occurs in systems such as Tierra and Avida. In these systems, programs replicate themselves by allocating space in memory for their offspring and then looping over all of the instructions in their genome and copying each into the newly allocated space.[13] This is autoconstruction in that the programs are responsible for determining what code ends up in the offspring. Programs most commonly make exact copies of themselves, with changes being introduced exclusively through mutation events. In principle, however, programs can compose a wide range of possible offspring by only copying a subset of their genomes.
PushGP
PushGP is a genetic programming system which evolves code written in the Push language.[8] Push is a stack-based language designed for easy use in genetic programming, in which every variable type (e.g. strings, integers, etc.) has its own stack. All variables are stored on the stack associated with their type. One of the variable types is executable Push code. As a result, this language design allows for rich autoconstructive evolution by treating all code left on the code stack at the end of program execution as the program's offspring.[14] Using this approach, programs have complete control over the offspring programs that they create.
^Ryser-welch, Patricia; Miller, Julian F. (2014). "A review of hyper-heuristic frameworks". Proceedings of the Evo20 Workshop, AISB. CiteSeerX10.1.1.563.9564.
^Rahim, A. B. Abdul; Teo, J.; Saudi, A. (June 2006). "An Empirical Comparison of Code Size Limit in Auto-Constructive Artificial Life". 2006 IEEE Conference on Cybernetics and Intelligent Systems. pp. 1–6. doi:10.1109/ICCIS.2006.252308. ISBN978-1-4244-0022-5. S2CID17596010.
^Spector, Lee; Moscovici, Eva (2017). "Recent developments in autoconstructive evolution". Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO '17. New York, NY, USA: ACM. pp. 1154–1156. doi:10.1145/3067695.3082058. ISBN9781450349390. S2CID1968045.
^Spector, Lee; Moscovici, Eva (2017). "Recent developments in autoconstructive evolution". Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO '17. New York, NY, USA: ACM. pp. 1154–1156. doi:10.1145/3067695.3082058. ISBN9781450349390. S2CID1968045.