Bounded independence fools halfspaces

SIAM Journal on Computing

Volumn 39, Issue 8, 2010, Pages 3441-3462

  Diakonikolas, Ilias ^a   Gopalan, Parikshit ^b   Jaiswal, Ragesh ^a   Servedio, Rocco A ^a   Viola, Emanuele ^c  

^a Department of Earth and Environmental Sciences   (United States)

^b MSR Silicon Valley   (United States)

^c Northeastern University   (United States)

Author keywords

Halfspace; K wise independent distribution; Linear threshold function; Pseudorandom generator

Indexed keywords

BOUNDED INDEPENDENCE; HALF SPACES; HALF-SPACE; K-WISE INDEPENDENT DISTRIBUTION; LINEAR THRESHOLD FUNCTION; LINEAR THRESHOLD FUNCTIONS; PSEUDORANDOM GENERATORS; REAL NUMBER; STANDARD CONSTRUCTIONS;

APPROXIMATION THEORY;

EID: 78751521612     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/100783030     Document Type: Article

References (61)

1. N. ACHIESER, Theory of Approximation, Frederik Ungar Publishing, New York, 1956.
2. M. AJTAI AND A. WIGDERSON, Deterministic simulation of probabilistic constant depth circuits, in Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Press, Piscataway, NJ, 1985, pp. 11-19.
3. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized algorithm for the maximalindependent set problem, J. Algorithms, 7 (1986), pp. 567-583.
4. N. ALON, O. GOLDREICH, J. HÅSTAD, AND R. PERALTA, Simple constructions of almost k-wiseindependent random variables, Random Structures Algorithms, 3 (1992), pp. 289-304.
5. L. BAZZI, Polylogarithmic independence can fool DNF formulas, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), IEEE Computer Society Press, Piscataway, NJ, 2007, pp. 63-73.
6. R. BEIGEL, Perceptrons, PP, and the polynomial hierarchy, Comput. Complexity, 4 (1994), pp. 339-349.
7. I. BEN-ELIEZER, S. LOVETT, AND A. YADIN, Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness, manuscript, 2009; available online at http://arxiv.org/abs/0911.3473.
8. I. BENJAMINI, O. GUREL-GUREVICH, AND R. PELED, On k-wise Independent Distributions and Boolean Functions, manuscript, 2007; available online at http://www.wisdom.weizmann. ac.il/~origurel/.
9. I. BENJAMINI, G. KALAI, AND O. SCHRAMM, Noise sensitivity of Boolean functions and applications to percolation, Inst. Hautes Études Sci. Publ. Math., 90 (1999), pp. 5-43.
10. A. BOGDANOV AND E. VIOLA, Pseudorandom bits for polynomials, SIAM J. Comput., 39 (2010), pp. 2464-2486.
11. 0 circuits, in Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC), IEEE Press, Piscataway, NJ, 2009, pp. 3-8.
12. N. CAROTHERS, A Short Course on Approximation Theory, course notes, 1998; available online at http://personal.bgsu.edu/~carother/Approx.html.
13. E. CHENEY, Introduction to Approximation Theory, McGraw-Hill, New York, 1966.
14. B. CHOR AND O. GOLDREICH, On the power of two-point based sampling, J. Complexity, 5 (1989), pp. 96-106.
15. B. CHOR, O. GOLDREICH, J. HÅSTAD, J. FRIEDMAN, S. RUDICH, AND R. SMOLENSKY, The bit extraction problem and t-resilient functions, in Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Press, Piscataway, NJ, 1985, pp. 396-407.
16. M. DERTOUZOS, Threshold Logic: A Synthesis Approach, MIT Press, Cambridge, MA, 1965.
17. I. DIAKONIKOLAS, P. GOPALAN, R. JAISWAL, R.A. SERVEDIO, AND E. VIOLA, Bounded Independence Fools Halfspaces, in Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Press, Piscataway, NJ, 2009, pp. 171-180.
18. I. DIAKONIKOLAS, D.M. KANE, AND J. NELSON, Bounded Independence Fools Degree-2 Threshold Functions, manuscript, 2009; also available as Electronic Colloquium on Computational Complexity (ECCC) Technical Report 09-117.
19. I. DIAKONIKOLAS, R.A. SERVEDIO, L.Y. TAN, AND A. WAN, A regularity lemma, and lowweight approximators, for low-degree polynomial threshold functions, in Proceedings of the 25th Annual IEEE Conference on Computational Complexity (CCC), 2010, IEEE Press, Piscataway, NJ, pp. 211-222.
20. I. DIAKONIKOLAS AND R. SERVEDIO, Improved approximation of linear threshold functions, in Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC), IEEE Press, Piscataway, NJ, 2009, pp. 161-172.
21. P. DUBEY AND L. SHAPLEY, Mathematical properties of the Banzhaf power index, Math. Oper. Res., 4 (1979), pp. 99-131.
22. A. EREMENKO AND P. YUDITSKII, Uniform approximation of sgn(x) by polynomials and entire functions, J. Anal. Math., 12 (2007), pp. 313-324.
23. J. FORSTER, M. KRAUSE, S. LOKAM, R. MUBARAKZJANOV, N. SCHMITT, AND H.-U. SIMON, Relations between communication complexity, linear arrangements, and computational complexity, in Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Lecture Notes in Comput. Sci. 2245, Springer, New York, 2001, pp. 171-182. (Pubitemid 33371161)
24. M. GOLDMANN, J. HÅSTAD, AND A. RAZBOROV, Majority gates vs. general weighted threshold gates, Comput. Complexity, 2 (1992), pp. 277-300.
25. M. GOLDMANN AND M. KARPINSKI, Simulating threshold circuits by majority circuits, SIAM J. Comput., 27 (1998), pp. 230-246.
26. P. GOPALAN, R. O'DONNELL, Y. WU, AND D. ZUCKERMAN, Fooling functions of halfspaces under product distributions, in Proceedings of the 25th Annual IEEE Conference on Computational Complexity (CCC), 2010, IEEE Press, Piscataway, NJ, pp. 223-234.
27. P. GOPALAN AND J. RADHAKRISHNAN, Finding duplicates in a data stream, in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 2009, pp. 402-411.
28. A. HAJNAL, W. MAASS, P. PUDLAK, M. SZEGEDY, AND G. TURAN, Threshold circuits of bounded depth, J. Comput. System Sci., 46 (1993), pp. 129-154.
29. J. HÅSTAD, On the size of weights for threshold gates, SIAM J. Discrete Math., 7 (1994), pp. 484-492.
30. P. HARSHA, A. KLIVANS, AND R. MEKA, Bounding the Sensitivity of Polynomial Threshold Functions, manuscript, 2009; available online at http://arxiv.org/abs/0909.5175.
31. S. HU, Threshold Logic, University of California Press, Berkeley, CA, 1965.
32. J. ISBELL, A counterexample in weighted majority games, Proc. Amer. Math. Soc., 20 (1969), pp. 590-592.
33. A.T. KALAI, A.R. KLIVANS, Y. MANSOUR, AND R.A. SERVEDIO, Agnostically learning halfspaces, SIAM J. Comput., 37 (2008), pp. 1777-1805.
34. A. KLIVANS, R. O'DONNELL, AND R. SERVEDIO, Learning intersections and thresholds of halfspaces, J. Comput. System Sci., 68 (2004), pp. 808-840.
35. A.R. KLIVANS AND A.A. SHERSTOV, A lower bound for agnostically learning disjunctions, in Proceedings of the Conference on Learning Theory (COLT'07), Lecture Notes in Comput. Sci. 4539, Springer, New York, 2007, pp. 409-423.
36. M. KRAUSE, Geometric arguments yield better bounds for threshold circuits and distributed computing, Theoret. Comput. Sci., 156 (1996), pp. 99-117.
37. M. KRAUSE AND S. WAACK, Variation ranks of communication matrices and lower bounds for depth-two circuits having nearly symmetric gates with unbounded fan-in, Math. Systems Theory, 28 (1995), pp. 553-564.
38. P. LEWIS AND C. COATES, Threshold Logic, Wiley, New York, 1967.
39. N. LINIAL AND N. NISAN, Approximate inclusion-exclusion, Combinatorica, 10 (1990), pp. 349-365.
40. S. LOVETT, Unconditional pseudorandom generators for low degree polynomials, in Proceedings of the 40th Annual Symposium on the Theory of Computing (STOC), ACM, New York, 2008, pp. 557-562.
41. M. LUBY, B. VELICKOVIC, AND A. WIGDERSON, Deterministic approximate counting of depth-2 circuits, in Proceedings of the 2nd Israel Symposium on Theory of Computing and Systems (ISTCS), 1993, IEEE Computer Society Press, Piscataway, NJ, pp. 18-24.
42. W. MAASS AND G. TURAN, How fast can a threshold gate learn?, in Computational Learning Theory and Natural Learning Systems, Vol. I, Constraints and Prospects, MIT Press, Cambridge, MA, 1994, pp. 381-414.
43. K. MATULEF, R. O'DONNELL, R. RUBINFELD, AND R.A. SERVEDIO, Testing halfspaces, SIAM J. Comput., 39 (2010), pp. 2004-2047.
44. R. MEKA AND D. ZUCKERMAN, Pseudorandom generators for polynomial threshold functions, in Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), Cambridge, MA, 2010, ACM, New York, pp. 427-436.
45. S. MUROGA, Threshold Logic and Its Applications, Wiley-Interscience, New York, 1971.
46. J. NAOR AND M. NAOR, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22 (1993), pp. 838-856.
47. N. NISAN, Pseudorandom generators for space-bounded computations, Combinatorica, 12 (1992), pp. 449-461.
48. N. NISAN, Pseudorandom bits for constant depth circuits, Combinatorica, 11 (1991), pp. 63-70.
49. N. NISAN AND M. SZEGEDY, On the degree of Boolean functions as real polynomials, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 1992, pp. 462-467.
50. R. O'DONNELL AND R. SERVEDIO, The Chow parameters problem, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 2008, pp. 517-526.
51. R. PATURI, On the degree of polynomials that approximate symmetric Boolean functions, in Proceedings of the 24th ACM Symposium on Theory of Computing (STOC), ACM, New York, 1992, pp. 468-474.
52. L. PENROSE, The elementary statistics of majority voting, J. Roy. Statist. Soc., 109 (1946), pp. 53-57.
53. Y. PERES, Noise Stability of Weighted Majority, manuscript 2004; available online at http://arxiv.org/abs/math/0412377.
54. Y. RABANI AND A. SHPILKA, Explicit construction of a small epsilon-net for linear threshold functions, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 2009, pp. 649-658.
55. A. RAZBOROV, A simple proof of Bazzi's theorem, Trans. Comput. Theory, 1 (2009), pp. 1-5.
56. T. J. RIVLIN, The Chebyshev Polynomials, Wiley, New York, 1974.
57. R. SERVEDIO, Every linear threshold function has a low-weight approximator, Comput. Complexity, 16 (2007), pp. 180-209.
58. Q. SHENG, Threshold Logic, Academic Press, London, New York, 1969.
59. A. TAYLOR AND W. ZWICKER, A characterization of weighted voting, Proc. Amer. Math. Soc.,115 (1992), pp. 1089-1094.
60. E. VIOLA, The sum of d small-bias generators fools polynomials of degree d, Comput. Complexity, 18 (2009), pp. 209-217.
61. E. VIOLA, Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates, SIAM J. Comput., 36 (2007), pp. 1387-1403. (Pubitemid 47632452)