A factorized distribution algorithm using single connected Bayesian networks

Abstract

Single connected Factorized Distribution Algorithms (FDA-SC) use factorizations of the joint distribution, which are trees, forests or polytrees. At each stage of the evolution they build a polytree from which new points are sampled. We study empirically the relation between the accuracy of the learned model and the quality of the new search points generated. We show that a change of the learned model before sampling might reduce the population size requirements of sampling.