Methods › General › Markov Chain Monte Carlo › Metropolis Hastings
Metropolis Hastings
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Metropolis-Hastings is a Markov Chain Monte Carlo (MCMC) algorithm for approximate inference. It allows for sampling from a probability distribution where direct sampling is difficult - usually owing to the presence of an intractable integral.
M-H consists of a proposal distribution q(θ^’|θ) to draw a parameter value. To decide whether θ^’ is accepted or rejected, we then calculate a ratio:
(p(θ^’|D))/(p(θ|D))
We then draw a random number r ∈[0, 1] and accept if it is under the ratio, reject otherwise. If we accept, we set θᵢ = θ^’ and repeat.
By the end we have a sample of θ values that we can use to form quantities over an approximate posterior, such as the expectation and uncertainty bounds. In practice, we typically have a period of tuning to achieve an acceptable acceptance ratio for the algorithm, as well as a warmup period to reduce bias towards initialization values.
Image: Samuel Hudec
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: Entropy-Cut Metropolis-Hastings; Metropolis-Hastings Diffusion Distance; Independent Metropolis-Hastings sampler; Metropolis-Hastings with Lévy Jumps (MHLJ); Metropolis-Hastings through LLM Proposals (MHLP); Propose-and-Project Metropolis-Hastings (PDL-PPMH) sampler; Metropolis-Hastings Sampling for 3D Gaussian Reconstruction; Metropolis-corrected samplers.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 10 · with a code link: 2 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 10 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 10 of 10, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
AdvNF: Reducing Mode Collapse in Conditional Normalising Flows using Adversarial Learning 29 Jan 2024 · 0 repositories · arXiv:2401.15948
-
Binary classification based Monte Carlo simulation 29 Jul 2023 · 0 repositories · arXiv:2307.16035
-
Data Subsampling for Bayesian Neural Networks 17 Oct 2022 · 1 repository · arXiv:2210.09141
-
A Two-step Metropolis Hastings Method for Bayesian Empirical Likelihood Computation with Application to Bayesian Model Selection 2 Sep 2022 · 0 repositories · arXiv:2209.01269
-
Mix and Match: Learning-free Controllable Text Generationusing Energy Language Models 16 Nov 2021 · 0 repositories
-
Subsampling Generative Adversarial Networks: Density Ratio Estimation in Feature Space with Softplus Loss 24 Sep 2019 · 1 repository · arXiv:1909.10670Syntology official: harvested, nothing ran · 0 ran · 1 unverified (of 1 harvested sample)
-
Hawkes Processes with Stochastic Excitations 22 Sep 2016 · 0 repositories · arXiv:1609.06831
-
C3: Lightweight Incrementalized MCMC for Probabilistic Programs using Continuations and Callsite Caching 7 Sep 2015 · 0 repositories · arXiv:1509.02151
-
Neural Adaptive Sequential Monte Carlo 10 Jun 2015 · 0 repositories · arXiv:1506.03338
-
GPS-ABC: Gaussian Process Surrogate Approximate Bayesian Computation 13 Jan 2014 · 0 repositories · arXiv:1401.2838
Tasks archive 2025-07-28
15 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections