Some experiments on the use of genetic algorithms in a Boltzmann machine

The authors combined a genetic algorithm (GA) and simulated annealing to form a genetic Boltzmann machine (GBM) and attempted to understand the properties of such an architecture by experiments. Results of other experiments are also shown relating to the selection of parameters for the GA. The effects of population, different crossover point operators, and hidden units are illustrated. It is concluded that with careful design a GBM can perform nearly as well as a Boltzmann machine in a scalar computer. However, the GBM is easily amenable to parallel computation.<
>