Approximate Bayesian Computation for a Class of Time Series Models
arXiv:1401.0265
Abstract
In the following article we consider approximate Bayesian computation (ABC) for certain classes of time series models. In particular, we focus upon scenarios where the likelihoods of the observations and parameter are intractable, by which we mean that one cannot evaluate the likelihood even up-to a positive unbiased estimate. This paper reviews and develops a class of approximation procedures based upon the idea of ABC, but, specifically maintains the probabilistic structure of the original statistical model. This idea is useful, in that it can facilitate an analysis of the bias of the approximation and the adaptation of established computational methods for parameter inference. Several existing results in the literature are surveyed and novel developments with regards to computation are given.
References in corpus (7)
- Expectation Propagation for approximate Bayesian inference
- Approximate Bayesian computation (ABC) gives exact results under the assumption of model error
- On the efficiency of pseudo-marginal random walk Metropolis algorithms
- Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
- On Disturbance State-Space Models and the Particle Marginal Metropolis-Hastings Sampler
- Asymptotic Behaviour of Approximate Bayesian Estimators
- Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator