On Sequential Monte Carlo Sampling of Discretely Observed Stochastic - - PowerPoint PPT Presentation

on sequential monte carlo sampling of discretely observed
SMART_READER_LITE
LIVE PREVIEW

On Sequential Monte Carlo Sampling of Discretely Observed Stochastic - - PowerPoint PPT Presentation

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion On Sequential Monte Carlo Sampling of Discretely Observed Stochastic Differential Equations Simo Srkk <simo.sarkka@hut.fi> Laboratory of Computational


slide-1
SLIDE 1

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

On Sequential Monte Carlo Sampling of Discretely Observed Stochastic Differential Equations

Simo Särkkä <simo.sarkka@hut.fi>

Laboratory of Computational Engineering Helsinki University of Technology Finland

September 15, 2006

Simo Särkkä <simo.sarkka@hut.fi>

slide-2
SLIDE 2

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Contents

1

Problem Formulation

2

Continuous-Discrete SIR

3

Example Problem

4

Conclusion

Simo Särkkä <simo.sarkka@hut.fi>

slide-3
SLIDE 3

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Contents

1

Problem Formulation

2

Continuous-Discrete SIR

3

Example Problem

4

Conclusion

Simo Särkkä <simo.sarkka@hut.fi>

slide-4
SLIDE 4

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Contents

1

Problem Formulation

2

Continuous-Discrete SIR

3

Example Problem

4

Conclusion

Simo Särkkä <simo.sarkka@hut.fi>

slide-5
SLIDE 5

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Contents

1

Problem Formulation

2

Continuous-Discrete SIR

3

Example Problem

4

Conclusion

Simo Särkkä <simo.sarkka@hut.fi>

slide-6
SLIDE 6

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Continuous-Discrete Filtering Problem

Estimate the unobserved continuous-time signal from noisy discrete-time measurements

2 4 6 8 10 12 14 16 −0.25 −0.2 −0.15 −0.1 −0.05 0.05 0.1 0.15 0.2 0.25 Time Signal Signal derivative Measurement Simo Särkkä <simo.sarkka@hut.fi>

slide-7
SLIDE 7

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Mathematical Problem Formulation

The dynamics of state x(t) modeled as a stochastic differential equation (diffusion process) dx = f(x, t) dt + L dβ(t). Measurements yk are obtained at discrete times yk ∼ p(yk | x(tk)). Formal solution: Compute the posterior distribution(s) p(x(t) | y1, . . . , yk), t ≥ tk.

Simo Särkkä <simo.sarkka@hut.fi>

slide-8
SLIDE 8

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Mathematical Problem Formulation

The dynamics of state x(t) modeled as a stochastic differential equation (diffusion process) dx = f(x, t) dt + L dβ(t). Measurements yk are obtained at discrete times yk ∼ p(yk | x(tk)). Formal solution: Compute the posterior distribution(s) p(x(t) | y1, . . . , yk), t ≥ tk.

Simo Särkkä <simo.sarkka@hut.fi>

slide-9
SLIDE 9

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Mathematical Problem Formulation

The dynamics of state x(t) modeled as a stochastic differential equation (diffusion process) dx = f(x, t) dt + L dβ(t). Measurements yk are obtained at discrete times yk ∼ p(yk | x(tk)). Formal solution: Compute the posterior distribution(s) p(x(t) | y1, . . . , yk), t ≥ tk.

Simo Särkkä <simo.sarkka@hut.fi>

slide-10
SLIDE 10

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Formal solution

Optimal filter

1

Prediction step: Solve the Kolmogorov-forward (Fokker-Planck) partial differential equation. ∂p ∂t = −

  • i

∂ ∂xi (fi(x, t) p) + 1 2

  • ij

∂2 ∂xi∂xj

  • [L Q LT]ij p
  • 2

Update step: Apply the Bayes’ rule. p(x(tk) | y1:k) = p(yk | x(tk)) p(x(tk) | y1:k−1)

  • p(yk | x(tk)) p(x(tk) | y1:k−1) dx(tk)

Simo Särkkä <simo.sarkka@hut.fi>

slide-11
SLIDE 11

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Formal solution

Optimal filter

1

