ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

稳健马尔可夫链蒙特卡洛 (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-19 检索自 https://scholargate.app/zh/compare