Abstract
This chapter describes the notion of Run Transferable Libraries(RTLs), libraries of functions which evolve from run to run. RTLs have much in common with standard programming libraries as they provide a suite of functions that can not only be used across several runs on a particular problem, but also to aid in the scaling of a system to more difficult instances of a problem. This is achieved by training a library on a relatively simple instance of a problem before applying it to the more difficult one.
The chapter examines the dynamics of the library internals, and how functions compete for dominance of the library. We demonstrate that the libraries tend to converge on a small number of functions, and identify methods to test how well a library is likely to be able to scale.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angeline, P. J. and Pollack, J. B. (1992). The evolutionary induction of subroutines. In Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society, Bloomington, Indiana, USA. Lawrence Erlbaum.
Howard, Daniel (2003). Modularization by multi-run frequency driven subtree encapsulation. In Riolo, Rick L. and Worzel, Bill, editors, Genetic Programming Theory and Practice, chapter 10, pages 155–172. Kluwer.
Keijzer, Maarten, Ryan, Conor, and Cattolico, Mike (2004). Run transferable libraries—learning functional bias in problem domains. In Banzhaf, Wolfgang, Daida, Jason, Eiben, Agoston E., Garzon, Max H., Honavar, Vasant, Jakiela, Mark, and Smith, Robert E., editors, Proceedings of the Genetic and Evolutionary Computation Conference. Springer Verlag.
Koza, John R. (1990). Genetic programming: A paradigm for genetically breeding populations of computer programs to solve problems. Technical Report STAN-CS-90-1314, Computer Science Department, Stanford University.
Koza, John R. (1994). Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge Massachusetts.
Koza, John R. and Rice, James P. (1991). Genetic generation of both the weights and architecture for a neural network. In Proceedings of nternational Joint Conference on Neural Networks, pages 397–404. IEEE Press.
Roberts, Simon C., Howard, Daniel, and Koza, John R. (2001). Evolving modules in genetic programming by subtree encapsulation. In Miller, Julian F., Tomassini, Marco, Lanzi, Pier Luca, Ryan, Conor, Tettamanzi, Andrea G. B., and Langdon, William B., editors, Genetic Programming, Proceedings of EuroGP’2001, volume 2038 of LNCS, pages 160–175, Lake Como, Italy. Springer-Verlag.
Rosca, Justinian P. and Ballard, Dana H. (1994). Hierarchical self-organization in genetic programming. In Proceedings of the Eleventh International Conference on Machine Learning. Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Ryan, C., Keijzer, M., Cattolico, M. (2005). Favourable Biasing of Function Sets Using Run Transferable Libraries. In: O’Reilly, UM., Yu, T., Riolo, R., Worzel, B. (eds) Genetic Programming Theory and Practice II. Genetic Programming, vol 8. Springer, Boston, MA. https://doi.org/10.1007/0-387-23254-0_7
Download citation
DOI: https://doi.org/10.1007/0-387-23254-0_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23253-9
Online ISBN: 978-0-387-23254-6
eBook Packages: Computer ScienceComputer Science (R0)