ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

动态哈密顿蒙特卡洛×Gibbs Sampling×
领域贝叶斯贝叶斯
方法族Bayesian methodsBayesian methods
起源年份20141984
提出者Matthew D. Hoffman and Andrew GelmanStuart Geman & Donald Geman
类型adaptive MCMC samplerMCMC sampling algorithm
开创性文献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(1), 1593–1623. link ↗Geman, S. & Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6), 721-741. DOI ↗
别名Dynamic HMC, NUTS, No-U-Turn Sampler, adaptive HMCGibbs sampler, coordinate-wise MCMC, systematic scan Gibbs, blocked Gibbs sampling
相关55
摘要Dynamic Hamiltonian Monte Carlo — widely known as the No-U-Turn Sampler (NUTS) — is an adaptive extension of Hamiltonian Monte Carlo that automatically selects the number of leapfrog integration steps during each MCMC transition, removing the need to hand-tune the most sensitive tuning parameter of standard HMC. It is the default sampler in Stan and PyMC and is suitable for continuous, differentiable posterior distributions of moderate to high dimension.Gibbs sampling is a Markov chain Monte Carlo algorithm that approximates a high-dimensional posterior distribution by repeatedly drawing each parameter from its full conditional distribution given all other parameters and the data. Because each draw is exact from a conditional — not a proposal that may be rejected — the sampler is efficient when those conditionals are available in closed form.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Dynamic Hamiltonian Monte Carlo · Gibbs Sampling. 于 2026-06-19 检索自 https://scholargate.app/zh/compare