Porównaj metody

	Dynamiczny algorytm Metropolisa-Hastingsa	Dynamic Bayesian Inference
Dziedzina	Statystyka bayesowska	Statystyka bayesowska
Rodzina	Bayesian methods	Bayesian methods
Rok powstania	1970 (algorithm); 1992 (dynamic application)	1989–1997
Twórca	W. K. Hastings (algorithm); applied to dynamic models by Carlin, Polson & Stoffer	West & Harrison (dynamic linear models); Dean & Kanazawa (dynamic Bayesian networks)
Typ	Bayesian MCMC sampler for dynamic models	Bayesian sequential / online inference framework
Źródło pierwotne	Hastings, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57(1), 97–109.	West, M. & Harrison, J. (1997). Bayesian Forecasting and Dynamic Models (2nd ed.). Springer. ISBN: 978-0387947259
Inne nazwy	Dynamic MH, MH for state-space models, Metropolis-Hastings in dynamic models, time-varying parameter MH	online Bayesian inference, sequential Bayesian updating, recursive Bayesian estimation, dynamic Bayesian updating
Pokrewne	5	6
Podsumowanie	The 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.	Dynamic Bayesian inference is a framework for performing Bayesian updating sequentially as new observations arrive over time. Rather than fitting a static model to a fixed dataset, it tracks how a posterior distribution over latent states or parameters evolves step by step, combining a prior with each new likelihood to produce an updated posterior that propagates forward through time.