4.7 Article

Importance sampling for McKean-Vlasov SDEs

Journal

APPLIED MATHEMATICS AND COMPUTATION
Volume 453, Issue -, Pages -

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2023.128078

Keywords

McKean-Vlasov Stochastic Differential; Equation; Interacting particle systems; Monte Carlo simulation; Importance sampling; Large deviations

Ask authors/readers for more resources

This paper presents Monte-Carlo methods for evaluating expectations of functionals of solutions to McKean-Vlasov Stochastic Differential Equations (MV-SDE). Two importance sampling algorithms are proposed to reduce the variance of the Monte-Carlo estimator. The complete measure change algorithm and the decoupling algorithm both show significant reduction in variance compared to the standard Monte Carlo approximation. The methodological approach uses large deviations and Pontryagin principle to solve the variance minimization problem.
This paper deals with Monte-Carlo (MC) methods for evaluating expectations of functionals of solutions to McKean-Vlasov Stochastic Differential Equations (MV-SDE) including those with super-linearly growing drifts. Underpinned by an interacting particle system approxi-mation, we propose two importance sampling (IS) algorithms to reduce the variance of an associated MC estimator.The complete measure change algorithm sees the IS measure change applied to the tar-get expectation to be calculated and to the MV-SDE coefficients simultaneously. The de -coupling algorithm consists of estimating the law of the MV-SDE's solution via standard simulation under the initial measure, then fixing the law component of the MV-SDE via that simulation, and finally simulating the new equation under the IS measure.Methodologically, large deviations and Pontryagin principle are employed to determine and solve the variance minimisation problem that yields the required measure change. The op-timisation problem associated to the complete measure change is more complex than that for the decoupling algorithm, nonetheless, symmetry arguments allow for non-trivial com-plexity reduction. As an example, both algorithms are tested using the Kuramoto model from statistical physics. For the functionals tested, we see a reduction of up to 3 orders of magnitude on the variance of both IS schemes in comparison to the standard Monte Carlo approximation. In terms of computational cost, the complete measure change is akin to standard Monte Carlo whilst the decoupled approach increases the cost by a factor of around 2 if one uses the same number of particles for both steps. The statistical error of the method dominates the propagation of chaos error by 1 order of magnitude.(c) 2023 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY license ( http://creativecommons.org/licenses/by/4.0/ )

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available