Conditional path sampling for stochastic differential equations through drift relaxation

DOI10.2140/CAMCOS.2011.6.63MaRDI QIDQ646490zbMATH OpenOpenAlexFDO

Authors Panos Stinis

Publication date 17 November 2011

Published in Communications in Applied Mathematics and Computational Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.2492, http://msp.berkeley.edu/camcos/2011/6-1/p03.xhtml

zbMATH Keywords

simulated annealingMonte Carloparticle filterstochastic differential equationhomotopy methodconditional path sampling

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Inference from stochastic processes and prediction (62M20) Signal detection and filtering (aspects of stochastic processes) (60G35) Stochastic ordinary differential equations (aspects of stochastic analysis) (60H10) Numerical solutions to stochastic differential and integral equations (65C30) Estimation and detection in stochastic control theory (93E10)

Abstract: We present an algorithm for the efficient sampling of conditional paths of stochastic differential equations (SDEs). While unconditional path sampling of SDEs is straightforward, albeit expensive for high dimensional systems of SDEs, conditional path sampling can be difficult even for low dimensional systems. This is because we need to produce sample paths of the SDE which respect both the dynamics of the SDE and the initial and endpoint conditions. The dynamics of a SDE are governed by the deterministic term (drift) and the stochastic term (noise). Instead of producing conditional paths directly from the original SDE, one can consider a sequence of SDEs with modified drifts. The modified drifts should be chosen so that it is easier to produce sample paths which satisfy the initial and endpoint conditions. Also, the sequence of modified drifts converges to the drift of the original SDE. We construct a simple Markov Chain Monte Carlo (MCMC) algorithm which samples, in sequence, conditional paths from the modified SDEs, by taking the last sampled path at each level of the sequence as an initial condition for the sampling at the next level in the sequence. The algorithm can be thought of as a stochastic analog of deterministic homotopy methods for solving nonlinear algebraic equations or as a SDE generalization of simulated annealing. The algorithm is particularly suited for filtering/smoothing applications. We show how it can be used to improve the performance of particle filters. Numerical results for filtering of a stochastic differential equation are included.

Recommendations

• Conditional path sampling of SDEs and the Langevin MCMC method
• Analysis of SPDEs arising in path sampling. I: The Gaussian case
• Sampling conditioned diffusions
• Retrospective exact simulation of diffusion sample paths with applications
• Analysis of SPDEs arising in path sampling. II: The nonlinear case

Cited in

(10)

• Improved distributed particle filters for tracking in a wireless sensor network
• Improved particle filters for multi-target tracking
• Path sampling with stochastic dynamics: some new algorithms
• Simulation of forward-reverse stochastic representations for conditional diffusions
• Adaptive meshfree backward SDE filter
• Analysis of SPDEs arising in path sampling. II: The nonlinear case
• Conditional path sampling of SDEs and the Langevin MCMC method
• Sampling conditioned hypoelliptic diffusions
• Forward-reverse expectation-maximization algorithm for Markov chains: convergence and numerical analysis
• Analysis of SPDEs arising in path sampling. I: The Gaussian case

This page was built for publication: Conditional path sampling for stochastic differential equations through drift relaxation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646490)