Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We present a theoretical and numerical analysis of Monte Carlo methods for the estimation of statistical moments of random variables taking values in a Banach space . For practical computation, we consider finite-dimensional approximation subspaces of increasing dimension. We develop a refined error analysis that explicitly accounts for a dependence of the Rademacher type constants on the dimension of , leading to novel complexity results for single- and multilevel Monte Carlo methods to estimate the mean and injective moments of arbitrary order, which are, in certain cases, sharper than those derived in [Kirchner, Schwab, J. Funct. Anal, 2024]. Moreover, we show that, in favorable cases, the resulting error-vs.-work bounds are independent of the Rademacher type of . We then focus on -valued random variables for a -finite measure space satisfying certain approximation properties, and prove that for a random variable , with and , the -convergence rate of a Monte Carlo estimator is determined exclusively by the integrability parameter , with no dependence on the Rademacher type of . We further investigate the impact of measuring the (multilevel) Monte Carlo error in the -norm while possesses additional regularity, with . This analysis reveals an interplay between the sampling error and the strong approximation error, and leads to optimized error-vs.-work bounds for both single- and multilevel Monte Carlo methods. Numerical experiments confirm the sharpness of the analyses presented.