Importance sampling for a robust and efficient multilevel Monte Carlo estimator
Name:
Chiheb_Ben_hammouda_talk_Importance_Sampling_for_a_Robust_efficient_mlmc_MCQMC_talk.pdf
Size:
1.389Mb
Format:
PDF
Description:
Talk: Importance sampling for a robust and efficient multilevel Monte Carlo estimator
Type
PresentationKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division Applied Mathematics and Computational Science ProgramDate
2020-08-11Permanent link to this record
http://hdl.handle.net/10754/664595
Metadata
Show full item recordAbstract
The multilevel Monte Carlo (MLMC) method for continuous time Markov chains, first introduced by Anderson and Higham (SIAM Multiscal Model. Simul. 10(1), 2012), is a highly efficient simulation technique that can be used to estimate various statistical quantities for stochastic reaction networks (SRNs), and in particular for stochastic biological systems. Unfortunately, the robustness and performance of the multilevel method can be deteriorated due to the phenomenon of high kurtosis, observed at the deep levels of MLMC, which leads to inaccurate estimates for the sample variance. In this work, we address cases where the high kurtosis phenomenon is due to catastrophic coupling (characteristic of pure jump processes where coupled consecutive paths are identical in most of the simulations, while differences only appear in a very small proportion), and introduce a pathwise dependent importance sampling technique that improves the robustness and efficiency of the multilevel method. Our analysis, along with the conducted numerical experiments, demonstrates that our proposed method significantly reduces the kurtosis at the deep levels of MLMC, and also improves the strong convergence rate. Due to the complexity theorem of MLMC and given a pre-selected tolerance, TOL, this results in an improvement of the complexity from O(TOL^{-2} (log(TOL))^2) in the standard case to O(TOL^{-2}), which is the optimal complexity of the MLMC estimator. We achieve all these improvements with a negligible additional cost since our IS algorithm is only applied a few times across each simulated path.Sponsors
This work was supported by the KAUST Office of Sponsored Research (OSR) under Award No. URF/1/2584-01-01 and the Alexander von Humboldt FoundationConference/Event name
Conference: 14th International Conference in Monte Carlo & Quasi-Monte Carlo Methods in Scientific Computing (MCQMC 2020)Collections
PresentationsThe following license files are associated with this item: