ScholarGate
Assistente

Comparar métodos

Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.

Dynamic Metropolis-Hastings Algorithm×Algoritmo de Metropolis-Hastings×
ÁreaBayesianoBayesiano
FamíliaBayesian methodsBayesian methods
Ano de origem1970 (algorithm); 1992 (dynamic application)1953
Autor originalW. K. Hastings (algorithm); applied to dynamic models by Carlin, Polson & StofferMetropolis et al. (1953); generalised by Hastings (1970)
TipoBayesian MCMC sampler for dynamic modelsMarkov chain Monte Carlo sampler
Fonte seminalHastings, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57(1), 97–109. DOI ↗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 ↗
Outros nomesDynamic MH, MH for state-space models, Metropolis-Hastings in dynamic models, time-varying parameter MHMH algorithm, M-H algorithm, Metropolis algorithm, Metropolis-Hastings sampler
Relacionados55
ResumoThe Dynamic Metropolis-Hastings (Dynamic MH) algorithm applies the Metropolis-Hastings MCMC sampler to Bayesian state-space and time-varying parameter models. At each time step, latent states or evolving parameters are updated via proposal-and-accept moves, yielding full posterior distributions over trajectories rather than single filtered estimates.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.
ScholarGateConjunto de dados
  1. v1
  2. 2 Fontes
  3. PUBLISHED
  1. v1
  2. 4 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

ScholarGateComparar métodos: Dynamic Metropolis-Hastings Algorithm · Metropolis-Hastings Algorithm. Recuperado em 2026-06-17 de https://scholargate.app/pt/compare