Sequential Monte Carlo smoothing for general state space hidden Markov models

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published in at http://dx.doi.org/10.1214/10-AAP735 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Inst

Scientific paper

10.1214/10-AAP735

Computing smoothing distributions, the distributions of one or more states conditional on past, present, and future observations is a recurring problem when operating on general hidden Markov models. The aim of this paper is to provide a foundation of particle-based approximation of such distributions and to analyze, in a common unifying framework, different schemes producing such approximations. In this setting, general convergence results, including exponential deviation inequalities and central limit theorems, are established. In particular, time uniform bounds on the marginal smoothing error are obtained under appropriate mixing conditions on the transition kernel of the latent chain. In addition, we propose an algorithm approximating the joint smoothing distribution at a cost that grows only linearly with the number of particles.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Sequential Monte Carlo smoothing for general state space hidden Markov models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sequential Monte Carlo smoothing for general state space hidden Markov models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sequential Monte Carlo smoothing for general state space hidden Markov models will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-88696

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.