English

Empirical Analysis of Sampling Based Estimators for Evaluating RBMs

Machine Learning 2015-10-09 v1 Machine Learning

Abstract

The Restricted Boltzmann Machines (RBM) can be used either as classifiers or as generative models. The quality of the generative RBM is measured through the average log-likelihood on test data. Due to the high computational complexity of evaluating the partition function, exact calculation of test log-likelihood is very difficult. In recent years some estimation methods are suggested for approximate computation of test log-likelihood. In this paper we present an empirical comparison of the main estimation methods, namely, the AIS algorithm for estimating the partition function, the CSL method for directly estimating the log-likelihood, and the RAISE algorithm that combines these two ideas. We use the MNIST data set to learn the RBM and then compare these methods for estimating the test log-likelihood.

Keywords

Cite

@article{arxiv.1510.02255,
  title  = {Empirical Analysis of Sampling Based Estimators for Evaluating RBMs},
  author = {Vidyadhar Upadhya and P. S. Sastry},
  journal= {arXiv preprint arXiv:1510.02255},
  year   = {2015}
}

Comments

edited version of this manuscript will appear in proceedings of International Conference on Neural Information Processing (ICONIP) 2015

R2 v1 2026-06-22T11:15:34.377Z