Adaptive Importance Sampling with Forward-Backward Stochastic Differential Equations

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe an adaptive importance sampling algorithm for rare events that is based on a dual stochastic control formulation of a path sampling problem. Specifically, we focus on path functionals that have the form of cumulate generating functions, which appear relevant in the context of, e.g. molecular dynamics, and we discuss the construction of an optimal (i.e. minimum variance) change of measure by solving a stochastic control problem. We show that the associated semi-linear dynamic programming equations admit an equivalent formulation as a system of uncoupled forward-backward stochastic differential equations that can be solved efficiently by a least squares Monte Carlo algorithm. We illustrate the approach with a suitable numerical example and discuss the extension of the algorithm to high-dimensional systems.

Cite

CITATION STYLE

APA

Kebiri, O., Neureither, L., & Hartmann, C. (2019). Adaptive Importance Sampling with Forward-Backward Stochastic Differential Equations. In Springer Proceedings in Mathematics and Statistics (Vol. 282, pp. 265–281). Springer New York LLC. https://doi.org/10.1007/978-3-030-15096-9_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free