Sammenlign metoder

	Gibbs Sampling	Variationsinferens
Fagområde	Bayesiansk	Bayesiansk
Familie	Bayesian methods	Bayesian methods
Oprindelsesår	1984	1999
Ophavsperson	Stuart Geman & Donald Geman	Jordan, Ghahramani, Jaakkola & Saul
Type	MCMC sampling algorithm	Approximate Bayesian inference
Oprindelig kilde	Geman, S. & Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6), 721-741.	Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999). An introduction to variational methods for graphical models. Machine Learning, 37(2), 183–233.
Aliasser	Gibbs sampler, coordinate-wise MCMC, systematic scan Gibbs, blocked Gibbs sampling	VI, variational Bayes, VB, mean-field variational inference
Relaterede	5	4
Resumé	Gibbs sampling is a Markov chain Monte Carlo algorithm that approximates a high-dimensional posterior distribution by repeatedly drawing each parameter from its full conditional distribution given all other parameters and the data. Because each draw is exact from a conditional — not a proposal that may be rejected — the sampler is efficient when those conditionals are available in closed form.	Variational inference (VI) is a family of techniques that turn Bayesian posterior computation into an optimisation problem. Instead of drawing samples from the exact posterior — as Markov chain Monte Carlo does — VI posits a simpler, tractable family of distributions and finds the member of that family closest to the true posterior by maximising the evidence lower bound (ELBO). Introduced in its modern graphical-model form by Jordan, Ghahramani, Jaakkola and Saul (1999) and given a comprehensive statistical treatment by Blei, Kucukelbir and McAuliffe (2017), VI is now the standard scalable inference engine in probabilistic machine learning.