Affine matrix scrambling achieves smoothness-dependent convergence rates
Yang Liu

TL;DR
This paper analyzes the convergence rates of median estimators using affine matrix scrambled digital nets in quasi-Monte Carlo integration, showing they depend on integrand smoothness and outperform mean estimators in practice.
Contribution
It introduces a median estimator approach for affine matrix scrambled digital nets, demonstrating smoothness-dependent convergence rates and practical advantages over mean estimators.
Findings
Median estimator achieves smoothness-dependent convergence rates.
Median estimator outperforms mean estimators in numerical experiments.
Theoretical rates are not observed empirically with heavy-tailed distributions.
Abstract
We study the convergence rate of the median estimator for affine matrix scrambled digital nets applied to integrands over the unit hypercube . By taking the median of independent randomized quasi-Monte Carlo (RQMC) samples, we demonstrate that the desired convergence rates can be achieved without increasing the number of randomizations as the quadrature size grows for both bounded and unbounded integrands. For unbounded integrands, our analysis assumes a boundary growth condition on the weak derivatives and also considers singularities such as kinks and jump discontinuities. Notably, when , the median estimator reduces to the standard RQMC estimator. By applying analytical techniques developed for median estimators, we prove that the affine matrix scrambled estimator achieves a convergence rate depending on the integrand's smoothness, and is therefore…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
