Порівняння методів

	Алгоритм Метрополіса-Гастінгса	Гамільтонів Монте-Карло
Галузь	Баєсові методи	Баєсові методи
Родина	Bayesian methods	Bayesian methods
Рік появи	1953	1987
Автор методу	Metropolis et al. (1953); generalised by Hastings (1970)	—
Тип	Markov chain Monte Carlo sampler	Gradient-based Markov chain Monte Carlo sampler
Основоположне джерело	Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6), 1087–1092.	Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987). Hybrid Monte Carlo. Physics Letters B, 195(2), 216–222.
Інші назви	MH algorithm, M-H algorithm, Metropolis algorithm, Metropolis-Hastings sampler	HMC, Hybrid Monte Carlo, NUTS, No-U-Turn Sampler
Пов'язані	5	3
Підсумок	The Metropolis-Hastings (MH) algorithm is a general-purpose Markov chain Monte Carlo (MCMC) method for drawing samples from any probability distribution whose density can be evaluated up to a normalising constant. Introduced by Metropolis, Rosenbluth, Rosenbluth, Teller, and Teller (1953) in computational physics and generalised by Hastings (1970) to asymmetric proposal distributions, it is the foundational algorithm from which nearly all subsequent MCMC samplers — Gibbs sampling, Hamiltonian Monte Carlo, slice sampling — are derived or can be viewed as special cases.	Hamiltonian Monte Carlo (HMC) is a gradient-based Markov chain Monte Carlo algorithm that uses the geometry of the log-posterior surface to make large, informed jumps through parameter space instead of the small random steps of classical MCMC. Originally introduced for lattice field theory by Duane, Kennedy, Pendleton, and Roweth (1987) under the name Hybrid Monte Carlo, and brought into mainstream statistics by Radford Neal's authoritative 2011 chapter, HMC is today the default sampler in Stan and PyMC and is widely regarded as the state-of-the-art engine for Bayesian posterior inference in high-dimensional models.