MCMC using Hamiltonian dynamics¶
Neal, R. M. (2011). MCMC using Hamiltonian dynamics. Handbook of Markov Chain Monte Carlo.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Monte Carlo Simulation
- T4 — General-purpose simplicity vs specialized-algorithm performance. The vanilla Metropolis-Hastings algorithm is broadly applicable but often inefficient for high-dimensional or complex targets; specialized algorithms (Hamiltonian Monte Carlo for smooth high-dimensional targets, slice sampling, reversible-jump MCMC for trans-dimensional models, particle filters for state-space models) can dramatically improve convergence but require domain expertise to choose and tune
This sourceNeal HMC gradient-informed proposal high-dimensional efficiency.
- T4 — General-purpose simplicity vs specialized-algorithm performance. The vanilla Metropolis-Hastings algorithm is broadly applicable but often inefficient for high-dimensional or complex targets; specialized algorithms (Hamiltonian Monte Carlo for smooth high-dimensional targets, slice sampling, reversible-jump MCMC for trans-dimensional models, particle filters for state-space models) can dramatically improve convergence but require domain expertise to choose and tune
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:6d93b92ddb61 · see in the full table