no code implementations • 10 Jan 2013 • Nando de Freitas, Pedro Hojen-Sorensen, Michael. I. Jordan, Stuart Russell
One of these algorithms is a mixture of two MCMC kernels: a random walk Metropolis kernel and a blockMetropolis-Hastings (MH) kernel with a variational approximation as proposaldistribution.