15 search results - page 1 / 3 » Learning with Blocks: Composite Likelihood and Contrastive D... |
JMLR
2010
13 years 5 months ago
2010
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
A new algorithm for training Restricted Boltzmann Machines is introduced. The algorithm, named Persistent Contrastive Divergence, is different from the standard Contrastive Diverg...
ICML
2010
IEEE
13 years 12 months ago
2010
IEEE
Learning undirected graphical models such as Markov random fields is an important machine learning task with applications in many domains. Since it is usually intractable to learn...
NIPS
2003
14 years 6 days ago
2003
In models that define probabilities via energies, maximum likelihood learning typically involves using Markov Chain Monte Carlo to sample from the model’s distribution. If the ...
ICML
2010
IEEE
13 years 12 months ago
2010
IEEE
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...