Learning restricted Boltzmann Machines with few latent variables
Name
1192539418-MIT.pdf
Size
572.18 KB
Format
Adobe PDF
Checksum (MD5)
22294346a7e00453682c83a055248902
Author(s)
Buhai, Rares-Darius.
Advisor(s)
Guy Bresler.
Date Issued
2020
Publisher
Massachusetts Institute of Technology
Abstract
Restricted Boltzmann Machines are a common family of undirected graphical models with latent variables, described by an undirected bipartite graph, with all observed variables in one layer and all latent variables in the other. In this thesis, we give an improved algorithm for learning the structure of a Restricted Boltzmann Machine, given samples generated according to it. Currently, the best algorithms for this task have time complexity O(n[superscript d), where n is the number of observed variables and d is the maximum degree of a latent variable. Let the observed neighborhood of an observed variable be the set of observed variables that are connected to it in the graphical model corresponding to the marginal distribution of the observed variables, and let s be the maximum number of latent variables connected to the observed neighborhood of an observed variable. Then, we give an algorithm with time complexity [mathematical expression], which represents an improvement when s < log₂(d - 1). Furthermore, we relax some of the requirements of current algorithms on parameters of the model: specifically, on the width and on the minimum absolute-value non-zero potential.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May, 2020
Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 79-81).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
Persistent DSpace Link
