Machine Learning, Variational Inference, Bayesian Statistics, Artificial Intelligence.
Metropolis-Hastings (MH) is a specific type of (MCMC) algorithm ubiquitously used in approximate inference. The idea is to build a chain of samples with a proposal distribution that selects “the next” sample based only on the “the current” sample (remember the Markov principle). Proposed samples