השוואת שיטות

	דגימת No-U-Turn (NUTS)	המילטוניאן מונטה קרלו
תחום	בייסיאני	בייסיאני
משפחה	Bayesian methods	Bayesian methods
שנת המקור	2014	1987
הוגה השיטה	Matthew D. Hoffman & Andrew Gelman	—
סוג	Sampling algorithm (MCMC)	Gradient-based Markov chain Monte Carlo sampler
מקור מכונן	Hoffman, M. D., & Gelman, A. (2014). The No-U-Turn Sampler: Adaptively setting path lengths in Hamiltonian Monte Carlo. Journal of Machine Learning Research, 15(47), 1593–1623.	Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987). Hybrid Monte Carlo. Physics Letters B, 195(2), 216–222.
כינויים	NUTS, No-U-Turn HMC, adaptive Hamiltonian Monte Carlo, self-tuning HMC	HMC, Hybrid Monte Carlo, NUTS, No-U-Turn Sampler
קשורות	4	3
תקציר	The No-U-Turn Sampler (NUTS) is a self-tuning Markov chain Monte Carlo algorithm introduced by Hoffman and Gelman (2014) that extends Hamiltonian Monte Carlo (HMC) by automatically determining the optimal number of leapfrog steps, eliminating the most sensitive manual tuning parameter. NUTS is the default sampler in Stan and PyMC and has made large-scale, high-dimensional Bayesian inference practically accessible without requiring users to set trajectory lengths by hand.	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.