Memory with memory in tree-based genetic programming

Riccardo Poli; Nicholas F. McPhee; Luca Citi; Ellery Crane

doi:10.1007/978-3-642-01181-8_3

Memory with memory in tree-based genetic programming

Riccardo Poli, Nicholas F. McPhee, Luca Citi, Ellery Crane

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Scopus citations

Abstract

In recent work on linear register-based genetic programming (GP) we introduced the notion ofMemory-with-Memory (MwM), where the results of operations are stored in registers using a form of soft assignment which blends a result into the current content of a register rather than entirely replace it. The MwM system yielded very promising results on a set of symbolic regression problems. In this paper, we propose a way of introducing MwM style behaviour in treebased GP systems. The technique requires only very minor modifications to existing code, and, therefore, is easy to apply. Experiments on a variety of synthetic and real-world problems show that MwM is very beneficial in tree-based GP, too.

Original language	English (US)
Title of host publication	Genetic Programming - 12th European Conference, EuroGP 2009, Proceedings
Pages	25-36
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-01181-8_3
State	Published - 2009
Event	12th European Conference on Genetic Programming, EuroGP 2009 - Tubingen, Germany Duration: Apr 15 2009 → Apr 17 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5481 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th European Conference on Genetic Programming, EuroGP 2009
Country/Territory	Germany
City	Tubingen
Period	4/15/09 → 4/17/09

Access

10.1007/978-3-642-01181-8_3

OpenUrl availability

Full text

Cite this

Poli, R., McPhee, N. F., Citi, L., & Crane, E. (2009). Memory with memory in tree-based genetic programming. In Genetic Programming - 12th European Conference, EuroGP 2009, Proceedings (pp. 25-36). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5481 LNCS). https://doi.org/10.1007/978-3-642-01181-8_3

Memory with memory in tree-based genetic programming. / Poli, Riccardo; McPhee, Nicholas F.; Citi, Luca et al.
Genetic Programming - 12th European Conference, EuroGP 2009, Proceedings. 2009. p. 25-36 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5481 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Poli, R, McPhee, NF, Citi, L & Crane, E 2009, Memory with memory in tree-based genetic programming. in Genetic Programming - 12th European Conference, EuroGP 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5481 LNCS, pp. 25-36, 12th European Conference on Genetic Programming, EuroGP 2009, Tubingen, Germany, 4/15/09. https://doi.org/10.1007/978-3-642-01181-8_3

@inproceedings{6c86d4657f4745feb770e79b80b8f24b,

title = "Memory with memory in tree-based genetic programming",

abstract = "In recent work on linear register-based genetic programming (GP) we introduced the notion ofMemory-with-Memory (MwM), where the results of operations are stored in registers using a form of soft assignment which blends a result into the current content of a register rather than entirely replace it. The MwM system yielded very promising results on a set of symbolic regression problems. In this paper, we propose a way of introducing MwM style behaviour in treebased GP systems. The technique requires only very minor modifications to existing code, and, therefore, is easy to apply. Experiments on a variety of synthetic and real-world problems show that MwM is very beneficial in tree-based GP, too.",

author = "Riccardo Poli and McPhee, {Nicholas F.} and Luca Citi and Ellery Crane",

year = "2009",

doi = "10.1007/978-3-642-01181-8_3",

language = "English (US)",

isbn = "3642011802",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "25--36",

booktitle = "Genetic Programming - 12th European Conference, EuroGP 2009, Proceedings",

note = "12th European Conference on Genetic Programming, EuroGP 2009 ; Conference date: 15-04-2009 Through 17-04-2009",

}

TY - GEN

T1 - Memory with memory in tree-based genetic programming

AU - Poli, Riccardo

AU - McPhee, Nicholas F.

AU - Citi, Luca

AU - Crane, Ellery

PY - 2009

Y1 - 2009

N2 - In recent work on linear register-based genetic programming (GP) we introduced the notion ofMemory-with-Memory (MwM), where the results of operations are stored in registers using a form of soft assignment which blends a result into the current content of a register rather than entirely replace it. The MwM system yielded very promising results on a set of symbolic regression problems. In this paper, we propose a way of introducing MwM style behaviour in treebased GP systems. The technique requires only very minor modifications to existing code, and, therefore, is easy to apply. Experiments on a variety of synthetic and real-world problems show that MwM is very beneficial in tree-based GP, too.

AB - In recent work on linear register-based genetic programming (GP) we introduced the notion ofMemory-with-Memory (MwM), where the results of operations are stored in registers using a form of soft assignment which blends a result into the current content of a register rather than entirely replace it. The MwM system yielded very promising results on a set of symbolic regression problems. In this paper, we propose a way of introducing MwM style behaviour in treebased GP systems. The technique requires only very minor modifications to existing code, and, therefore, is easy to apply. Experiments on a variety of synthetic and real-world problems show that MwM is very beneficial in tree-based GP, too.

UR - http://www.scopus.com/inward/record.url?scp=67650649823&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67650649823&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-01181-8_3

DO - 10.1007/978-3-642-01181-8_3

M3 - Conference contribution

AN - SCOPUS:67650649823

SN - 3642011802

SN - 9783642011801

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 25

EP - 36

BT - Genetic Programming - 12th European Conference, EuroGP 2009, Proceedings

T2 - 12th European Conference on Genetic Programming, EuroGP 2009

Y2 - 15 April 2009 through 17 April 2009

ER -

Memory with memory in tree-based genetic programming

Abstract

Publication series

Conference

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this