A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting

We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to the algorithm for discrepancy approximation of Winker and Fang [SIAM J. Numer. Anal., 34 (1997), pp. 2028-2042] it is based on the optimization algorithm threshold accepting. Our improvements include, amongst others, a nonuniform sampling strategy, which is more suited for higher-dimensional inputs and additionally takes into account the topological characteristics of given point sets, and rounding steps which transform axis-parallel boxes, on which the discrepancy is to be tested, into critical test boxes. These critical test boxes provably yield higher discrepancy values and contain the box that exhibits the maximum value of the local discrepancy. We provide comprehensive experiments to test the new algorithm. Our randomized algorithm computes the exact discrepancy frequently in all cases where this can be checked (i.e., where the exact discrepancy of the point set can be computed in feasible time). Most importantly, in higher dimensions the new method behaves clearly better than all previously known methods.

[1]  E. Haacke.  Sequences , 2005 .

[2]  S. Manan,et al.  A genetic algorithm approach to estimate lower bounds of the star discrepancy , 2010 .

[3]  George Marsaglia,et al.  In: Applications of Number Theory to Numerical Analysis , 1972 .

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

[5]  Magnus Wahlström,et al.  Algorithmic construction of low-discrepancy point sets via dependent randomized rounding , 2010, J. Complex..

[6]  David Eppstein,et al.  Computing the discrepancy with applications to supersampling patterns , 1996, TOGS.

[7]  Josef Dick,et al.  Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy , 2005, SIAM J. Numer. Anal..

[8]  Magnus Wahlström,et al.  Hardness of discrepancy computation and epsilon-net verification in high dimension , 2011, ArXiv.

[9]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[10]  Karin Frank,et al.  Computing Discrepancies of Smolyak Quadrature Rules , 1996, J. Complex..

[11]  H. Keng,et al.  Applications of number theory to numerical analysis , 1981 .

[12]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1959 .

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

[14]  Magnus Wahlström,et al.  Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples , 2009 .

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

[16]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1958 .

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

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

[19]  Aicke Hinrichs,et al.  Tractability properties of the weighted star discrepancy , 2008, J. Complex..

[20]  Ingo Althöfer,et al.  On the convergence of “Threshold Accepting” , 1991 .

[21]  William W. L. Chen.  On irregularities of distribution. , 1980 .

[22]  Magnus Wahlström,et al.  Hardness of discrepancy computation and ε-net verification in high dimension , 2012, J. Complex..

[23]  Harald Niederreiter,et al.  Discrepancy and convex programming , 1972 .

[24]  Tony Warnock,et al.  Computational investigations of low-discrepancy point-sets. , 1972 .

[25]  Robert F. Tichy,et al.  Sequences, Discrepancies and Applications , 1997 .

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

[27]  Frances Y. Kuo,et al.  Constructing Sobol Sequences with Better Two-Dimensional Projections , 2008, SIAM J. Sci. Comput..

[28]  Bernard Chazelle,et al.  The Discrepancy Method , 1998, ISAAC.

[29]  F. Pillichshammer,et al.  Digital Nets and Sequences: Nets and sequences , 2010 .

[30]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[31]  Stefan Heinrich,et al.  Efficient algorithms for computing the L2-discrepancy , 1996, Math. Comput..

[32]  Stephen Joe,et al.  Good lattice rules based on the general weighted star discrepancy , 2007, Math. Comput..

[33]  Yuan Wang,et al.  Some Applications of Number-Theoretic Methods in Statistics , 1994 .

[34]  Michael Gnewuch,et al.  Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces , 2012, J. Complex..

[35]  K. Fang,et al.  Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points , 1997 .

[36]  David S. Johnson,et al.  A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.

[37]  Manan Shah.  A genetic algorithm approach to estimate lower bounds of the star discrepancy , 2010, Monte Carlo Methods Appl..

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

[39]  Y. Zhu,et al.  A method for exact calculation of the discrepancy of low-dimensional finite point sets I , 1993 .

[40]  C. Lemieux.  Monte Carlo and Quasi-Monte Carlo Sampling , 2009 .

[41]  I. Sobol.  On the distribution of points in a cube and the approximate evaluation of integrals , 1967 .

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

[43]  E. Novak,et al.  Tractability of Multivariate Problems , 2008 .

[44]  S. Joe.  Construction of Good Rank-1 Lattice Rules Based on the Weighted Star Discrepancy , 2006 .