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-18に以下より取得 https://scholargate.app/ja/compare