Introducing assignment functions to Bayesian optimization algorithms

In this paper, we improve Bayesian optimization algorithms by introducing proportionate and rank-based assignment functions. A Bayesian optimization algorithm builds a Bayesian network from a selected sub-population of promising solutions, and this probabilistic model is employed to generate the offspring of the next generation. Our method assigns each solution a relative significance based on its fitness, and this information is used in building the Bayesian network model. These assignment functions can improve the quality of the model without performing an explicit selection on the population. Numerical experiments demonstrate the effectiveness of this method compared to a conventional BOA.

[1]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[2]  David E. Goldberg,et al.  Efficiency Enhancement of Probabilistic Model Building Genetic Algorithms , 2004, ArXiv.

[3]  Martin Pelikan,et al.  Parameter-Less Hierarchical BOA , 2004, GECCO.

[4]  Fernando G. Lobo,et al.  Compressed introns in a linkage learning genetic algorithm , 1998 .

[5]  David E. Goldberg,et al.  Getting the best of both worlds: Discrete and continuous genetic and evolutionary algorithms in concert , 2003, Inf. Sci..

[6]  David Maxwell Chickering,et al.  Learning Bayesian Networks: The Combination of Knowledge and Statistical Data , 1994, Machine Learning.

[7]  David E. Goldberg,et al.  Learning Linkage , 1996, FOGA.

[8]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[9]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[10]  David E. Goldberg,et al.  Linkage Problem, Distribution Estimation, and Bayesian Networks , 2000, Evolutionary Computation.

[11]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12]  D.E. Goldberg,et al.  A genetic algorithm using linkage identification by nonlinearity check , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[13]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[14]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[15]  Rajkumar Roy,et al.  Advances in Soft Computing: Engineering Design and Manufacturing , 1998 .

[16]  G. Harik.  Linkage Learning via Probabilistic Modeling in the ECGA , 1999 .

[17]  Heinz Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions II. Continuous Parameters , 1996, PPSN.

[18]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[19]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[20]  David E. Goldberg,et al.  The compact genetic algorithm , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[21]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .