Pith. sign in

REVIEW

Efficient parameter inference in general hidden Markov models using the filter derivatives

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1601.05568 v2 pith:6NMMKHNF submitted 2016-01-21 stat.CO

classification stat.CO
keywords algorithmgeneralhiddenmarkovmodelscomplexitycomputationalderivatives
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Estimating online the parameters of general state-space hidden Markov models is a topic of importance in many scientific and engineering disciplines. In this paper we present an online parameter estimation algorithm obtained by casting our recently proposed particle-based, rapid incremental smoother (PaRIS) into the framework of recursive maximum likelihood estimation for general hidden Markov models. Previous such particle implementations suffer from either quadratic complexity in the number of particles or from the well-known degeneracy of the genealogical particle paths. By using the computational efficient and numerically stable PaRIS algorithm for estimating the needed prediction filter derivatives we obtain a fast algorithm with a computational complexity that grows only linearly with the number of particles. The efficiency and stability of the proposed algorithm are illustrated in a simulation study.

Discussion (0). Continue with ORCID to comment.

Pith tools