Function Optimisation Using Multiple-base Population Based Incremental Learning
暂无分享,去创建一个
| Population Based Incremental Learning (PBIL) is a stochastic search technique which combines characteristics of both the Genetic Algorithm and competitive learning. It has been shown to be a simple, yet widely eeective function optimisation strategy. Applications of PBIL to date include: selecting the weights in a neural network, image registration, lter design and feature set extraction. A generalisation of PBIL to Base-N PBIL is presented and discussed. Following this, a Multiple Base version of PBIL (MB-PBIL) is presented, which attempts to optimise a function by searching in a variety of bases. (Similar strategies have been shown to be eeective for hill-climbers.) Finally, it is shown that for the standard test functions used, MB-PBIL performed better than the standard PBIL.
[1] Shumeet Baluja,et al. Genetic Algorithms and Explicit Search Statistics , 1996, NIPS.
[2] Andy J. Keane,et al. A brief comparison of some evolutionary optimization methods , 1996 .
[3] J. Kingdon,et al. The shape of space , 1995 .