A Sharp Discrepancy Bound for Jittered Sampling
share
For m, d ∈ℕ, a jittered sampling point set P having N = m^d points in [0,1)^d is constructed by partitioning the unit cube [0,1)^d into m^d axis-aligned cubes of equal size and then placing one point independently and uniformly at random in each cube. We show that there are constants c ≥ 0 and C such that for all d and all m ≥ d the expected non-normalized star discrepancy of a jittered sampling point set satisfies c dm^d-1/2√(1 + log( md))≤𝔼 D^*(P) ≤ C dm^d-1/2√(1 + log( md)). This discrepancy is thus smaller by a factor of Θ(√(1+log(m/d)/m/d) ) than the one of a uniformly distributed random point set of m^d points. This result improves both the upper and the lower bound for the discrepancy of jittered sampling given by Pausinger and Steinerberger (Journal of Complexity (2016)). It also removes the asymptotic requirement that m is sufficiently large compared to d.
READ FULL TEXT
