In Bayesian inference, a finite parameter space has posterior probabilities , with the product of the prior probability and likelihood and the evidence. Although each weight may be easy to evaluate, summing a large parameter space can be impractical. The Metropolis–Hastings algorithm constructs a Markov chain with posterior stationary distribution, allowing posterior expectations, probabilities and credible regions to be estimated from its trajectory. Its acceptance ratios cancel , so direct enumeration of the normalizing constant is unnecessary. Posterior sampling alone does not automatically provide the evidence for comparing models.
Articles by others on the same topic
There are currently no matching articles.