ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

ロバストMCMC(Robust Markov Chain Monte Carlo)×Gibbs Sampling×
分野ベイズベイズ
系統Bayesian methodsBayesian methods
提唱年2000s–2010s1984
提唱者Roberts, Rosenthal and colleagues; extended by Atchade, Barp, Girolami and othersStuart Geman & Donald Geman
種類Bayesian computational samplingMCMC sampling algorithm
原典Roberts, G. O. & Rosenthal, J. S. (2004). General state space Markov chains and MCMC algorithms. Probability Surveys, 1, 20–71. DOI ↗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 ↗
別名robust MCMC, outlier-robust MCMC, robust posterior sampling, misspecification-robust MCMCGibbs sampler, coordinate-wise MCMC, systematic scan Gibbs, blocked Gibbs sampling
関連55
概要Robust MCMC combines Markov chain Monte Carlo sampling with robustness techniques to produce reliable posterior inference when data contain outliers, when the assumed model is misspecified, or when the target distribution has heavy tails that cause standard samplers to mix poorly or yield distorted estimates.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手法を比較: Robust Markov chain Monte Carlo · Gibbs Sampling. 2026-06-18に以下より取得 https://scholargate.app/ja/compare