Learning algorithm of Boltzmann machine based on spatial Monte Carlo integration method (Q2331442): Difference between revisions
From MaRDI portal
Latest revision as of 19:12, 20 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Learning algorithm of Boltzmann machine based on spatial Monte Carlo integration method |
scientific article |
Statements
Learning algorithm of Boltzmann machine based on spatial Monte Carlo integration method (English)
0 references
29 October 2019
0 references
Summary: The machine learning techniques for Markov random fields are fundamental in various fields involving pattern recognition, image processing, sparse modeling, and earth science, and a Boltzmann machine is one of the most important models in Markov random fields. However, the inference and learning problems in the Boltzmann machine are NP-hard. The investigation of an effective learning algorithm for the Boltzmann machine is one of the most important challenges in the field of statistical machine learning. In this paper, we study Boltzmann machine learning based on the (first-order) spatial Monte Carlo integration method, referred to as the 1-SMCI learning method, which was proposed in the author's previous paper. In the first part of this paper, we compare the method with the maximum pseudo-likelihood estimation (MPLE) method using a theoretical and a numerical approaches, and show the 1-SMCI learning method is more effective than the MPLE. In the latter part, we compare the 1-SMCI learning method with other effective methods, ratio matching and minimum probability flow, using a numerical experiment, and show the 1-SMCI learning method outperforms them.
0 references
machine learning
0 references
Boltzmann machine
0 references
Monte Carlo integration
0 references
approximate algorithm
0 references