Massively Parallel Probabilistic Reasoning with Boltzmann Machines

  • Authors:
  • Petri Myllymäki

  • Affiliations:
  • Complex Systems Computation Group (CoSCo), Department of Computer Science, P.O. Box 26, FIN-00014, University of Helsinki, Finland. Petri.Myllymaki@cs.Helsinki.FI www.cs.Helsinki.FI/∼m ...

  • Venue:
  • Applied Intelligence
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a method for mapping a given Bayesian network to aBoltzmann machine architecture, in the sense that the the updatingprocess of the resulting Boltzmann machine model probably converges toa state which can be mapped back to a maximum a posteriori (MAP)probability state in the probability distribution represented by theBayesian network. The Boltzmann machine model can be implementedefficiently on massively parallel hardware, since the resultingstructure can be divided into two separate clusters where all thenodes in one cluster can be updated simultaneously. This means thatthe proposed mapping can be used for providing Bayesian networkmodels with a massively parallel probabilistic reasoning module,capable of finding the MAP states in a computationally efficientmanner. From the neural network point of view, the mapping from aBayesian network to a Boltzmann machine can be seen as a method forautomatically determining the structure and the connection weights ofa Boltzmann machine by incorporating high-level, probabilisticinformation directly into the neural network architecture, withoutrecourse to a time-consuming and unreliable learning process.