Accurate and Conservative Estimates of MRF Log-likelihood using Reverse Annealing

12/30/2014
by   Yuri Burda, et al.
0

Markov random fields (MRFs) are difficult to evaluate as generative models because computing the test log-probabilities requires the intractable partition function. Annealed importance sampling (AIS) is widely used to estimate MRF partition functions, and often yields quite accurate results. However, AIS is prone to overestimate the log-likelihood with little indication that anything is wrong. We present the Reverse AIS Estimator (RAISE), a stochastic lower bound on the log-likelihood of an approximation to the original MRF model. RAISE requires only the same MCMC transition operators as standard AIS. Experimental results indicate that RAISE agrees closely with AIS log-probability estimates for RBMs, DBMs, and DBNs, but typically errs on the side of underestimating, rather than overestimating, the log-likelihood.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/08/2015

Empirical Analysis of Sampling Based Estimators for Evaluating RBMs

The Restricted Boltzmann Machines (RBM) can be used either as classifier...
research
06/19/2022

Bounding Evidence and Estimating Log-Likelihood in VAE

Many crucial problems in deep learning and statistics are caused by a va...
research
08/18/2016

Parameter Learning for Log-supermodular Distributions

We consider log-supermodular models on binary variables, which are proba...
research
09/24/2019

Numerical evaluation of the transition probability of the simple birth-and-death process

The simple (linear) birth-and-death process is a widely used stochastic ...
research
05/09/2012

Products of Hidden Markov Models: It Takes N>1 to Tango

Products of Hidden Markov Models(PoHMMs) are an interesting class of gen...
research
12/01/2022

Learning Combinatorial Structures via Markov Random Fields with Sampling through Lovász Local Lemma

Generative models for learning combinatorial structures have transformat...
research
02/05/2021

Multi-Sample Online Learning for Spiking Neural Networks based on Generalized Expectation Maximization

Spiking Neural Networks (SNNs) offer a novel computational paradigm that...

Please sign up or login with your details

Forgot password? Click here to reset