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

	Гамільтонів Монте-Карло	Метод Монте-Карло на основі ланцюгів Маркова (MCMC)
Галузь	Баєсові методи	Баєсові методи
Родина	Bayesian methods	Bayesian methods
Рік появи	1987	—
Автор методу	—	—
Тип	Gradient-based Markov chain Monte Carlo sampler	Posterior sampling algorithm
Основоположне джерело	Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987). Hybrid Monte Carlo. Physics Letters B, 195(2), 216–222.	Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A. & Rubin, D. B. (2013). Bayesian Data Analysis (3rd ed.). CRC Press. ISBN: 978-1439840955
Інші назви	HMC, Hybrid Monte Carlo, NUTS, No-U-Turn Sampler	markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo)
Пов'язані	3	3
Підсумок	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.	Markov Chain Monte Carlo (MCMC) is a family of computational algorithms for sampling from complex probability distributions, most commonly the posterior distributions that arise in Bayesian inference. Rather than computing posteriors analytically — which is rarely possible for realistic models — MCMC constructs a Markov chain whose stationary distribution is the target posterior and draws dependent samples from it, enabling full probabilistic inference for virtually any model.