Everything About ___
Live briefing

Everything about Gibbs sampling

Monte Carlo algorithm

In statistics, Gibbs sampling or a Gibbs sampler, also known in statistical mechanics as the heat bath algorithm, is a Markov chain Monte Carlo (MCMC) algorithm for sampling from a specified multivariate probability distribution when direct sampling from the joint distribution is difficult, but sampling from the conditional distribution is more practical. This sequence can be used to approximate the joint distribution ; to approximate the marginal distribution of one of the variables, or some subset of the variables ; or to compute an integral. Typically, some of the variables correspond to observations whose values are known, and hence do not need to be sampled. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Gibbs samplingA 5-minute orientation
  2. Skim a recent paper: Linear Complexity Gibbs Sampling for Generalized Labeled Multi-Bernoulli FilteringInfluential work since 2022
  3. Pick up a classic book: Contemporary musiciansThe most-reprinted book on the subject
  4. Read the landmark paper: Variable Selection via Gibbs SamplingCited 1,999 times
  5. Go sideways: Bayesian statisticsA closely related topic
  6. Go sideways: Laplace's approximationA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics