Settling the Query Complexity of Non-Adaptive Junta Testing

We prove that any non-adaptive algorithm that tests whether an unknown Boolean function f is a k-junta or epsilon-far from every k-junta must make ~Omega(k^{3/2}/ epsilon) many queries for a wide range of parameters k and epsilon. Our result dramatically improves previous lower bounds from [BGSMdW13,STW15], and is essentially optimal given Blais's non-adaptive junta tester from [Blais08], which makes ~O(k^{3/2})/epsilon queries. Combined with the adaptive tester of [Blais09] which makes O(k log k + k / epsilon) queries, our result shows that adaptivity enables polynomial savings in query complexity for junta testing.

[1]  L. H. Harper.  Optimal Assignments of Numbers to Vertices , 1964 .

[2]  Eric Blais.  Improved Bounds for Testing Juntas , 2008, APPROX-RANDOM.

[3]  A. J. Bernstein,et al.  Maximally Connected Arrays on the n-Cube , 1967 .

[4]  Rocco A. Servedio,et al.  Adaptivity Helps for Testing Juntas , 2015, CCC.

[5]  Dana Ron,et al.  Algorithmic and Analysis Techniques in Property Testing , 2010, Found. Trends Theor. Comput. Sci..

[6]  Oded Goldreich,et al.  Property Testing - Current Research and Surveys , 2010, Property Testing.

[7]  Rocco A. Servedio,et al.  Testing Halfspaces , 2007, SIAM J. Comput..

[8]  Ryan O'Donnell,et al.  Testing ±1-weight halfspace , 2009, APPROX-RANDOM.

[9]  Seshadhri Comandur,et al.  A o(n) monotonicity tester for boolean functions over the hypercube , 2013, STOC '13.

[10]  B. Roos.  Binomial Approximation to the Poisson Binomial Distribution: The Krawtchouk Expansion , 2001 .

[11]  Rocco A. Servedio,et al.  New Algorithms and Lower Bounds for Monotonicity Testing , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[12]  Eric Blais,et al.  A polynomial lower bound for testing monotonicity , 2016, STOC.

[13]  Sofya Raskhodnikova,et al.  Testing Unateness of Real-Valued Functions , 2016, ArXiv.

[14]  Rocco A. Servedio,et al.  Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities , 2013, Algorithmica.

[15]  Subhash Khot,et al.  On Monotonicity Testing and Boolean Isoperimetric Type Theorems , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[16]  Daniel M. Kane,et al.  Tight Bounds for Testing k-Linearity , 2012, APPROX-RANDOM.

[17]  Rocco A. Servedio,et al.  Testing Fourier Dimensionality and Sparsity , 2009, SIAM J. Comput..

[18]  Ronitt Rubinfeld,et al.  Monotonicity testing over general poset domains , 2002, STOC '02.

[19]  Seshadhri Comandur,et al.  A Õ(n) Non-Adaptive Tester for Unateness , 2016, Electron. Colloquium Comput. Complex..

[20]  Dana Ron,et al.  Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..

[21]  J. Adell,et al.  Exact Kolmogorov and total variation distances between some familiar discrete distributions , 2006 .

[22]  Peter Frankl,et al.  On the Trace of Finite Sets , 1983, J. Comb. Theory, Ser. A.

[23]  Dana Ron,et al.  Testing Computability by Width-Two OBDDs , 2009, Electron. Colloquium Comput. Complex..

[24]  Rocco A. Servedio,et al.  Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries , 2014, STOC.

[25]  Dana Ron,et al.  Property Testing: A Learning Theory Perspective , 2007, COLT.

[26]  Hana Chockler,et al.  A lower bound for testing juntas , 2004, Inf. Process. Lett..

[27]  Dana Ron,et al.  Testing Monotonicity , 2000, Comb..

[28]  John H. Lindsey,et al.  Assignment of Numbers to Vertices , 1964 .

[29]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[30]  Guy Kindler,et al.  Testing juntas , 2002, J. Comput. Syst. Sci..

[31]  Subhash Khot,et al.  An Õ(n) Queries Adaptive Tester for Unateness , 2016, Electron. Colloquium Comput. Complex..

[32]  Rocco A. Servedio,et al.  Testing for Concise Representations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[33]  Madhu Sudan,et al.  Optimal Testing of Reed-Muller Codes , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[34]  Noga Alon,et al.  Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.

[35]  Sergiu Hart,et al.  A note on the edges of the n-cube , 1976, Discret. Math..

[36]  Eric Blais.  Testing juntas nearly optimally , 2009, STOC '09.

[37]  Ronald de Wolf,et al.  The non-adaptive query complexity of testing k-parities , 2013, Chic. J. Theor. Comput. Sci..

[38]  Joshua Brody,et al.  Property Testing Lower Bounds via Communication Complexity , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.