ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

هاميلتون مونت كارلو الديناميكي×أخذ العينات بطريقة جيبس×
المجالبايزيبايزي
العائلة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/ar/compare