By Topic

Stochastic Diversity Loss and Scalability in Estimation of Distribution Genetic Programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kangil Kim ; Structural Complexity Laboratory, Department of Computer Science and Engineering, Seoul National University, Seoul, Korea ; R. I. McKay

In estimation of distribution algorithms (EDAs), probability models hold accumulating evidence on the location of an optimum. Stochastic sampling drift has been heavily researched in EDA optimization but not in EDAs applied to genetic programming (EDA-GP). We show that, for EDA-GPs using probabilistic prototype tree models, stochastic drift in sampling and selection is a serious problem, inhibiting scaling to complex problems. Problems requiring deep dependence in their probability structure see such rapid stochastic drift that the usual methods for controlling drift are unable to compensate. We propose a new alternative, analogous to likelihood weighting of evidence. We demonstrate in a small-scale experiment that it does counteract the drift, sufficiently to leave EDA-GP systems subject to similar levels of stochastic drift to other EDAs.

Published in:

IEEE Transactions on Evolutionary Computation  (Volume:17 ,  Issue: 3 )