方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 无掉头采样器 (NUTS)× | Hamiltonian Monte Carlo× | |
|---|---|---|
| 领域 | 贝叶斯 | 贝叶斯 |
| 方法族 | 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. link ↗ | Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987). Hybrid Monte Carlo. Physics Letters B, 195(2), 216–222. DOI ↗ |
| 别名≠ | 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. |
| ScholarGate数据集 ↗ |
|
|