Prediction step: Solve the Kolmogorov-forward (Fokker-Planck) partial differential equation. ∂p ∂t = −

  • i

∂ ∂xi (fi(x, t) p) + 1 2

  • ij

∂2 ∂xi∂xj

  • [L Q LT]ij p
  • 2

Update step: Apply the Bayes’ rule. p(x(tk) | y1:k) = p(yk | x(tk)) p(x(tk) | y1:k−1)

  • p(yk | x(tk)) p(x(tk) | y1:k−1) dx(tk)

Simo Särkkä <simo.sarkka@hut.fi>

slide-12
SLIDE 12

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Numerical Approximations

Gaussian models and approximations, extended Kalman filters and unscented Kalman filters. FEM and finite difference based approximations to the Kolmogorov forward PDE. Bootstrap filter: Simulates trajectories from the SDE. Sequential importance resampling: Not applicable!

Simo Särkkä <simo.sarkka@hut.fi>

slide-13
SLIDE 13

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Numerical Approximations

Gaussian models and approximations, extended Kalman filters and unscented Kalman filters. FEM and finite difference based approximations to the Kolmogorov forward PDE. Bootstrap filter: Simulates trajectories from the SDE. Sequential importance resampling: Not applicable!

Simo Särkkä <simo.sarkka@hut.fi>

slide-14
SLIDE 14

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Numerical Approximations

Gaussian models and approximations, extended Kalman filters and unscented Kalman filters. FEM and finite difference based approximations to the Kolmogorov forward PDE. Bootstrap filter: Simulates trajectories from the SDE. Sequential importance resampling: Not applicable!

Simo Särkkä <simo.sarkka@hut.fi>

slide-15
SLIDE 15

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Numerical Approximations

Gaussian models and approximations, extended Kalman filters and unscented Kalman filters. FEM and finite difference based approximations to the Kolmogorov forward PDE. Bootstrap filter: Simulates trajectories from the SDE. Sequential importance resampling: Not applicable!

Simo Särkkä <simo.sarkka@hut.fi>

slide-16
SLIDE 16

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Sequential Importance Resampling

Sequential Importance Resampling

1

Draw a random sample from the importance distribution x(i)(tk) ∼ q(x(i)(tk) | x(i)(tk−1)) (1)

2

Evaluate the importance weight w(i)

k

∝ p(yk | x(i)(tk)) p(x(i)(tk) | x(i)(tk−1)) q(x(i)(tk) | x(i)(tk−1))

3

Do resampling if needed.

Simo Särkkä <simo.sarkka@hut.fi>

slide-17
SLIDE 17

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Sequential Importance Resampling

Sequential Importance Resampling

1

Draw a random sample from the importance distribution x(i)(tk) ∼ q(x(i)(tk) | x(i)(tk−1)) (1)

2

Evaluate the importance weight w(i)

k

∝ p(yk | x(i)(tk)) p(x(i)(tk) | x(i)(tk−1)) q(x(i)(tk) | x(i)(tk−1))

3

Do resampling if needed.

Simo Särkkä <simo.sarkka@hut.fi>

slide-18
SLIDE 18

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Sequential Importance Resampling

Sequential Importance Resampling

1

Draw a random sample from the importance distribution x(i)(tk) ∼ q(x(i)(tk) | x(i)(tk−1)) (1)

2

Evaluate the importance weight w(i)

k

∝ p(yk | x(i)(tk)) p(x(i)(tk) | x(i)(tk−1)) q(x(i)(tk) | x(i)(tk−1))

3

Do resampling if needed.

Simo Särkkä <simo.sarkka@hut.fi>

slide-19
SLIDE 19

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

The Problem of SIR Weight Evaluation

The weight evaluation of SIR is of the form w(i)

k

∝ p(yk | x(i)(tk)) p(x(i)(tk) | x(i)(tk−1)) q(x(i)(tk) | x(i)(tk−1)) But p(x(tk) | x(tk−1)) is the solution of an arbitrary second

  • rder partial differential equation and cannot be solved.

Actually we only need the likelihood ratio p(x(tk) | x(tk−1)) q(x(tk) | x(tk−1)) This can be computed with the Girsanov theorem without solving the PDE.

