Hardness of discrepancy computation and ε-net verification in high dimension

Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. Depending on the ranges, several variants arise, including star discrepancy, box discrepancy, and discrepancy of halfspaces. These problems are solvable in time n^O^(^d^), where d is the dimension of the underlying space. As such a dependency on d becomes intractable for high-dimensional data, we ask whether it can be moderated. We answer this question negatively by proving that the canonical decision problems are W[1]-hard with respect to the dimension, implying that no f(d)@?n^O^(^1^)-time algorithm is possible for any function f(d) unless FPT=W[1]. We also discover the W[1]-hardness of other well known problems, such as determining the largest empty box that contains the origin and is inside the unit cube. This is shown to be hard even to approximate within a factor of 2^n.

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

[2]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[3]  Ying Liu,et al.  The Maximum Box Problem and its Application to Data Analysis , 2002, Comput. Optim. Appl..

[4]  Noga Alon,et al.  A Non-linear Lower Bound for Planar Epsilon-nets , 2010, Discrete & Computational Geometry.

[5]  Luca Trevisan,et al.  On the Efficiency of Polynomial Time Approximation Schemes , 1997, Inf. Process. Lett..

[6]  J. Matousek,et al.  Geometric Discrepancy: An Illustrated Guide , 2009 .

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

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

[9]  János Pach,et al.  Tight lower bounds for the size of epsilon-nets , 2010, SoCG '11.

[10]  Boris Aronov,et al.  On approximating the depth and related problems , 2005, SODA '05.

[11]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[12]  Bernard Chazelle,et al.  The discrepancy method - randomness and complexity , 2000 .

[13]  David Haussler,et al.  Epsilon-nets and simplex range queries , 1986, SCG '86.

[14]  Alok Aggarwal,et al.  Fast algorithms for computing the largest empty rectangle , 1987, SCG '87.

[15]  J. Mark Keil,et al.  The Bichromatic Rectangle Problem in High Dimensions , 2009, CCCG.

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

[17]  E. Haacke.  Sequences , 2005 .

[18]  Günter Rote,et al.  Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension , 2008, SODA '08.

[19]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

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

[21]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[22]  J. Mark Keil,et al.  The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions , 2010, LATIN.

[23]  Ge Xia,et al.  Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

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

[25]  Adrian Dumitrescu,et al.  On the Largest Empty Axis-Parallel Box Amidst n Points , 2009, Algorithmica.

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

[27]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[28]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .