Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| Многостепенен Хамилтонов Монте Карло× | Марковски Монте Карло вериги (MCMC)× | |
|---|---|---|
| Област≠ | Бейсови методи | Симулационно моделиране |
| Семейство≠ | Bayesian methods | Process / pipeline |
| Година на възникване≠ | 2010s | 1953 (Metropolis-Hastings); 1984 (Gibbs) |
| Създател≠ | Beskos, Jasra, Law, Tempone, Zhou (multilevel MCMC); Neal (HMC component) | Metropolis et al. (1953); Gibbs sampler formalised by Geman & Geman (1984) |
| Тип≠ | Bayesian computational sampler | Simulation-based Bayesian inference / numerical integration |
| Основополагащ източник≠ | Beskos, A., Jasra, A., Law, K., Tempone, R., & Zhou, Y. (2017). Multilevel sequential Monte Carlo samplers. Stochastic Processes and their Applications, 127(5), 1417–1440. DOI ↗ | Gelman, A., Carlin, J.B., Stern, H.S., Dunson, D.B., Vehtari, A. & Rubin, D.B. (2013). Bayesian Data Analysis (3rd ed.). Chapman & Hall/CRC. DOI ↗ |
| Други названия | Multilevel HMC, MLHMC, multilevel HMC sampler, multilevel leapfrog MCMC | MCMC, Metropolis-Hastings, Gibbs sampling, Markov Zinciri Monte Carlo (MCMC — Metropolis-Hastings, Gibbs) |
| Свързани | 5 | 5 |
| Резюме≠ | Multilevel Hamiltonian Monte Carlo (Multilevel HMC) combines the variance-reduction strategy of multilevel Monte Carlo with the efficient gradient-driven exploration of Hamiltonian Monte Carlo. By running coupled HMC chains at increasing levels of model fidelity or discretisation, it achieves accurate posterior estimates at a computational cost substantially lower than a single fine-level HMC chain. | Markov Chain Monte Carlo (MCMC) is a family of simulation algorithms that constructs a Markov chain whose stationary distribution is the target posterior, enabling Bayesian inference and high-dimensional integral computation that would otherwise be analytically intractable. Pioneered by Metropolis and colleagues in 1953 and extended by Hastings in 1970, MCMC underpins modern Bayesian statistics. The two most widely used variants are Metropolis-Hastings, which proposes moves from a general proposal distribution, and Gibbs sampling, which draws each parameter in turn from its full conditional distribution. |
| ScholarGateНабор от данни ↗ |
|
|