Bogdan Burlacu
ABSTRACT
In genetic programming (GP), population diversity represents a key aspect of evolutionary search and a major factor in algorithm performance. In this paper we propose a new schema-based approach for observing and steering the loss of diversity in GP populations. We employ a well-known hyperschema definition from the literature to generate tree structural templates from the population's genealogy, and use them to guide the search via localized mutation within groups of individuals matching the same schema. The approach depends only on genealogy information and is easily integrated with existing GP variants. We demonstrate its potential in combination with Offspring Selection GP (OSGP) on a series of symbolic regression benchmark problems where our algorithmic variant called OSGP-S obtains superior results.
- Michael Affenzeller and Stefan Wagner. 2003. A Self-adaptive Model for Selective Pressure Handling within the Theory of Genetic Algorithms. Springer Berlin Heidelberg, Berlin, Heidelberg, 384--393.Google Scholar
- Lee Altenberg. 1994. The Evolution of Evolvability in Genetic Programming. In Advances in Genetic Programming, Kenneth E. Kinnear, Jr. (Ed.). MIT Press, Chapter 3, 47--74. Google ScholarDigital Library
- E.K. Burke, S. Gustafson, G. Kendall, and N. Krasnogor. 2003. Is increased diversity in genetic programming beneficial? An analysis of lineage selection. In Evolutionary Computation, 2003. CEC '03. The 2003 Congress on, Vol. 2. 1398--1405 Vol.2.Google Scholar
- Armand R. Burks and William F. Punch. 2016. An analysis of the genetic marker diversity algorithm for genetic programming. Genetic Programming and Evolvable Machines (9 2016), 1--33. Google ScholarDigital Library
- Armand R. Burks and William F. Punch. 2015. An Efficient Structural Diversity Technique for Genetic Programming. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation (GECCO '15). ACM, New York, NY, USA, 991--998. Google ScholarDigital Library
- Bogdan Burlacu, Michael Affenzeller, Michael Kommenda, Gabriel Kronberger, and Stephan Winkler. 2017. Analysis of Schema Frequencies in Genetic Programming. Springer International Publishing, Cham.Google Scholar
- Anikó Ekárt and Sandor Z. Németh. 2000. A Metric for Genetic Programs and Fitness Sharing. In Proceedings of the European Conference on Genetic Programming. Springer-Verlag, London, UK, UK, 259--270. Google ScholarDigital Library
- David E. Goldberg and Kalyanmoy Deb. 1991. A comparative analysis of selection schemes used in genetic algorithms. In Foundations of Genetic Algorithms. Morgan Kaufmann, 69--93.Google Scholar
- Michaela Götz, Christoph Koch, and Wim Martens. 2009. Efficient Algorithms for Descendant-only Tree Pattern Queries. Inf. Syst. 34, 7 (Nov. 2009), 602--623. Google ScholarDigital Library
- Gregory S. Hornby. 2006. ALPS: the age-layered population structure for reducing the problem of premature convergence. In GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, Vol. 1. ACM Press, Seattle, Washington, USA, 815--822. https://doi.org/ Google ScholarDigital Library
- Michael Kommenda, Gabriel Kronberger, Stephan Winkler, Michael Affenzeller, and Stefan Wagner. 2013. Effects of Constant Optimization by Nonlinear Least Squares Minimization in Symbolic Regression. In Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO '13 Companion). ACM, New York, NY, USA, 1121--1128. Google ScholarDigital Library
- Sean Luke. 2000. Two Fast Tree-Creation Algorithms for Genetic Programming. IEEE Transactions on Evolutionary Computation 4, 3 (Sept. 2000), 274--283. Google ScholarDigital Library
- K Matsui. 1999. New selection method to improve the population diversity in genetic algorithms. In Systems, Man, and Cybernetics, 1999. IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on, Vol. 1. IEEE, 625--630.Google Scholar
- Una-May O'Reilly. 1997. Using a Distance Metric on Genetic Programs to Understand Genetic Operators. (1997).Google Scholar
- Riccardo Poli and Nicholas Freitag McPhee. 2003. General Schema theory for genetic programming with subtree-swapping crossover: Part I. Evolutionary Computation 11, 1 (March 2003), 53--66. https://doi.org/ Google ScholarDigital Library
- Justinian Rosea. 1995. Entropy-Driven Adaptive Representation. In Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications. Morgan Kaufmann, 23--32.Google Scholar
- Stefan Wagner and Michael Affenzeller. 2005. SexualGA: Gender-Specific Selection for Genetic Algorithms. In Proceedings of the 9th World Multi-Conference on Systemics, Cybernetics and Informatics (WMSCI). Orlando, United States of America, 76--81.Google Scholar
- Stefan Wagner, Gabriel Kronberger, Andreas Beham, Michael Kommenda, Andreas Scheibenpflug, Erik Pitzer, Stefan Vonolfen, Monika Kofler, Stephan Winkler, Viktoria Dorfer, and Michael Affenzeller. 2014. Advanced Methods and Applications in Computational Intelligence. Topics in Intelligent Engineering and Informatics, Vol. 6. Springer, Chapter Architecture and Design of the HeuristicLab Optimization Environment, 197--261. http://link.springer.com/chapter/10.1007/978-3-319-01436-4_10Google Scholar
- David White. 2014. An Overview of Schema Theory. CoRR abs/1401.2651 (2014). arXiv:1401.2651 http://arxiv.org/abs/1401.2651Google Scholar
- Kay Wiese and Scott D. Goodwin. 1998. Keep-best Reproduction: A Selection Strategy for Genetic Algorithms. In Proceedings of the 1998 ACM Symposium on Applied Computing (SAC '98). ACM, New York, NY, USA, 343--348. Google ScholarDigital Library
- Wei Yan and Christopher D. Clack. 2006. Behavioural GP diversity for dynamic environments: an application in hedge fund investment. In GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, Vol. 2. ACM Press, Seattle, Washington, USA, 1817--1824. https://doi.org/ Google ScholarDigital Library
Index Terms
- Schema-based diversification in genetic programming
Recommendations
An Efficient Structural Diversity Technique for Genetic Programming
GECCO '15: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary ComputationGenetic diversity plays an important role in avoiding premature convergence, which is a phenomenon that stifles the search effectiveness of evolutionary algorithms. However, approaches that avoid premature convergence by maintaining genetic diversity ...
Diverse partner selection with brood recombination in genetic programming
Graphical abstractDisplay Omitted
Highlights- Optimal parent selection during crossover in genetic programming.
- Exploitation ...
AbstractThe ultimate goal of learning algorithms is to find the best solution from a search space without testing each and every solution available in the search space. During the evolution process new solutions (children) are produced from ...
Fitness landscapes and problem hardness in genetic programming
GECCO '09: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking PapersThe performance of searching agents, or metaheuristics, like evolutionary algorithms (genetics algorithms, genetic programming, etc.) or local search algorithms (simulated annealing, tabu search, etc.) depend on some properties of the search space ...
Comments