Editor: Typical dimensionality reduction methods focus on directly reducing the number of ran-dom variables while retaining maximal variations in the data. In this paper, we consider the dimensionality reduction in parameter spaces of binary multivariate distributions. We propose a general Confident-Information-First (CIF) principle to maximally preserve pa-rameters with confident estimates and rule out unreliable or noisy parameters. Formally, the confidence of a parameter can be assessed by its Fisher information, which establishes a connection with the inverse variance of any unbiased estimate for the parameter via the Cramér-Rao bound. We then revisit Boltzmann machines (BM) and theoretically show that both single-layer BM without hidd...
Exact inference for Boltzmann machines is computationally expensive. One approach to improving tract...
We investigate the problem of estimating the density function of multivari-ate binary data. In parti...
This paper examines the question: What kinds of distributions can be efficiently represented by Rest...
Typical dimensionality reduction (DR) methods are data-oriented, focusing on directly reducing the n...
The principle of extreme physical information (EPI) can be used to derive many known laws and distri...
The principle of extreme physical information (EPI) can be used to derive many known laws and distri...
The principle of extreme physical information (EPI) can be used to derive many known laws and distri...
We explore the training and usage of the Restricted Boltzmann Machine for unsupervised feature extra...
In this study, we provide a direct comparison of the Stochastic Maximum Likelihood algorithm and Con...
In this thesis we asses the consistency and convexity of the parameter inference in Boltzmann machin...
Restricted Boltzmann Machines (RBMs) are general unsupervised learning devices to ascertain generati...
Deep Belief Networks (DBN’s) are generative models that contain many layers of hidden vari-ables. Ef...
Abstract. Learning algorithms relying on Gibbs sampling based stochas-tic approximations of the log-...
We present a new learning algorithm for Boltzmann Machines that contain many layers of hidden variab...
The RBM is a stochastic energy-based model of an unsupervised neural network (RBM). RBM is a key pre...
Exact inference for Boltzmann machines is computationally expensive. One approach to improving tract...
We investigate the problem of estimating the density function of multivari-ate binary data. In parti...
This paper examines the question: What kinds of distributions can be efficiently represented by Rest...
Typical dimensionality reduction (DR) methods are data-oriented, focusing on directly reducing the n...
The principle of extreme physical information (EPI) can be used to derive many known laws and distri...
The principle of extreme physical information (EPI) can be used to derive many known laws and distri...
The principle of extreme physical information (EPI) can be used to derive many known laws and distri...
We explore the training and usage of the Restricted Boltzmann Machine for unsupervised feature extra...
In this study, we provide a direct comparison of the Stochastic Maximum Likelihood algorithm and Con...
In this thesis we asses the consistency and convexity of the parameter inference in Boltzmann machin...
Restricted Boltzmann Machines (RBMs) are general unsupervised learning devices to ascertain generati...
Deep Belief Networks (DBN’s) are generative models that contain many layers of hidden vari-ables. Ef...
Abstract. Learning algorithms relying on Gibbs sampling based stochas-tic approximations of the log-...
We present a new learning algorithm for Boltzmann Machines that contain many layers of hidden variab...
The RBM is a stochastic energy-based model of an unsupervised neural network (RBM). RBM is a key pre...
Exact inference for Boltzmann machines is computationally expensive. One approach to improving tract...
We investigate the problem of estimating the density function of multivari-ate binary data. In parti...
This paper examines the question: What kinds of distributions can be efficiently represented by Rest...