Continious-time Importance Sampling: Monte Carlo Methods which Avoid Time-discretisation Error

12/17/2017
by   Paul Fearnhead, et al.
0

In this paper we develop a continuous-time sequential importance sampling (CIS) algorithm which eliminates time-discretisation errors and provides online unbiased estimation for continuous time Markov processes, in particular for diffusions. Our work removes the strong conditions imposed by the EA and thus extends significantly the class of discretisation error-free MC methods for diffusions. The reason that CIS can be applied more generally than EA is that it no longer works on the path space of the SDE. Instead it uses proposal distributions for the transition density of the diffusion, and proposal distributions that are absolutely continuous with respect to the true transition density exist for general SDEs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2021

Nonasymptotic bounds for suboptimal importance sampling

Importance sampling is a popular variance reduction method for Monte Car...
research
02/01/2019

Limit theorems for cloning algorithms

Large deviations for additive path functionals of stochastic processes h...
research
12/08/2022

Entropy minimizing distributions are worst-case optimal importance proposals

Importance sampling of target probability distributions belonging to a g...
research
02/13/2020

Backward importance sampling for partially observed diffusion processes

This paper proposes a new Sequential Monte Carlo algorithm to perform ma...
research
08/17/2023

Closed-form approximations of moments and densities of continuous-time Markov models

This paper develops power series expansions of a general class of moment...
research
03/14/2019

FAVE: A fast and efficient network Flow AVailability Estimation method with bounded relative error

This paper focuses on helping network providers to carry out network cap...

Please sign up or login with your details

Forgot password? Click here to reset