Compară metode

	Hamiltonian Monte Carlo Ierarhic	Hamiltonian Monte Carlo
Domeniu	Bayesian	Bayesian
Familie	Bayesian methods	Bayesian methods
Anul apariției	2015	1987
Autorul original	Betancourt & Girolami	—
Tip	Bayesian sampling algorithm	Gradient-based Markov chain Monte Carlo sampler
Sursa seminală	Betancourt, M. & Girolami, M. (2015). Hamiltonian Monte Carlo for hierarchical models. In S. K. Upadhyay, U. Singh, D. K. Dey & A. Loganathan (Eds.), Current Trends in Bayesian Methodology with Applications (pp. 79-101). CRC Press.	Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987). Hybrid Monte Carlo. Physics Letters B, 195(2), 216–222.
Denumiri alternative	Hierarchical HMC, HMC for hierarchical models, HMC with reparameterization, NUTS for hierarchical Bayesian models	HMC, Hybrid Monte Carlo, NUTS, No-U-Turn Sampler
Înrudite	5	3
Rezumat	Hierarchical Hamiltonian Monte Carlo (Hierarchical HMC) applies Hamiltonian Monte Carlo sampling to Bayesian hierarchical models, addressing the severe geometric challenges those models pose. By combining non-centered parameterizations with HMC's gradient-driven proposals, it achieves efficient posterior exploration of the multi-level funnel-shaped geometries that standard MCMC methods struggle with.	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.