Conditional path sampling of stochastic differential equations by drift relaxation
Panagiotis Stinis

TL;DR
This paper introduces a novel algorithm for efficiently sampling conditional paths of SDEs by gradually modifying the drift term, improving filtering and smoothing in high-dimensional stochastic systems.
Contribution
It proposes a drift relaxation method combined with MCMC to sample conditional SDE paths, enhancing performance over traditional methods.
Findings
Algorithm improves sampling efficiency for conditional SDE paths.
Method enhances particle filter performance in filtering tasks.
Numerical experiments demonstrate effectiveness in stochastic filtering.
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.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTarget Tracking and Data Fusion in Sensor Networks · Fault Detection and Control Systems · Gaussian Processes and Bayesian Inference
