Iterated filtering explained

Iterated filtering algorithms are a tool for maximum likelihood inference on partially observed dynamical systems. Stochastic perturbations to the unknown parameters are used to explore the parameter space. Applying sequential Monte Carlo (the particle filter) to this extended model results in the selection of the parameter values that are more consistent with the data. Appropriately constructed procedures, iterating with successively diminished perturbations, converge to the maximum likelihood estimate. Iterated filtering methods have so far been used most extensively to study infectious disease transmission dynamics. Case studies include cholera, Ebola virus, influenza, malaria, HIV, pertussis, poliovirus and measles. Other areas which have been proposed to be suitable for these methods include ecological dynamics^[1] and finance.

The perturbations to the parameter space play several different roles. Firstly, they smooth out the likelihood surface, enabling the algorithm to overcome small-scale features of the likelihood during early stages of the global search. Secondly, Monte Carlo variation allows the search to escape from local minima. Thirdly, the iterated filtering update uses the perturbed parameter values to construct an approximation to the derivative of the log likelihood even though this quantity is not typically available in closed form. Fourthly, the parameter perturbations help to overcome numerical difficulties that can arise during sequential Monte Carlo.

Overview

The data are a time series

y _{1,...,y} _{N} collected at times t _{1} < t _{2} < ... < t _{N} . The dynamic system is modeled by a Markov process X(t) which is generated by a function f(x,s,t,\theta,W) in the sense thatX(t _{n -1} ),t _{n -1} ,t _{n,\theta,W)}

where

\theta is a vector of unknown parameters and W is some random quantity that is drawn independently each time f(.) is evaluated. An initial condition X(t _{0)} at some time t _{0<t} _{1} is specified by an initialization function, X(t _{0)=h(\theta)} . A measurement density g(y _{n|X} _{n,t} _{n,\theta)} completes the specification of a partially observed Markov process. We present a basic iterated filtering algorithm (IF1) followed by an iterated filtering algorithm implementing an iterated, perturbed Bayes map (IF2).

Procedure: Iterated filtering (IF1)

Input: A partially observed Markov model specified as above; Monte Carlo sample size

J ; number of iterations M ; cooling parameters 0 <a< 1 and b ; covariance matrix \Phi ; initial parameter vector \theta ^{(1)}

for

m =1 to M

draw

\Theta _{0 ,j)\sim} Normal (\theta ^{(m)} ,b a ^{m-1} \Phi) for j =1 , ... , J

set

X _{0 ,j) = h ( \Theta} ^{0 ,j) )} for j =1 , ... , J

set

\bar\theta(t ^{(m)} _{0 ) = \theta}

for

n =1 to N

draw

\Theta _{n,j)\sim} Normal (\Theta _{n -1} ,j), a ^{m-1} \Phi) for j =1 , ... , J

set

X _{n,j) = f(X} ^{n -1} ,j),t _{n -1} ,t _{n,\Theta} _{P(t} _{n} ,j),W) for j =1 , ... , J

set

w(n,j) = g(y _{n|X} ^{n,\Theta} _{P(t} _{n} ,j)) for j =1 , ... , J

draw

k _{J} such that P(k _{j = i) = w(n,i) / {\sum}} _{\ell} w(n,\ell)

set

X _{n,j) = X} ^{j)} and \Theta _{n,j) = \Theta} ^{j)} for j =1 , ... , J

set

\bar\theta _{i} (t _{n} ) to the sample mean of \{\Theta _{F,i} (t _{n} ,j),j =1 , ... ,J\} , where the vector \Theta _{F} has components \{\Theta _{F,i} \}

set

V _{i} (t _{n} ) to the sample variance of \{\Theta _{P,i} (t _{n} ,j),j =1 , ... ,J\}

set

\theta ^{(m +1 )} _{i} = \theta ^{(m)} _{i} + V _{i(t} _{1} )\sum ^{N} _{n =1} V ^{-1} _{i} (t _{n} )(\bar\theta _{i(t} _{n)-\bar\theta} _{i(t} _{n-1} ))

Output: Maximum likelihood estimate

\hat\theta = \theta ^{(M+1)}

Variations

1. For IF1, parameters which enter the model only in the specification of the initial condition,

X(t _{0)} , warrant some special algorithmic attention since information about them in the data may be concentrated in a small part of the time series.

1. Theoretically, any distribution with the requisite mean and variance could be used in place of the normal distribution. It is standard to use the normal distribution and to reparameterise to remove constraints on the possible values of the parameters.
2. Modifications to the IF1 algorithm have been proposed to give superior asymptotic performance.

Procedure: Iterated filtering (IF2)

Input: A partially observed Markov model specified as above; Monte Carlo sample size

J ; number of iterations M ; cooling parameter 0 <a< 1 ; covariance matrix \Phi ; initial parameter vectors \{\Theta _{j,} j =1 , ... ,J\}

for

m =1 to M

set

\Theta _{0 ,j)} \sim Normal (\Theta _{j,} a ^{m-1} \Phi) for j =1 , ... , J

set

X _{0 ,j) = h ( \Theta} ^{0 ,j) )} for j =1 , ... , J

for

n =1 to N

draw

\Theta _{n,j)\sim} Normal (\Theta _{n -1} ,k _{j),} a ^{m-1} \Phi) for j =1 , ... , J

set

X _{n,j) = f(X} ^{n -1} ,j),t _{n -1} ,t _{n,\Theta} _{P(t} _{n} ,j),W) for j =1 , ... , J

set

w(n,j) = g(y _{n|X} ^{n,\Theta} _{P(t} _{n} ,j)) for j =1 , ... , J

draw

k _{J} such that P(k _{j = i) = w(n,i) / {\sum}} _{\ell} w(n,\ell)

set

X _{n,j) = X} ^{j)} and \Theta _{n,j) = \Theta} ^{j)} for j =1 , ... , J

set

\Theta _{j=\Theta} ^{N,j)} for j =1 , ... , J

Output: Parameter vectors approximating the maximum likelihood estimate,

\{\Theta _{j,} j =1 , ... , J \}

Software

"pomp: statistical inference for observed Markov processes" : R package.

Notes and References

1. Ionides. E. L... Discussion on "Feature Matching in Time Series Modeling" by Y. Xia and H. Tong.. Statistical Science . 2011. 10.1214/11-STS345C. 26. 49–52. 1201.1376. 88511724.