Skewness of a randomized quasi-Monte Carlo estimate
Zexin Pan, Art B. Owen
TL;DR
The paper analyzes the skewness of randomized quasi-Monte Carlo estimates obtained from scrambled digital nets and links this property to the reliability of $t$-based confidence intervals. By employing a Walsh-Fourier decomposition and careful treatment of symmetric error contributions, it proves that the third central moment decays as $O(n^{-9/2+\varepsilon})$ in general and as $O(n^{-5+\varepsilon})$ under random generator matrices, yielding a skewness of $\gamma=O(n^{-1/2+\varepsilon})$ when variance scales as $\Omega(n^{-3})$. It also provides improved probabilistic bounds for the distribution of the net quality parameter $t$ under random base-$p$ generators and discusses refinements for the case of random generator matrices, which hold with high probability. Through explicit 1D and 3D examples, the results align with observed symmetry and validate the theoretical decay of skewness, offering justification for the effectiveness of standard $t$-intervals in ci4rqmc while highlighting limitations for non-smooth integrands and fixed nets.
Abstract
Some recent work on confidence intervals for randomized quasi-Monte Carlo (RQMC) sampling found a surprising result: ordinary Student $t$ 95% confidence intervals based on a modest number of replicates were seen to be very effective and even more reliable than some bootstrap $t$ intervals that were expected to be best. One potential explanation is that those RQMC estimates have small skewness. In this paper we give conditions under which the skewness is $O(n^ε)$ for any $ε>0$, so 'almost $O(1)$'. Under a random generator matrix model, we can improve this rate to $O(n^{-1/2+ε})$ with very high probability. We also improve some probabilistic bounds on the distribution of the quality parameter $t$ for a digital net in a prime base under random sampling of generator matrices.
