Explicit construction of a small ∈-net for linear threshold functions

SIAM Journal on Computing

Volumn 39, Issue 8, 2010, Pages 3501-3520

  Rabani, Yuval ^a   Shpilka, Amir ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

net; Derandomization; Explicit construction; Hitting sets

Indexed keywords

COVERING RADIUS; DERANDOMIZATION; DUAL-BCH CODES; EXPLICIT CONSTRUCTION; EXPLICIT CONSTRUCTIONS; HITTING SETS; LINEAR THRESHOLD FUNCTIONS; PROBABILISTIC ARGUMENTS;

SPHERES;

POLYNOMIALS;

EID: 78751535374     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090764190     Document Type: Article

References (31)

1. N. ALON, U. FEIGE, A. WIGDERSON, AND D. ZUCKERMAN, Derandomized graph products, Comput. Complexity, 5 (1995), pp. 60-75.
2. N. ALON, G. GUTIN, AND M. KRIVELEVICH, Algorithms with large domination ratio, J. Algorithms, 50 (2004), pp. 118-131.
3. N. ALON, H. KAPLAN, G. NIVASCH, M. SHARIR, AND S. SMORODINSKY, Weak ε-nets and interval chains, in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, 2008, pp. 1194-1203.
4. N. ALON, private communication, 2008.
5. N. ALON AND J. SPENCER, The Probabilistic Method, 3rd ed., Wiley, 2008.
6. B. BERGER, The fourth moment method, SIAM J. Comput., 26 (1997), pp. 1188-1207.
7. B. CHAZELLE, Computational geometry: A retrospective, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC), Montreal, 1994, pp. 75-94.
8. B. CHAZELLE AND J. MATOUSEK, On linear-time deterministic algorithms for optimization problems in fixed dimension, J. Algorithms, 21 (1996), pp. 579-597.
9. E. J. CANDÉS and T. TAO, Near-optimal signal recovery from random projections: Universal encoding strategies, IEEE Trans. Inform. Theory, 52 (2006), pp. 5406-5425.
10. J. L. CARTER AND M. N. WEGMAN, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), pp. 143-154.
11. I. DIAKONIKOLAS, P. GOPALAN, R. JAISWAL, R. A. SERVEDIO, AND E. VIOLA, Bounded independence fools halfspaces, SIAM J. Comput., to appear.
12. D. L. DONOHO, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
13. D. P. DUBHASHI AND A. PANCONESI, Concentration of Measure for the Analysis of Randomized Algorithms, Cambridge University Press, Cambridge, UK, 2009.
14. G. EVEN, O. GOLDREICH, M. LUBY, N. NISAN, AND B. VELICKOVIC, Approximations of general independent distributions, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC), Victoria, BC, 1992, pp. 10-16.
15. L. ENGEBRETSEN, P. INDYK, AND R. O'DONNELL, Derandomized dimensionality reduction with applications, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, 2002, pp. 705-712.
16. M. L. FREDMAN, J. KOMLÓS, AND E. SZEMERÉDI, Storing a sparse table with O(1) worst case access time, J. ACM, 31 (1984), pp. 538-544.
17. nvia expander codes, in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, 2008, pp. 353-362.
18. Nwith sublinear randomness and error-correction over the reals, in Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, Lecture Notes in Comput. Sci. 5171, Springer, Berlin, Heidelberg, 2008, pp. 444-454.
19. P. INDYK, Uncertainty principles, extractors, and explicit embeddings of ℓ2 into ℓ1, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), San Diego, 2007, pp. 615-620.
20. W. B. JOHNSON AND J. LINDENSTRAUSS, Extensions of Lipschitz maps into a Hilbert space, in Contemp. Math. 26, AMS, Providence, 1984, pp. 189-206.
21. N. LINIAL, M. LUBY, M. E. SAKS, AND D. ZUCKERMAN, Efficient construction of a small hitting set for combinatorial rectangles in high dimension, Combinatorica, 17 (1997), pp. 215-234.
22. A. LUBOTZKY, R. PHILLIPS, AND P. SARNAK, Ramanujan graphs, Combinatorica, 8 (1988), pp. 261-277.
23. G. A. MARGULIS, Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators, Probl. Inf. Transm., 24 (1988), pp. 39-46.
24. J. MATOUSEK, Lectures on Discrete Geometry, Grad. Texts in Math. 212, Springer, New York, 2002.
25. R. MEKA AND D. ZUCKERMAN, Pseudorandom generators for polynomial threshold functions, in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), Cambridge, MA, 2010, pp. 427-436.
26. J. NAOR AND M. NAOR, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22 (1993), pp. 838-856.
27. Y. RABANI AND A. SHPILKA, Explicit construction of a small epsilon-net for linear threshold functions, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), Bethesda, MD, 2009, pp. 649-658.
28. R. A. SERVEDIO, Every linear threshold function has a low-weight approximator, in Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC), Prague, 2006, pp. 18-32.
29. D. SIVAKUMAR, Algorithmic derandomization via complexity theory, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), Montreal, 2002, pp. 619-626. (Pubitemid 35009423)
30. J. P. SCHMIDT AND A. SIEGEL, The analysis of closed hashing under limited randomness (extended abstract), in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), Baltimore, 1990, pp. 224-234.
31. E. VIOLA, The sum of d small-bias generators fools polynomials of degree d, in Proceedings of the 23rd Annual IEEE Conference on Computational Complexity (CCC), College Park, MD, 2008, pp. 124-127.