Exact and Approximate Bayesian Inference for Low Integer-Valued Time Series Models with Intractable Likelihoods
Exact and Approximate Bayesian Inference for Low Integer-Valued Time Series Models with Intractable Likelihoods
复制标题
DOI:
10.1214/15-ba950
复制
发表时间:
2016-06
影响因子:
4.4
通讯作者:
C. Drovandi;A. Pettitt;Roy A. McCutchan
中科院分区:
文献类型:
--
作者:
C. Drovandi;A. Pettitt;Roy A. McCutchan
In this paper we present a new simulation methodology in order to obtain exact or approximate Bayesian inference for models for low-valued count time series data that have computationally demanding likelihood functions. The algorithm fits within the framework of particle Markov chain Monte Carlo (PMCMC) methods. The particle filter requires only model simulations and, in this regard, our approach has connections with approximate Bayesian computation (ABC). However, an advantage of using the PMCMC approach in this setting is that simulated data can be matched with data observed one-at-a-time, rather than attempting to match on the full dataset simultaneously or on a low-dimensional non-sufficient summary statistic, which is common practice in ABC. For low-valued count time series data we find that it is often computationally feasible to match simulated data with observed data exactly. Our particle filter maintains $N$ particles by repeating the simulation until $N+1$ exact matches are obtained. Our algorithm creates an unbiased estimate of the likelihood, resulting in exact posterior inferences when included in an MCMC algorithm. In cases where exact matching is computationally prohibitive, a tolerance is introduced as per ABC. A novel aspect of our approach is that we introduce auxiliary variables into our particle filter so that partially observed and/or non-Markovian models can be accommodated. We demonstrate that Bayesian model choice problems can be easily handled in this framework.