On Negative Dependence Properties of Latin Hypercube Samples and Scrambled Nets
Benjamin Doerr, Michael Gnewuch

TL;DR
This paper investigates the negative dependence properties of Latin hypercube samples and scrambled nets, introducing the correlation number concept, and shows these samples are not fully negatively orthant dependent but still exhibit useful negative dependence properties.
Contribution
It introduces the correlation number to quantify negative dependence and analyzes the dependence properties of Latin hypercube sampling and $(t,m,d)$-nets, revealing they are not fully negatively orthant dependent.
Findings
Latin hypercube samples are not negatively orthant dependent.
Latin hypercube sampling in dimension d has a gamma ≤ e^d.
Discrepancy bounds depend mildly on the gamma value.
Abstract
We study the notion of -negative dependence of random variables. This notion is a relaxation of the notion of negative orthant dependence (which corresponds to -negative dependence), but nevertheless it still ensures concentration of measure and allows to use large deviation bounds of Chernoff-Hoeffding- or Bernstein-type. We study random variables based on random points . These random variables appear naturally in the analysis of the discrepancy of or, equivalently, of a suitable worst-case integration error of the quasi-Monte Carlo cubature that uses the points in as integration nodes. We introduce the correlation number, which is the smallest possible value of that ensures -negative dependence. We prove that the random variables of interest based on Latin hypercube sampling or on -nets do, in general, not have a correlation number of…
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 · Geometry and complex manifolds
