方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 稳健马尔可夫链蒙特卡洛 (Robust Markov Chain Monte Carlo)× | 马尔可夫链蒙特卡洛 (MCMC)× | |
|---|---|---|
| 领域 | 贝叶斯 | 贝叶斯 |
| 方法族 | Bayesian methods | Bayesian methods |
| 起源年份≠ | 2000s–2010s | — |
| 提出者≠ | Roberts, Rosenthal and colleagues; extended by Atchade, Barp, Girolami and others | — |
| 类型≠ | Bayesian computational sampling | Posterior sampling algorithm |
| 开创性文献≠ | Roberts, G. O. & Rosenthal, J. S. (2004). General state space Markov chains and MCMC algorithms. Probability Surveys, 1, 20–71. DOI ↗ | Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A. & Rubin, D. B. (2013). Bayesian Data Analysis (3rd ed.). CRC Press. ISBN: 978-1439840955 |
| 别名≠ | robust MCMC, outlier-robust MCMC, robust posterior sampling, misspecification-robust MCMC | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| 相关≠ | 5 | 3 |
| 摘要≠ | 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. | Markov Chain Monte Carlo (MCMC) is a family of computational algorithms for sampling from complex probability distributions, most commonly the posterior distributions that arise in Bayesian inference. Rather than computing posteriors analytically — which is rarely possible for realistic models — MCMC constructs a Markov chain whose stationary distribution is the target posterior and draws dependent samples from it, enabling full probabilistic inference for virtually any model. |
| ScholarGate数据集 ↗ |
|
|