Abstract
The future of computing is one of massive parallelism. To exploit this and generatemaximumperformance itwill be inevitable thatmore co-design between hardware and software takes place. Many software algorithms need rethinking to expose all the possible concurrency, increase locality and have built-in fault tolerance. Evolutionary algorithms are naturally parallel and should as such have an edge in exploiting these hardware features.
In this paper we try to rethink the way we implement symbolic regression via genetic programming with the aimto obtainmaximumscalability to architectures with a very large number of processors. Working with very small populations might be an important feature to obtain a better locality of the computations. We show that quite reasonable results can be obtained with single chromosome crawlers and a diverse set of mutation-only operators. Next we show that it is possible to introduce a mechanism for constant innovation using very small population sizes. By introducing a computation, with competition for cpu-cycles based on the fitness and the activity of an individual, we can get continuous evolution within the same cpu-budget as the single chromosome crawlers. These results are obtained on a real life industrial dataset with composition data from a distillation tower with 23 potential inputs and 5000 records.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agerwala, Tilak (2008). Challenges on the road to exascale computing. In ICS’08: Proceedings of the 22nd annual international conference on Supercomputing, pages 2–2, New York, NY, USA. ACM.
Harding, Simon and Banzhaf, Wolfgang (2009). Distributed genetic programming on gpus using cuda. In Risco-Mart’n, Jos^ L. and Garnica, Oscar, editors, WPABA’09: Proceedings of the Second International Workshop on Parallel Architectures and Bioinspired Algorithms (WPABA 2009), pages 1–10, Raleigh, NC, USA. Universidad Complutense de Madrid.
Heroux, Michael A. (2009). Software challenges for extreme scale computing: Going from petascale to exascale systems. Int. J. High Perform. Comput. Appl., 23(4):437–439.
Langdon, W. B. (2010). A many threaded CUDA interpreter for genetic programming. In Esparcia-Alcazar, Anna Isabel, Ekart, Aniko, Silva, Sara, Dignum, Stephen, and Uyar, A. Sima, editors, Proceedings of the 13th European Conference on Genetic Programming, EuroGP 2010, volume 6021 of LNCS, pages 146–158, Istanbul. Springer.
Sarkar, Vivek, Harrod, William, and Snavely, Allan E (2009). Software challenges in extreme scale systems. Journal of Physics: Conference Series, 180(1):012045.
Smits, Guido and Vladislavleva, Ekaterina (2006). Ordinal Pareto Genetic Programming. In 2006 IEEE Congress on Evolutionary Computation (CEC’2006), pages 10471–10477, Vancouver, BC, Canada. IEEE.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Smits, G.F., Vladislavleva, E., Kotanchek, M.E. (2011). Scalable Symbolic Regression by Continuous Evolution with Very Small Populations. In: Riolo, R., McConaghy, T., Vladislavleva, E. (eds) Genetic Programming Theory and Practice VIII. Genetic and Evolutionary Computation, vol 8. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7747-2_9
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7747-2_9
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7746-5
Online ISBN: 978-1-4419-7747-2
eBook Packages: Computer ScienceComputer Science (R0)