On Negatively Dependent Sampling Schemes, Variance Reduction, and Probabilistic Upper Discrepancy Bounds

04/24/2019
by   Michael Gnewuch, et al.
0

We study some notions of negative dependence of a sampling scheme that can be used to derive variance bounds for the corresponding estimator or discrepancy bounds for the underlying random point set that are at least as good as the corresponding bounds for plain Monte Carlo sampling. We provide new pre-asymptotic bounds with explicit constants for the star discrepancy and the weighted star discrepancy of sampling schemes that satisfy suitable negative dependence properties. Furthermore, we compare the different notions of negative dependence and give several examples of negatively dependent sampling schemes.

READ FULL TEXT
research
01/22/2023

Bounds of star discrepancy for HSFC-based sampling

In this paper, we focus on estimating the probabilistic upper bounds of ...
research
02/06/2021

Discrepancy Bounds for a Class of Negatively Dependent Random Points Including Latin Hypercube Samples

We introduce a class of γ-negatively dependent random samples. We prove ...
research
04/21/2021

On Negative Dependence Properties of Latin Hypercube Samples and Scrambled Nets

We study the notion of γ-negative dependence of random variables. This n...
research
12/18/2020

On the distribution of scrambled (0,m,s)-nets over unanchored boxes

We introduce a new quality measure to assess randomized low-discrepancy ...
research
04/07/2013

Constructing Low Star Discrepancy Point Sets with Genetic Algorithms

Geometric discrepancies are standard measures to quantify the irregulari...
research
09/08/2023

Computable error bounds for quasi-Monte Carlo using points with non-negative local discrepancy

Let f:[0,1]^d→ℝ be a completely monotone integrand as defined by Aistlei...
research
06/18/2018

End-to-end Sampling Patterns

Sample patterns have many uses in Computer Graphics, ranging from proced...

Please sign up or login with your details

Forgot password? Click here to reset