Simo Särkkä <simo.sarkka@hut.fi>

slide-20
SLIDE 20

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

The Problem of SIR Weight Evaluation

The weight evaluation of SIR is of the form w(i)

k

∝ p(yk | x(i)(tk)) p(x(i)(tk) | x(i)(tk−1)) q(x(i)(tk) | x(i)(tk−1)) But p(x(tk) | x(tk−1)) is the solution of an arbitrary second

  • rder partial differential equation and cannot be solved.

Actually we only need the likelihood ratio p(x(tk) | x(tk−1)) q(x(tk) | x(tk−1)) This can be computed with the Girsanov theorem without solving the PDE.

Simo Särkkä <simo.sarkka@hut.fi>

slide-21
SLIDE 21

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

The Problem of SIR Weight Evaluation

The weight evaluation of SIR is of the form w(i)

k

∝ p(yk | x(i)(tk)) p(x(i)(tk) | x(i)(tk−1)) q(x(i)(tk) | x(i)(tk−1)) But p(x(tk) | x(tk−1)) is the solution of an arbitrary second

  • rder partial differential equation and cannot be solved.

Actually we only need the likelihood ratio p(x(tk) | x(tk−1)) q(x(tk) | x(tk−1)) This can be computed with the Girsanov theorem without solving the PDE.

Simo Särkkä <simo.sarkka@hut.fi>

slide-22
SLIDE 22

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

The Problem of SIR Weight Evaluation

The weight evaluation of SIR is of the form w(i)

k

∝ p(yk | x(i)(tk)) p(x(i)(tk) | x(i)(tk−1)) q(x(i)(tk) | x(i)(tk−1)) But p(x(tk) | x(tk−1)) is the solution of an arbitrary second

  • rder partial differential equation and cannot be solved.

Actually we only need the likelihood ratio p(x(tk) | x(tk−1)) q(x(tk) | x(tk−1)) This can be computed with the Girsanov theorem without solving the PDE.

Simo Särkkä <simo.sarkka@hut.fi>

slide-23
SLIDE 23

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Girsanov Theorem

Let θ(t) be a stochastic process, which is driven by (“adapted to”) a Brownian motion β(t). The likelihood ratio between θ(t) and β(t) is: dPθ dPβ = exp t θT(t) dβ(t) − 1 2 t ||θ(t)||2 dt

  • .

The likelihood ratio can be exactly computed by above stochastic integral. Efficient simulation based numerical solutions possible.

Simo Särkkä <simo.sarkka@hut.fi>

slide-24
SLIDE 24

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Girsanov Theorem

Let θ(t) be a stochastic process, which is driven by (“adapted to”) a Brownian motion β(t). The likelihood ratio between θ(t) and β(t) is: dPθ dPβ = exp t θT(t) dβ(t) − 1 2 t ||θ(t)||2 dt

  • .

The likelihood ratio can be exactly computed by above stochastic integral. Efficient simulation based numerical solutions possible.

Simo Särkkä <simo.sarkka@hut.fi>

slide-25
SLIDE 25

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Girsanov Theorem

Let θ(t) be a stochastic process, which is driven by (“adapted to”) a Brownian motion β(t). The likelihood ratio between θ(t) and β(t) is: dPθ dPβ = exp t θT(t) dβ(t) − 1 2 t ||θ(t)||2 dt

  • .

The likelihood ratio can be exactly computed by above stochastic integral. Efficient simulation based numerical solutions possible.

Simo Särkkä <simo.sarkka@hut.fi>

slide-26
SLIDE 26

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Girsanov Theorem

Let θ(t) be a stochastic process, which is driven by (“adapted to”) a Brownian motion β(t). The likelihood ratio between θ(t) and β(t) is: dPθ dPβ = exp t θT(t) dβ(t) − 1 2 t ||θ(t)||2 dt

  • .

The likelihood ratio can be exactly computed by above stochastic integral. Efficient simulation based numerical solutions possible.

Simo Särkkä <simo.sarkka@hut.fi>

slide-27
SLIDE 27

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Evaluating the Likelihood Ratio

