Aaron A. King, Ph.D.

Nelson G. Hairston Collegiate Professor of
Ecology & Evolutionary Biology, Complex Systems, and Mathematics
University of Michigan

Iterated filtering

E. L. Ionides, A. Bhadra, Y. Atchadé, and A. A. King
Annals of Statistics 39(3): 1776–1802, 2011.

Inference for partially observed Markov process models has been a longstanding methodological challenge with many scientific and engineering applications. Iterated filtering algorithms maximize the likelihood function for partially observed Markov process models by solving a recursive sequence of filtering problems. We present new theoretical results pertaining to the convergence of iterated filtering algorithms implemented via sequential Monte Carlo filters. This theory complements the growing body of empirical evidence that iterated filtering algorithms provide an effective inference strategy for scientific models of nonlinear dynamic systems. The first step in our theory involves studying a new recursive approach for maximizing the likelihood function of a latent variable model, when this likelihood is evaluated via importance sampling. This leads to the consideration of an iterated importance sampling algorithm which serves as a simple special case of iterated filtering, and may have applicability in its own right.


The official version of the paper is here.   Please contact Prof. King if you'd like a reprint.

© 2019 Aaron A. King
3068 Biological Sciences Building
1105 North University Avenue
Ann Arbor MI 48109-1085 USA