방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Robust Gibbs Sampling× | 깁스 샘플링(Gibbs Sampling)× | |
|---|---|---|
| 분야 | 베이지안 | 베이지안 |
| 계열 | Bayesian methods | Bayesian methods |
| 기원 연도≠ | 1984–1993 | 1984 |
| 창시자≠ | Stuart Geman & Donald Geman (Gibbs sampler, 1984); robustness extensions developed through 1990s Bayesian literature | Stuart Geman & Donald Geman |
| 유형≠ | Robust MCMC sampler | MCMC sampling algorithm |
| 원전≠ | Geweke, J. (1993). Bayesian treatment of the independent Student-t linear model. Journal of Applied Econometrics, 8(S1), S19–S40. 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 Gibbs sampler, outlier-resistant Gibbs sampling, heavy-tailed Gibbs sampler, robust block Gibbs | Gibbs sampler, coordinate-wise MCMC, systematic scan Gibbs, blocked Gibbs sampling |
| 관련≠ | 4 | 5 |
| 요약≠ | Robust Gibbs sampling is a Markov chain Monte Carlo strategy that pairs the coordinate-wise Gibbs sampler with heavy-tailed or outlier-resistant model specifications — most commonly Student-t likelihoods — so that the posterior inference is not distorted by extreme observations. It achieves robustness through data augmentation: each observation receives a latent variance weight that automatically down-weights outliers during each sampling sweep. | 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데이터셋 ↗ |
|
|