With Girsanov theorem, we can derive expression for likelihood ratio of two SDEs: dx = f(x, t) dt + L dβ ds = g(s, t) dt + B dβ. Process s(t) can be the importance process for estimated process x(t). It is a stochastic integral: Well known numerical methods for SDEs can be used. It is a Monte Carlo solution: Solution converges to the exact solution.

Simo Särkkä <simo.sarkka@hut.fi>

slide-28
SLIDE 28

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Evaluating the Likelihood Ratio

With Girsanov theorem, we can derive expression for likelihood ratio of two SDEs: dx = f(x, t) dt + L dβ ds = g(s, t) dt + B dβ. Process s(t) can be the importance process for estimated process x(t). It is a stochastic integral: Well known numerical methods for SDEs can be used. It is a Monte Carlo solution: Solution converges to the exact solution.

Simo Särkkä <simo.sarkka@hut.fi>

slide-29
SLIDE 29

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Evaluating the Likelihood Ratio

With Girsanov theorem, we can derive expression for likelihood ratio of two SDEs: dx = f(x, t) dt + L dβ ds = g(s, t) dt + B dβ. Process s(t) can be the importance process for estimated process x(t). It is a stochastic integral: Well known numerical methods for SDEs can be used. It is a Monte Carlo solution: Solution converges to the exact solution.

Simo Särkkä <simo.sarkka@hut.fi>

slide-30
SLIDE 30

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Evaluating the Likelihood Ratio

With Girsanov theorem, we can derive expression for likelihood ratio of two SDEs: dx = f(x, t) dt + L dβ ds = g(s, t) dt + B dβ. Process s(t) can be the importance process for estimated process x(t). It is a stochastic integral: Well known numerical methods for SDEs can be used. It is a Monte Carlo solution: Solution converges to the exact solution.

Simo Särkkä <simo.sarkka@hut.fi>

slide-31
SLIDE 31

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Continuous-Discrete SIR Algorithm

Similar to SIR, but the importance samples and importance weights are computed by simulating a set of SDEs numerically. The importance processes can be obtained by continuous-discrete EKF or UKF. Conditionally Gaussian parts can be integrated out - Rao-Blackwellized - analytically. Static parameters, when in suitable conjugate form, can also be integrated out. Could be extended to Lévy process driven stochastic differential equations.

Simo Särkkä <simo.sarkka@hut.fi>

slide-32
SLIDE 32

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Continuous-Discrete SIR Algorithm

Similar to SIR, but the importance samples and importance weights are computed by simulating a set of SDEs numerically. The importance processes can be obtained by continuous-discrete EKF or UKF. Conditionally Gaussian parts can be integrated out - Rao-Blackwellized - analytically. Static parameters, when in suitable conjugate form, can also be integrated out. Could be extended to Lévy process driven stochastic differential equations.

Simo Särkkä <simo.sarkka@hut.fi>

slide-33
SLIDE 33

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Continuous-Discrete SIR Algorithm

Similar to SIR, but the importance samples and importance weights are computed by simulating a set of SDEs numerically. The importance processes can be obtained by continuous-discrete EKF or UKF. Conditionally Gaussian parts can be integrated out - Rao-Blackwellized - analytically. Static parameters, when in suitable conjugate form, can also be integrated out. Could be extended to Lévy process driven stochastic differential equations.

Simo Särkkä <simo.sarkka@hut.fi>

slide-34
SLIDE 34

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Continuous-Discrete SIR Algorithm

Similar to SIR, but the importance samples and importance weights are computed by simulating a set of SDEs numerically. The importance processes can be obtained by continuous-discrete EKF or UKF. Conditionally Gaussian parts can be integrated out - Rao-Blackwellized - analytically. Static parameters, when in suitable conjugate form, can also be integrated out. Could be extended to Lévy process driven stochastic differential equations.

Simo Särkkä <simo.sarkka@hut.fi>

slide-35
SLIDE 35

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Continuous-Discrete SIR Algorithm

Similar to SIR, but the importance samples and importance weights are computed by simulating a set of SDEs numerically. The importance processes can be obtained by continuous-discrete EKF or UKF. Conditionally Gaussian parts can be integrated out - Rao-Blackwellized - analytically. Static parameters, when in suitable conjugate form, can also be integrated out. Could be extended to Lévy process driven stochastic differential equations.

