Weighted $L_p$-Discrepancy Bounds for Parametric Stratified Sampling and Applications to High-Dimensional Integration
Xiaoda Xu

TL;DR
This paper develops bounds for the expected weighted $L_p$-discrepancy of parametric stratified sampling schemes, providing theoretical guarantees and demonstrating improved high-dimensional integration performance over classical methods.
Contribution
It introduces a parametric family of stratified partitions and derives explicit bounds for weighted $L_p$-discrepancy, advancing the theoretical understanding of stratified sampling in high dimensions.
Findings
Explicit bounds for $p=2$ using exact formulas
Probabilistic bounds for $p>2$ via dyadic chaining
Improved integration accuracy over jittered sampling
Abstract
This paper studies the expected -discrepancy () for stratified sampling schemes under importance sampling. We introduce a parametric family of equivolume partitions and leverage recent exact formulas for the expected -discrepancy \cite{xian2025improved}. Our main contribution is a weighted discrepancy reduction lemma that relates weighted -discrepancy to standard -discrepancy with explicit constants depending on the weight function. For , we obtain explicit bounds using the exact discrepancy formulas. For , we derive probabilistic bounds via dyadic chaining techniques. The results yield uniform error estimates for multivariate integration in Sobolev spaces and , demonstrating improved performance over classical jittered sampling in importance sampling scenarios. Numerical experiments…
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.
Taxonomy
TopicsMathematical Approximation and Integration · Markov Chains and Monte Carlo Methods · Probabilistic and Robust Engineering Design
