A polynomial lower bound for testing monotonicity

We show that every algorithm for testing n-variate Boolean functions for monotonicityhas query complexity Ω(n1/4). All previous lower bounds for this problem were designed for non-adaptive algorithms and, as a result, the best previous lower bound for general (possibly adaptive) monotonicity testers was only Ω(logn). Combined with the query complexity of the non-adaptive monotonicity tester of Khot, Minzer, and Safra (FOCS 2015), our lower bound shows that adaptivity can result in at most a quadratic reduction in the query complexity for testing monotonicity. By contrast, we show that there is an exponential gap between the query complexity of adaptive and non-adaptive algorithms for testing regular linear threshold functions (LTFs) for monotonicity. Chen, De, Servedio, and Tan (STOC 2015)recently showed that non-adaptive algorithms require almost Ω(n1/2) queries for this task. We introduce a new adaptive monotonicity testing algorithm which has query complexity O(logn) when the input is a regular LTF.

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

[2]  Eric Blais,et al.  Quantum Algorithm for Monotonicity Testing on the Hypercube , 2015, Theory Comput..

[3]  Dana Ron,et al.  Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..

[4]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[5]  Rocco A. Servedio,et al.  Improved Approximation of Linear Threshold Functions , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[6]  Sourav Chakraborty,et al.  Monotonicity testing and shortest-path routing on the cube , 2010, Comb..

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

[8]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

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

[10]  Toniann Pitassi,et al.  Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling , 2007, FOCS 2007.

[11]  Seshadhri Comandur,et al.  An Optimal Lower Bound for Monotonicity Testing over Hypergrids , 2013, APPROX-RANDOM.

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

[13]  Ryan O'Donnell,et al.  Approximation by DNF: Examples and Counterexamples , 2007, ICALP.

[14]  Shmuel Safra,et al.  Hardness Amplification for Errorless Heuristics , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

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

[16]  Rocco A. Servedio,et al.  Improved Approximation of Linear Threshold Functions , 2009, Computational Complexity Conference.

[17]  Ryan O'Donnell,et al.  The chow parameters problem , 2008, SIAM J. Comput..

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

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

[20]  Elchanan Mossel,et al.  On the noise sensitivity of monotone functions , 2003, Random Struct. Algorithms.

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

[22]  Sofya Raskhodnikova,et al.  Lp-testing , 2014, STOC.

[23]  Michel Talagrand,et al.  How much are increasing sets positively correlated? , 1996, Comb..

[24]  Homin K. Lee.  Learning Talagrand DNF Formulas , 2010, COLT.

[25]  Maryam Hastings.  Open Problem A , 1989 .