Estimation in hidden Markov models via efficient importance sampling

Details Estimation in hidden Markov models via efficient importance sampling Estimation in hidden Markov models via efficient importance sampling

2007-08-30

arxiv.org/abs/0708.4152v1

Bernoulli 2007, Vol. 13, No. 2, 492-513

Statistics

Computation

Published at http://dx.doi.org/10.3150/07--BEJ5163 in the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statis

Scientific paper

10.3150/07--BEJ5163

Given a sequence of observations from a discrete-time, finite-state hidden Markov model, we would like to estimate the sampling distribution of a statistic. The bootstrap method is employed to approximate the confidence regions of a multi-dimensional parameter. We propose an importance sampling formula for efficient simulation in this context. Our approach consists of constructing a locally asymptotically normal (LAN) family of probability distributions around the default resampling rule and then minimizing the asymptotic variance within the LAN family. The solution of this minimization problem characterizes the asymptotically optimal resampling scheme, which is given by a tilting formula. The implementation of the tilting formula is facilitated by solving a Poisson equation. A few numerical examples are given to demonstrate the efficiency of the proposed importance sampling scheme.

Affiliated with

Also associated with

No associations

Rating

Estimation in hidden Markov models via efficient importance sampling 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 Estimation in hidden Markov models via efficient importance sampling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimation in hidden Markov models via efficient importance sampling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-206029