Simo Särkkä <simo.sarkka@hut.fi>

slide-36
SLIDE 36

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Noisy Simple Pendulum Problem

Model of noisy simple pendulum: d2x dt2 + a2 sin(x) = w(t). In Brownian motion notation: dx1 dt = x2 dx2 = −a2 sin(x1) dt + dβ, Measurements: yk ∼ N(x1(tk), σ2) σ2 ∼ Inv-χ2(ν0, σ2

0),

Simo Särkkä <simo.sarkka@hut.fi>

slide-37
SLIDE 37

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Noisy Simple Pendulum Problem

Model of noisy simple pendulum: d2x dt2 + a2 sin(x) = w(t). In Brownian motion notation: dx1 dt = x2 dx2 = −a2 sin(x1) dt + dβ, Measurements: yk ∼ N(x1(tk), σ2) σ2 ∼ Inv-χ2(ν0, σ2

0),

Simo Särkkä <simo.sarkka@hut.fi>

slide-38
SLIDE 38

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Noisy Simple Pendulum Problem

Model of noisy simple pendulum: d2x dt2 + a2 sin(x) = w(t). In Brownian motion notation: dx1 dt = x2 dx2 = −a2 sin(x1) dt + dβ, Measurements: yk ∼ N(x1(tk), σ2) σ2 ∼ Inv-χ2(ν0, σ2

0),

Simo Särkkä <simo.sarkka@hut.fi>

slide-39
SLIDE 39

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Simulation Results

Evolution of signal estimate (left) and variance estimate (right):

5 10 15 20 25 30 −2 −1.5 −1 −0.5 0.5 1 1.5 2 Time True Signal Measurements Estimate 95% Quantiles 5 10 15 20 25 30 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 Time True Variance Estimate 95% Quantiles

Simo Särkkä <simo.sarkka@hut.fi>

slide-40
SLIDE 40

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Conclusion

The discrete-time Sequential importance resampling (SIR) is not applicable to continuous-discrete filtering problems, because p(x(tk) | x(tk−1)) cannot be computed. By using the Girsanov theorem a stochastic integral formula for the importance weights can be derived. The weight evaluation and importance process simulation can be done with numerical methods for SDEs. The same efficiency improvement strategies (EKF proposal, Rao-Blackwellization, etc.) can be applied as in the discrete-time case.

Simo Särkkä <simo.sarkka@hut.fi>

slide-41
SLIDE 41

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Conclusion

The discrete-time Sequential importance resampling (SIR) is not applicable to continuous-discrete filtering problems, because p(x(tk) | x(tk−1)) cannot be computed. By using the Girsanov theorem a stochastic integral formula for the importance weights can be derived. The weight evaluation and importance process simulation can be done with numerical methods for SDEs. The same efficiency improvement strategies (EKF proposal, Rao-Blackwellization, etc.) can be applied as in the discrete-time case.

Simo Särkkä <simo.sarkka@hut.fi>

slide-42
SLIDE 42

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Conclusion

The discrete-time Sequential importance resampling (SIR) is not applicable to continuous-discrete filtering problems, because p(x(tk) | x(tk−1)) cannot be computed. By using the Girsanov theorem a stochastic integral formula for the importance weights can be derived. The weight evaluation and importance process simulation can be done with numerical methods for SDEs. The same efficiency improvement strategies (EKF proposal, Rao-Blackwellization, etc.) can be applied as in the discrete-time case.

Simo Särkkä <simo.sarkka@hut.fi>

slide-43
SLIDE 43

Problem Formulation Continuous-Discrete SIR Example Problem Conclusion

Conclusion

The discrete-time Sequential importance resampling (SIR) is not applicable to continuous-discrete filtering problems, because p(x(tk) | x(tk−1)) cannot be computed. By using the Girsanov theorem a stochastic integral formula for the importance weights can be derived. The weight evaluation and importance process simulation can be done with numerical methods for SDEs. The same efficiency improvement strategies (EKF proposal, Rao-Blackwellization, etc.) can be applied as in the discrete-time case.

Simo Särkkä <simo.sarkka@hut.fi>