Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples

In [B. Doerr, M. Gnewuch, P. Kritzer, F. Pillichshammer. Monte Carlo Methods Appl., 14:129–149, 2008], a component-by-component (CBC) approach to generate small low-discrepancy samples was proposed and analyzed. The method is based on randomized rounding satisfying hard constraints and its derandomization. In this paper we discuss how to implement the algorithm and present first numerical experiments. We observe that the generated points in many cases have a significantly better star discrepancy than what is guaranteed by the theoretical upper bound. Moreover, we exhibit that the actual discrepancy is mainly caused by the underlying grid structure, whereas the rounding errors have a negligible contribution. Hence to improve the algorithm, we propose and analyze a randomized point placement. We also study a hybrid approach which combines classical low-discrepancy sequences and the CBC algorithm.

[1]  J. Halton.  On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , 1960 .

[2]  E. Novak,et al.  The inverse of the star-discrepancy depends linearly on the dimension , 2001 .

[3]  Peter Kritzer,et al.  Component-by-component construction of low-discrepancy point sets of small size , 2008, Monte Carlo Methods Appl..

[4]  Eric Thiémard.  Optimal volume subintervals with k points and star discrepancy via integer programming , 2001, Math. Methods Oper. Res..

[5]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[6]  Benjamin Doerr,et al.  Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding , 2008 .

[7]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[8]  Fred J. Hickernell,et al.  On tractability of weighted integration over bounded and unbounded regions in Reals , 2004, Math. Comput..

[9]  Bruno Tuffin,et al.  A central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance , 2006, J. Complex..

[10]  Harald Niederreiter,et al.  Monte Carlo and Quasi-Monte Carlo Methods 2006 , 2007 .

[11]  Anand Srivastav,et al.  Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems , 2009, J. Complex..

[12]  Michael Gnewuch.  On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence , 2009, J. Complex..

[13]  Jerome Spanier,et al.  Quasi-Monte Carlo Methods for Particle Transport Problems , 1995 .

[14]  Anand Srivastav,et al.  Bounds and constructions for the star-discrepancy via ?-covers , 2005, J. Complex..

[15]  H. Niederreiter,et al.  Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing , 1995 .

[16]  Stefan Heinrich.  Some open problems concerning the star-discrepancy , 2003, J. Complex..

[17]  Eric Thiémard,et al.  An Algorithm to Compute Bounds for the Star Discrepancy , 2001, J. Complex..

[18]  P. Raghavan.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[19]  Magnus Wahlström,et al.  Randomized Rounding in the Presence of a Cardinality Constraint , 2009, ALENEX.

[20]  Michael Gnewuch.  Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy , 2008, J. Complex..

[21]  R. Caflisch.  Monte Carlo and quasi-Monte Carlo methods , 1998, Acta Numerica.