title: Sensibility of linkage information and effectiveness of estimated distributions.
abstract: The probabilistic model building performed by estimation of distribution algorithms (EDAs) enables these methods to use advanced techniques of statistics and machine learning for automatic discovery of problem structures. However, in some situations, it may not be possible to completely and accurately identify the whole problem structure by probabilistic modeling due to certain inherent properties of the given problem. In this work, we illustrate one possible cause of such situations with problems consisting of structures with unequal fitness contributions. Based on the illustrative example, we introduce a notion that the estimated probabilistic models should be inspected to reveal the effective search directions and further propose a general approach which utilizes a reserved set of solutions to examine the built model for likely inaccurate fragments. Furthermore, the proposed approach is implemented on the extended compact genetic algorithm (ECGA) and experiments are performed on several sets of additively separable problems with different scaling setups. The results indicate that the proposed method can significantly assist ECGA to handle problems comprising structures of disparate fitness contributions and therefore may potentially help EDAs in general to overcome those situations in which the entire problem structure cannot be recognized properly due to the temporal delay of emergence of some promising partial solutions.
authors.affiliation: Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan. cychuang@nclab.tw
authors.forename: Chung-Yao
authors.initials: CY
authors.lastname: Chuang
authors.forename: Ying-ping
authors.initials: YP
authors.lastname: Chen
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003195:Computer Communication Networks; D003198:Computer Simulation; D008957:Models, Genetic; D011336:Probability; D057386:Search Engine