방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 라플라스 근사× | 마르코프 연쇄 몬테카를로 (MCMC)× | |
|---|---|---|
| 분야 | 베이지안 | 베이지안 |
| 계열 | Bayesian methods | Bayesian methods |
| 기원 연도≠ | 1986 | — |
| 창시자≠ | Pierre-Simon Laplace (1774); Bayesian formalisation: Tierney & Kadane (1986) | — |
| 유형≠ | Analytical posterior approximation | Posterior sampling algorithm |
| 원전≠ | Tierney, L. & Kadane, J. B. (1986). Accurate approximations for posterior moments and marginal densities. Journal of the American Statistical Association, 81(393), 82–86. 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 |
| 별칭≠ | Laplace's method, saddle-point approximation (Bayesian), second-order Gaussian approximation, LA | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| 관련 | 3 | 3 |
| 요약≠ | The Laplace approximation is a classical analytic technique that replaces an intractable posterior distribution with a multivariate Gaussian centred at the posterior mode, using the curvature of the log-posterior at that mode to set the covariance. Formalised for Bayesian statistics by Tierney and Kadane (1986) in their landmark Journal of the American Statistical Association paper, it provides a fast, deterministic alternative to Markov chain Monte Carlo and forms the mathematical core of Integrated Nested Laplace Approximations (INLA). | 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데이터셋 ↗ |
|
|