Pith. sign in

REVIEW

An efficient particle-based online EM algorithm for general state-space models

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 1502.04822 v2 pith:5FHJEXCM submitted 2015-02-17 stat.CO

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

Estimating the parameters of general state-space models is a topic of importance for 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 online expectation-maximization (EM) for state-space models proposed by Capp\'e (2011). Previous such particle-based implementations of online EM suffer typically from either the well-known degeneracy of the genealogical particle paths or a quadratic complexity in the number of particles. However, by using the computationally efficient and numerically stable PaRIS algorithm for estimating smoothed expectations of time-averaged sufficient statistics of the model we obtain a fast algorithm with very limited memory requirements and a computational complexity that grows only linearly with the number of particles. The efficiency of the algorithm is illustrated in a simulation study.

Discussion (0). Continue with ORCID to comment.

Pith tools