ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

슬라이스 샘플링×해밀토니안 몬테카를로×
분야베이지안베이지안
계열Bayesian methodsBayesian methods
기원 연도20031987
창시자Radford M. Neal
유형MCMC sampling algorithmGradient-based Markov chain Monte Carlo sampler
원전Neal, R. M. (2003). Slice sampling (with discussion). Annals of Statistics, 31(3), 705–767. DOI ↗Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987). Hybrid Monte Carlo. Physics Letters B, 195(2), 216–222. DOI ↗
별칭slice sampler, Neal slice sampler, uniform slice sampling, auxiliary variable slice samplerHMC, Hybrid Monte Carlo, NUTS, No-U-Turn Sampler
관련43
요약Slice sampling is a Markov chain Monte Carlo (MCMC) algorithm introduced by Radford M. Neal in his 2003 Annals of Statistics paper. It generates samples from a target distribution by drawing uniformly from the region under the density curve — called the 'slice' — without requiring the user to specify a step-size or proposal distribution, making it self-tuning and broadly applicable for Bayesian posterior inference.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데이터셋
  1. v1
  2. 3 출처
  3. PUBLISHED
  1. v1
  2. 3 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Slice Sampling · Hamiltonian Monte Carlo. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare