Boltzmann machines are undirected graphical models with two-state stochastic variables, in which the logarithms of the clique potentials are quadratic functions of the node states. They have been widely studied in the neural computing literature, although their practical applicability has been limited by the difficulty of finding an effective learning algorithm. One well-established approach, known as mean field theory, represents the stochastic distribution using a factorized approximation. However, the corresponding learning algorithm often fails to find a good solution. We conjecture that this is due to the implicit uni-modality of the mean field approximation which is therefore unable to capture multi-modality in the true distribution. In this paper we use variational methods to approximate the stochastic distribution using multi-modal mixtures of factorized distributions. We present results for both inference and learning to demonstrate the effectiveness of this approach.
[1]
D. Rubin,et al.
Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper
,
1977
.
[2]
C. Galland.
The limitations of deterministic Boltzmann machine learning
,
1993
.
[3]
Geoffrey E. Hinton,et al.
A Learning Algorithm for Boltzmann Machines
,
1985,
Cogn. Sci..
[4]
Hilbert J. Kappen,et al.
Efficient Learning in Boltzmann Machines Using Linear Response Theory
,
1998,
Neural Computation.
[5]
Neil D. Lawrence,et al.
Approximating Posterior Distributions in Belief Networks Using Mixtures
,
1997,
NIPS.
[6]
Geoffrey E. Hinton.
Deterministic Boltzmann Learning Performs Steepest Descent in Weight-Space
,
1989,
Neural Computation.
[7]
Radford M. Neal.
A new view of the EM algorithm that justifies incremental and other variants
,
1993
.