Learning algorithm of Boltzmann machine based on spatial Monte Carlo integration method

DOI10.3390/A11040042MaRDI QIDQ2331442zbMATH OpenOpenAlexFDO

Authors Muneki Yasuda

Publication date 29 October 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a11040042

zbMATH Keywords

approximate algorithmBoltzmann machinemachine learningMonte Carlo integration

Mathematics Subject Classification ID

Random fields; image analysis (62M40) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Review text

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.

Recommendations

• A generalization of spatial Monte Carlo integration
• Approximate Learning Algorithm in Boltzmann Machines
• Learning algorithm for Boltzmann machines using max-product algorithm and pseudo-likelihood
• scientific article; zbMATH DE number 1928639
• Pseudo temperature of observed data

Cites work

• A Fast Learning Algorithm for Deep Belief Nets
• An efficient learning procedure for deep Boltzmann machines
• Approximate inverse Ising models close to a Bethe reference point
• Approximate Learning Algorithm in Boltzmann Machines
• Consistency of Pseudolikelihood Estimation of Fully Visible Boltzmann Machines
• Estimation of non-normalized statistical models by score matching
• Generalized exact formula for the correlations of the Ising model and other classical systems
• Graphical models, exponential families, and variational inference
• scientific article; zbMATH DE number 4100431 (Why is no real title available?)
• scientific article; zbMATH DE number 1220667 (Why is no real title available?)
• Machine learning. A probabilistic perspective
• Markov random fields for vision and image processing
• Pseudolikelihood for exponential family models of spatial point processes
• Small-correlation expansions for the inverse Ising problem
• Sparse signal recovery with exponential-family noise
• Training Products of Experts by Minimizing Contrastive Divergence

Cited in

(2)

• Pseudo temperature of observed data
• A generalization of spatial Monte Carlo integration

Describes a project that uses

Uses Software

• PMTK
• darch

This page was built for publication: Learning algorithm of Boltzmann machine based on spatial Monte Carlo integration method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331442)