On Integration Methods Based on Scrambled Nets of Arbitrary Size
Mathieu Gerber

TL;DR
This paper derives variance bounds for scrambled net quadrature rules that improve convergence rates without restrictions on N, and demonstrates their effectiveness for discontinuous functions and sequential quasi-Monte Carlo methods.
Contribution
It establishes a variance bound of order o(N^{-1}) for scrambled net quadrature rules without restrictions on N, enabling improved convergence analysis.
Findings
Variance of scrambled net quadrature rules is of order o(N^{-1})
Sequential quasi-Monte Carlo achieves o_P(N^{-1/2}) convergence for any N
Relaxed constraints on N do not reduce efficiency for discontinuous functions
Abstract
We consider the problem of evaluating for a function . In situations where can be approximated by an estimate of the form , with a point set in , it is now well known that the Monte Carlo convergence rate can be improved by taking for the first points, , of a scrambled -sequence in base . In this paper we derive a bound for the variance of scrambled net quadrature rules which is of order without any restriction on . As a corollary, this bound allows us to provide simple conditions to get, for any pattern of , an integration error of size for functions that depend on the quadrature size . Notably, we establish…
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.
