Research Repository

Memory with memory in genetic programming

Poli, R and McPhee, NF and Citi, L and Crane, E (2009) 'Memory with memory in genetic programming.' Journal of Artificial Evolution and Applications, 2009. pp. 1-16. ISSN 1687-6229

570606.pdf - Published Version
Available under License Creative Commons Attribution.

Download (984kB) | Preview


We introduce Memory with Memory Genetic Programming (MwM-GP), where we use soft assignments and soft return operations. Instead of having the new value completely overwrite the old value of registers or memory, soft assignments combine such values. Similarly, in soft return operations the value of a function node is a blend between the result of a calculation and previously returned results. In extensive empirical tests, MwM-GP almost always does as well as traditional GP, while significantly outperforming it in several cases. MwM-GP also tends to be far more consistent than traditional GP. The data suggest that MwM-GP works by successively refining an approximate solution to the target problem and that it is much less likely to have truly ineffective code. MwM-GP can continue to improve over time, but it is less likely to get the sort of exact solution that one might find with traditional GP.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health
Faculty of Science and Health > Computer Science and Electronic Engineering, School of
SWORD Depositor: Elements
Depositing User: Elements
Date Deposited: 13 Mar 2014 10:43
Last Modified: 15 Jan 2022 01:18

Actions (login required)

View Item View Item