We introduce a learning algorithm for unsupervised neural networks based on ideas from statistical mechanics. The algorithm is derived from a mean field approximation for large, layered sigmoid belief networks. We show how to (approximately) infer the statistics of these networks without resort to sampling. This is done by solving the mean field equations, which relate the statistics of each unit to those of its Markov blanket. Using these statistics as target values, the weights in the network are adapted by a local delta rule. We evaluate the strengths and weaknesses of these networks for problems in statistical pattern recognition.
CITATION STYLE
Saul, L., & Jordan, M. (1998). A Mean Field Learning Algorithm for Unsupervised Neural Networks. In Learning in Graphical Models (pp. 541–554). Springer Netherlands. https://doi.org/10.1007/978-94-011-5014-9_20
Mendeley helps you to discover research relevant for your work.