ABSTRACT
We introduce the notion of using graphical models as a new and complementary means of understanding genetic programming dynamics (along with statistics such as mean tree size, etc). Graphical models reveal the dependency structure of the multivariate distribution associated with functions and terminals in solution structures. This information is more semantically rather than syntax oriented. As a first step, using the Pagie-2D problem as our exemplar, we present the generation and inter-generation dynamics of genetic programming in terms of graphical models that are largely unrestricted in structure. Open for discussion are questions such as: should a estimation of distribution genetic programming algorithm mimic standard genetic programming's search bias in terms of tree size and shape? And, does graphical model analysis indicate a better way to control the search bias for symbolic regression - by operator design, size control, bloat control or other means?
Index Terms
- Graphical models and what they reveal about GP when it solves a symbolic regression problem
Recommendations
HMXT-GP: an information-theoretic approach to genetic programming that maintains diversity
SAC '11: Proceedings of the 2011 ACM Symposium on Applied ComputingThis paper applies a recent information--theoretic approach to controlling Genetic Algorithms (GAs) called HMXT to tree--based Genetic Programming (GP). HMXT, in a GA domain, requires the setting of selection thresholds in a population and the ...
Developing Postfix-GP Framework for Symbolic Regression Problems
ACCT '15: Proceedings of the 2015 Fifth International Conference on Advanced Computing & Communication TechnologiesThis paper describes Postfix-GP system, postfix notation based Genetic Programming (GP), for solving symbolic regression problems. It presents an object-oriented architecture of Postfix-GP framework. It assists the user in understanding of the ...
Comments