ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Αλγόριθμος Metropolis-Hastings×Μοντε Κάρλο Χαμιλτονιανής×
ΠεδίοΜπεϋζιανή ΣτατιστικήΜπεϋζιανή Στατιστική
ΟικογένειαBayesian methodsBayesian methods
Έτος προέλευσης19531987
ΔημιουργόςMetropolis et al. (1953); generalised by Hastings (1970)
ΤύποςMarkov chain Monte Carlo samplerGradient-based Markov chain Monte Carlo sampler
Θεμελιώδης πηγήMetropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6), 1087–1092. DOI ↗Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987). Hybrid Monte Carlo. Physics Letters B, 195(2), 216–222. DOI ↗
Εναλλακτικές ονομασίεςMH algorithm, M-H algorithm, Metropolis algorithm, Metropolis-Hastings samplerHMC, Hybrid Monte Carlo, NUTS, No-U-Turn Sampler
Συναφείς53
ΣύνοψηThe Metropolis-Hastings (MH) algorithm is a general-purpose Markov chain Monte Carlo (MCMC) method for drawing samples from any probability distribution whose density can be evaluated up to a normalising constant. Introduced by Metropolis, Rosenbluth, Rosenbluth, Teller, and Teller (1953) in computational physics and generalised by Hastings (1970) to asymmetric proposal distributions, it is the foundational algorithm from which nearly all subsequent MCMC samplers — Gibbs sampling, Hamiltonian Monte Carlo, slice sampling — are derived or can be viewed as special cases.Hamiltonian Monte Carlo (HMC) is a gradient-based Markov chain Monte Carlo algorithm that uses the geometry of the log-posterior surface to make large, informed jumps through parameter space instead of the small random steps of classical MCMC. Originally introduced for lattice field theory by Duane, Kennedy, Pendleton, and Roweth (1987) under the name Hybrid Monte Carlo, and brought into mainstream statistics by Radford Neal's authoritative 2011 chapter, HMC is today the default sampler in Stan and PyMC and is widely regarded as the state-of-the-art engine for Bayesian posterior inference in high-dimensional models.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 4 Πηγές
  3. PUBLISHED
  1. v1
  2. 3 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Metropolis-Hastings Algorithm · Hamiltonian Monte Carlo. Ανακτήθηκε στις 2026-06-19 από https://scholargate.app/el/compare