Importance sampling for a robust and efficient multilevel Monte Carlo estimator for stochastic reaction networks

• Published in: Statistics and computing 2020-11, Vol.30 (6), p.1665-1689
• Main Authors: Ben Hammouda, Chiheb, Ben Rached, Nadhir, Tempone, Raúl
• Format: Article
• Language: English
• Subjects: Algorithms; Artificial Intelligence; Complexity; Computer simulation; Importance sampling; Kurtosis; Markov chains; Mathematics and Statistics; Multilevel; Probability and Statistics in Computer Science; Robustness (mathematics); Sample variance; Statistical Theory and Methods; Statistics; Statistics and Computing/Statistics Programs
• ISSN: 0960-3174; 1573-1375
• DOI: 10.1007/s11222-020-09965-3

The multilevel Monte Carlo (MLMC) method for continuous-time Markov chains, first introduced by Anderson and Higham (SIAM Multiscal Model Simul 10(1):146–179, 2012), is a highly efficient simulation technique that can be used to estimate various statistical quantities for stochastic reaction networks, in particular for stochastic biological systems. Unfortunately, the robustness and performance of the multilevel method can be affected by the high kurtosis, a phenomenon observed at the deep levels of MLMC, which leads to inaccurate estimates of 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 tiny proportion) and introduce a pathwise-dependent importance sampling (IS) technique that improves the robustness and efficiency of the multilevel method. Our theoretical results, along with the conducted numerical experiments, demonstrate that our proposed method significantly reduces the kurtosis of the deep levels of MLMC, and also improves the strong convergence rate from β = 1 for the standard case (without IS), to β = 1 + δ , where 0 < δ < 1 is a user-selected parameter in our IS algorithm. 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.