# A Sharp Discrepancy Bound for Jittered Sampling

arXiv: https://arxiv.org/abs/2103.15712 · HTML: https://mlsanity.com/paper/2103.15712/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Mar 2021.

## Built on by (most cited first, 1 of 1)

- [The Partition Principle Revisited: Non-Equal Volume Designs Achieve Minimal Expected Star Discrepancy](https://mlsanity.com/paper/2603.00202/) (2026)

## Abstract (arXiv)

For m, d ∈ mathbb N, a jittered sampling point set P having N = md points in [0,1)d is constructed by partitioning the unit cube [0,1)d into md 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^fracd-12 √1 + log(tfrac md) ≤ mathbb E D^*(P) ≤ C, dm^fracd-12 √1 + log(tfrac md).] This discrepancy is thus smaller by a factor of Thetabig(√frac1+log(m/d)m/d,big) than the one of a uniformly distributed random point set of md 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.