Approximate learning algorithm in Boltzmann machines
Related Experiment Videos
Muneki Yasuda1, Kazuyuki Tanaka
1Graduate School of Information Sciences, Tohoku University, Sendai, Miyagi, Japan. muneki@smapip.is.tohoku.ac.jp
Abstract:
Boltzmann machines can be regarded as Markov random fields. For binary cases, they are equivalent to the Ising spin model in statistical mechanics. Learning systems in Boltzmann machines are one of the NP-hard problems. Thus, in general we have to use approximate methods to construct practical learning algorithms in this context. In this letter, we propose new and practical learning algorithms for Boltzmann machines by using the belief propagation algorithm and the linear response approximation, which are often referred as advanced mean field methods. Finally, we show the validity of our algorithm using numerical experiments.
Related Concept Videos
Maxwell-Boltzmann Distribution: Problem Solving
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Linearization and Approximation
Distribution of Molecular Speeds
Approximate Integration
Application of Linearization and Approximation