An efficient sampling scheme for dynamic generalized models
Abstract
A multimove sampling scheme for the state parameters of non-Gaussian and nonlinear dynamic models for univariate time series is proposed. This procedure follows the Bayesian framework, within a Gibbs sampling algorithm with steps of the Metropolis–Hastings algorithm. This sampling scheme combines the conjugate updating approach for generalized dynamic linear models, with the backward sampling of the state parameters used in normal dynamic linear models. A quite extensive Monte Carlo study is conducted in order to compare the results obtained using our proposed method, conjugate updating backward sampling (CUBS), with those obtained using some algorithms previously proposed in the Bayesian literature. We compare the performance of CUBS with other sampling schemes using two real datasets. Then we apply our algorithm in a stochastic volatility model. CUBS significantly reduces the computing time needed to attain convergence of the chains, and is relatively simple to implement.
Citation
@article{s._migon2013,
author = {S. Migon, Helio and M. Schmidt, Alexandra and R. Ravines,
Romy and B. M. Pereira, João},
title = {An Efficient Sampling Scheme for Dynamic Generalized Models},
journal = {Computatitonal Statistics},
volume = {28-5},
pages = {2267-2293},
date = {2013-03-01},
url = {http://link.springer.com/article/10.1007%2Fs00180-013-0406-9},
doi = {10.1007/s00180-013-0406-9},
langid = {en}
}