Gaussian-binary restricted Boltzmann machines for modeling natural image statistics.

We present a theoretical analysis of Gaussian-binary restricted Boltzmann machines (GRBMs) from the perspective of density models. The key aspect of this analysis is to show that GRBMs can be formulated as a constrained mixture of Gaussians, which gives a much better insight into the model's ca...

Full description

Bibliographic Details
Main Authors: Jan Melchior, Nan Wang, Laurenz Wiskott
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2017-01-01
Series:PLoS ONE
Online Access:http://europepmc.org/articles/PMC5289828?pdf=render
id doaj-61b55da4b54449c78cc36896d07d7bda
record_format Article
spelling doaj-61b55da4b54449c78cc36896d07d7bda2020-11-25T01:58:44ZengPublic Library of Science (PLoS)PLoS ONE1932-62032017-01-01122e017101510.1371/journal.pone.0171015Gaussian-binary restricted Boltzmann machines for modeling natural image statistics.Jan MelchiorNan WangLaurenz WiskottWe present a theoretical analysis of Gaussian-binary restricted Boltzmann machines (GRBMs) from the perspective of density models. The key aspect of this analysis is to show that GRBMs can be formulated as a constrained mixture of Gaussians, which gives a much better insight into the model's capabilities and limitations. We further show that GRBMs are capable of learning meaningful features without using a regularization term and that the results are comparable to those of independent component analysis. This is illustrated for both a two-dimensional blind source separation task and for modeling natural image patches. Our findings exemplify that reported difficulties in training GRBMs are due to the failure of the training algorithm rather than the model itself. Based on our analysis we derive a better training setup and show empirically that it leads to faster and more robust training of GRBMs. Finally, we compare different sampling algorithms for training GRBMs and show that Contrastive Divergence performs better than training methods that use a persistent Markov chain.http://europepmc.org/articles/PMC5289828?pdf=render
collection DOAJ
language English
format Article
sources DOAJ
author Jan Melchior
Nan Wang
Laurenz Wiskott
spellingShingle Jan Melchior
Nan Wang
Laurenz Wiskott
Gaussian-binary restricted Boltzmann machines for modeling natural image statistics.
PLoS ONE
author_facet Jan Melchior
Nan Wang
Laurenz Wiskott
author_sort Jan Melchior
title Gaussian-binary restricted Boltzmann machines for modeling natural image statistics.
title_short Gaussian-binary restricted Boltzmann machines for modeling natural image statistics.
title_full Gaussian-binary restricted Boltzmann machines for modeling natural image statistics.
title_fullStr Gaussian-binary restricted Boltzmann machines for modeling natural image statistics.
title_full_unstemmed Gaussian-binary restricted Boltzmann machines for modeling natural image statistics.
title_sort gaussian-binary restricted boltzmann machines for modeling natural image statistics.
publisher Public Library of Science (PLoS)
series PLoS ONE
issn 1932-6203
publishDate 2017-01-01
description We present a theoretical analysis of Gaussian-binary restricted Boltzmann machines (GRBMs) from the perspective of density models. The key aspect of this analysis is to show that GRBMs can be formulated as a constrained mixture of Gaussians, which gives a much better insight into the model's capabilities and limitations. We further show that GRBMs are capable of learning meaningful features without using a regularization term and that the results are comparable to those of independent component analysis. This is illustrated for both a two-dimensional blind source separation task and for modeling natural image patches. Our findings exemplify that reported difficulties in training GRBMs are due to the failure of the training algorithm rather than the model itself. Based on our analysis we derive a better training setup and show empirically that it leads to faster and more robust training of GRBMs. Finally, we compare different sampling algorithms for training GRBMs and show that Contrastive Divergence performs better than training methods that use a persistent Markov chain.
url http://europepmc.org/articles/PMC5289828?pdf=render
work_keys_str_mv AT janmelchior gaussianbinaryrestrictedboltzmannmachinesformodelingnaturalimagestatistics
AT nanwang gaussianbinaryrestrictedboltzmannmachinesformodelingnaturalimagestatistics
AT laurenzwiskott gaussianbinaryrestrictedboltzmannmachinesformodelingnaturalimagestatistics
_version_ 1724968620687097856