Please use this identifier to cite or link to this item:
|Title:||Approximate Bayesian Computation for Smoothing||Authors:||Martin, J.S.
Del Moral, P.
|Keywords:||Approximate Bayesian Computation
Hidden Markov models
Sequential Monte Carlo
|Issue Date:||2014||Citation:||Martin, J.S., Jasra, A., Singh, S.S., Whiteley, N., Del Moral, P., McCoy, E. (2014). Approximate Bayesian Computation for Smoothing. Stochastic Analysis and Applications 32 (3) : 397-420. ScholarBank@NUS Repository. https://doi.org/10.1080/07362994.2013.879262||Abstract:||We consider a method for approximate inference in hidden Markov models (HMMs). The method circumvents the need to evaluate conditional densities of observations given the hidden states. It may be considered an instance of Approximate Bayesian Computation (ABC) and it involves the introduction of auxiliary variables valued in the same space as the observations. The quality of the approximation may be controlled to arbitrary precision through a parameter ε > 0. We provide theoretical results which quantify, in terms of ε, the ABC error in approximation of expectations of additive functionals with respect to the smoothing distributions. Under regularity assumptions, this error is, where n is the number of time steps over which smoothing is performed. For numerical implementation, we adopt the forward-only sequential Monte Carlo (SMC) scheme of  and quantify the combined error from the ABC and SMC approximations. This forms some of the first quantitative results for ABC methods which jointly treat the ABC and simulation errors, with a finite number of data and simulated samples. © Taylor & Francis Group, LLC.||Source Title:||Stochastic Analysis and Applications||URI:||http://scholarbank.nus.edu.sg/handle/10635/125048||ISSN:||15329356||DOI:||10.1080/07362994.2013.879262|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 28, 2023
WEB OF SCIENCETM
checked on Jan 19, 2023
checked on Jan 26, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.