Raul Tempone: Multi-Index Monte Carlo: when sparsity meets sampling

This talk will focus on our Multi Index Monte Carlo (MIMC) method. The MIMC method uses a stochastic combination technique to solve the given approximation problem, generalizing the notion of standard MLMC levels into a set of multi indices that should be properly chosen to exploit the available regularity. Indeed, instead of using first-order differences as in standard MLMC, MIMC uses high-order differences to reduce the variance of the hierarchical differences dramatically. This in turn gives a new improved complexity result that increases the domain of the problem parameters for which the method achieves the optimal convergence rate, $\mathcal{O}(\tol^{-2}).$ Using optimal index sets that we determined, MIMC achieves a better rate for the computational complexity does not depend on the dimensionality of the underlying problem, up to logarithmic factors. We present numerical results related to a three dimensional PDE with random coefficients to substantiate some of the derived computational complexity rates. Finally, using the Lindeberg-Feller theorem, we also show the asymptotic normality of the statistical error in the MIMC estimator and justify in this way our error estimate that allows prescribing both the required accuracy and confidence in the final result.

Reference: Abdul-Lateef Haji-Ali, Fabio Nobile, and Raul Tempone. ``Multi-Index Monte Carlo: When Sparsity Meets Sampling.'', arXiv preprint arXiv:1405.3757 (2014)