Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity

The Total Influence (Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influe nce of a monotone Boolean function f : f0;1g n ! f 0;1g, which we denote by I[f]. We present a randomized algorithm that approximates the influence of such functions to within a multip licative factor of (1 � �) by performing O � p nlog n I[f] poly(1=�) � queries. We also prove a lower bound of � p n log n·I[f] � on the query complexity of any constant-factor approximation algorithm for this problem (which holds for I[f] = (1)), hence showing that our algorithm is almost optimal in terms of its dependence on n. For general functions we give a lower bound of � n I[f] � , which matches the complexity of a simple sampling algorithm.

[1]  Nader H. Bshouty,et al.  On the Fourier spectrum of monotone functions , 1996, JACM.

[2]  Michel Talagrand,et al.  On boundaries and influences , 1997, Comb..

[3]  N. Linial,et al.  The influence of variables in product spaces , 1992 .

[4]  Prasad Raghavendra,et al.  Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions , 2009, SIAM J. Comput..

[5]  Ehud Friedgut,et al.  Influences in Product Spaces: KKL and BKKKL Revisited , 2004, Combinatorics, Probability and Computing.

[6]  Ryan O'Donnell,et al.  Learning Monotone Decision Trees in Polynomial Time , 2007, SIAM J. Comput..

[7]  G. Kalai,et al.  Every monotone graph property has a sharp threshold , 1996 .

[8]  Gil Kalai,et al.  A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem , 2002, Adv. Appl. Math..

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

[10]  Benny Sudakov,et al.  A Sharp Threshold for Network Reliability , 2002, Combinatorics, Probability and Computing.

[11]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[12]  Ehud Friedgut,et al.  Boolean Functions With Low Average Sensitivity Depend On Few Coordinates , 1998, Comb..

[13]  R. O'Donnell,et al.  On the Fourier tails of bounded functions over the discrete cube , 2007 .

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

[15]  I. Benjamini,et al.  Noise sensitivity of Boolean functions and applications to percolation , 1998 .

[16]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1993, JACM.

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

[18]  Ryan O'Donnell,et al.  Every decision tree has an influential variable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[19]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[20]  Nathan Linial,et al.  Collective coin flipping, robust voting schemes and minima of Banzhaf values , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[21]  Dana Ron,et al.  Testing Computability by Width Two OBDDs , 2009, APPROX-RANDOM.

[22]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.

[23]  Nathan Linial,et al.  Collective Coin Flipping , 1989, Advances in Computational Research.

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

[25]  Ryan O'Donnell,et al.  Learning monotone decision trees in polynomial time , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[26]  Yishay Mansour,et al.  Learning monotone ku DNF formulas on product distributions , 1991, COLT '91.

[27]  J. Bourgain,et al.  Influences of Variables and Threshold Intervals under Group Symmetries , 1997 .

[28]  G. Kalai,et al.  Threshold Phenomena and Influence , 2005 .

[29]  E. Leher.  An axiomatization of the Banzhaf value , 1988 .

[30]  Nathan Linial,et al.  The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[32]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[33]  Ravi B. Boppana,et al.  The Average Sensitivity of Bounded-Depth Circuits , 1997, Inf. Process. Lett..

[34]  I. Benjamini,et al.  Noise sensitivity of Boolean functions and applications to percolation , 1998, math/9811157.

[35]  L. Russo.  On the critical percolation probabilities , 1981 .