Brian M. Cerny
ABSTRACT
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf nodes are either variables or constants. Such constants are usually unknown in Symbolic Regression (SR) problems, and GP, as well as many of its derivatives, lack the ability to precisely approximate these values. This is due to the inherently discrete encoding of GP-like methods which are more suited to combinatorial searches than real-valued optimization tasks. Previously, several attempts have been made to resolve this issue, and the dominant solutions have been to either embed a real-valued local optimizer or to develop additional numerically oriented operators. In this paper, an entirely new approach is proposed for constant creation. Through the adoption of a robust, real-valued optimization algorithm known as Differential Evolution (DE), constants and GP-like programs will be simultaneously evolved in such a way that the values of the leaf nodes will be approximated as the tree structure is itself changing. Experimental results from several SR benchmarks are presented and analyzed. The results demonstrate the feasibility of the proposed algorithm and suggest that exotic or computationally expensive methods are not necessary for successful constant creation.
- Xin Li. Self-Emergence of Structures in Gene Expression Programming. PhD thesis, University of Illinois at Chicago, 2006. Google Scholar
Digital Library
- Cândida Ferreira. Gene expression programming: A new adaptive algorithm for solving problems. Complex Systems, 13(2):87--129, 2001.Google Scholar
- John R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992. Google ScholarDigital Library
- David E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Professional, 1989. Google ScholarDigital Library
- Zhuli Xie, Xin Li, Barbara Di Eugenio, Weimin Xiao, Thomas M. Tirpak, and Peter C. Nelson. Using Gene Expression Programming to Construct Sentence Ranking Functions for Text Summarization. In Proceedings of the 20th International Conference on Computational Linguistics, (COLING 2004), pages 1381--1384, Geneva, Switzerland, August 2004. Google ScholarDigital Library
- Chi Zhou, Weimin Xiao, Thomas M. Tirpak, and Peter C. Nelson. Evolving Accurate and Compact Classification Rules with Gene Expression Programming. IEEE Transactions on Evolutionary Computation, 7(6):519--531, December 2003. Google ScholarDigital Library
- Cândida Ferreira. Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence. Springer-Verlag, second edition, 2006. Google ScholarDigital Library
- Kenneth V. Price, Rainer M. Storn, and Jouni A. Lampinen. Differential Evolution: A Pratical Approach to Global Optimization. Springer-Verlag, 2005. Google ScholarDigital Library
- Qiongyun Zhang, Chi Zhou, Weimin Xiao, and Peter C. Nelson. Improving Gene Expression Programming Performance by Using Differential Evolution. In Proceedings of the 6th International Conference on Machine Learning and Applications (ICMLA'07), pages 31--37, Cincinnati, OH, USA, 2007. IEEE Computer Society. Google ScholarDigital Library
- Stefano Cagnoni, Daniel Rivero, and Leonardo Vanneschi. A purely evolutionary memetic algorithm as a first step towards symbiotic coevolution. In Proceedings of the IEEE Congress on Evolutionary Computation, (CEC 2005), pages 1156--1163, Edinburgh, UK, September 2005. IEEE.Google ScholarCross Ref
- Alexander Topchy and William Punch. Faster Genetic Programming based on Local Gradient Search of Numeric Leaf Values. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), pages 155--162, San Francisco, CA, USA, July 2001. Morgan Kaufmann.Google Scholar
- Gunther R. Raidl. A Hybrid GP Approach for Numerically Robust Symbolic Regression. In Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 323--328, Madison, WI, USA, July 1998. Morgan Kaufmann.Google Scholar
- Thomas Fernandez and Matthew P. Evett. Numeric Mutation as an Improvement to Symbolic Regression in Genetic Programming. In Evolutionary Programming VII, 7th International Conference, (EP98), pages 251--260. Springer, 1998. Google ScholarDigital Library
- Conor Ryan and Maarten Keijzer. An Analysis of Diversity of Constants of Genetic Programming. In Genetic Programming, 6th European Conference, EuroGP 2003, pages 404--413. Springer, 2003. Google ScholarDigital Library
- Xin Li, Chi Zhou, Peter C. Nelson, and Thomas M. Tirpak. Investigation of Constant Creation Techniques in the Context of Gene Expression Programming. In Maarten Keijzer, editor, Late Breaking Papers at the 2004 Genetic and Evolutionary Computation Conference, Seattle, WA, USA, July 2004.Google Scholar
- Michael O'Neill, Ian Dempsey, Anthony Brabazon, and Conor Ryan. Analysis of a Digit Concatenation Approach to Constant Creation. In Genetic Programming, 6th European Conference, EuroGP 2003, pages 173--182. Springer, 2003. Google ScholarDigital Library
- Maarten Keijzer. Improving Symbolic Regression with Interval Arithmetic and Linear Scaling. In Genetic Programming, 6th European Conference, EuroGP 2003, pages 70--82. Springer, 2003. Google ScholarDigital Library
- Michael O'Neill and Anthony Brabazon. Grammatical Differential Evolution. In Proceedings of the 2006 International Conference on Artificial Intelligence (ICAI 2006), pages 231--236. CSREA Press, 2006.Google Scholar
- Franz Rothlauf. Representations for Genetic and Evolutionary Algorithms. Springer-Verlag Berlin Heidelberg, second edition, 2006. Google ScholarDigital Library
- Rob Shipman, Mark Shackleton, and Inman Harvey. The use of neutral genotype-phenotype mappings for improved evolutionary search. BT Technology Journal, 18(4):103--111, 2000. Google ScholarDigital Library
Recommendations
An improved class of real-coded Genetic Algorithms for numerical optimization
Over the last few decades, many improved Evolutionary Algorithms (EAs) have been proposed to tackle different types of optimization problems. Genetic Algorithm (GA) among other canonical algorithms have not shown consistent performance over a range of ...
Self-adaptive randomized and rank-based differential evolution for multimodal problems
Differential Evolution (DE) is a widely used successful evolutionary algorithm (EA) based on a population of individuals, which is especially well suited to solve problems that have non-linear, multimodal cost functions. However, for a given population, ...
Constrained differential evolution using generalized opposition-based learning
Differential evolution (DE) is a well-known optimization approach to deal with nonlinear and complex optimization problems. However, many real-world optimization problems are constrained problems that involve equality and inequality constraints. DE with ...
Comments