Variational MCMC
We propose a new class of learning algorithms that combines variational approximation and Markov chain Monte Carlo (MCMC) simulation. Naive algorithms that use the variational approximation as proposal distribution can perform poorly because this approximation tends to underestimate the true varianc...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
Morgan Kaufmann
2001
|