Yuval Rabani
ABSTRACT
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dimension n and in 1/ε. To the best of our knowledge no such constructions were previously known. Our results match, up to the exponent of the polynomial, the bounds that are achieved by probabilistic arguments. As a corollary we also construct subsets of the binary cube that have size polynomial in n and covering radius of n/2 - c√{n log n}, for any constant c. This improves upon the well known construction of dual BCH codes that only guarantee covering radius of n/2 - c√n.
- and P.Sarnak A. Lubotzky, R. Phillips. Ramanujan graphs. Combinatorica, 8(3):261--277, 1988.Google Scholar
Cross Ref
- N. Alon. Private communication, 2008.Google Scholar
- N. Alon, U. Feige, A. Wigderson, and D. Zuckerman. Derandomized graph products. Computational Complexity, 5(1):60--75, 1995. Google ScholarDigital Library
- N. Alon, G. Gutin, and M. Krivelevich. Algorithms with large domination ratio. J. Algorithms, 50(1):118--131, 2004. Google ScholarDigital Library
- N. Alon, H. Kaplan, G. Nivasch, M. Sharir, and S. Smorodinsky. Weak ε-nets and interval chains. In Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pages 1194--1203, 2008. Google ScholarDigital Library
- N. Alon and J. Spencer. the probabilistic method. J. Wiley, 3 edition, 2008.Google Scholar
- B. Berger. The fourth moment method. SIAM J. Comput., 26(4):1188--1207, 1997. Google ScholarDigital Library
- E. J. Candés and T. Tao. Near-optimal signal recovery from random projections: universal encoding strategies. IEEE Trans. Inform. Theory, 52(12):5406--5425, 2006. Google ScholarDigital Library
- J. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comput. Syst. Sci., 18:143--154, 1979.Google ScholarCross Ref
- B. Chazelle. Computational geometry: a retrospective. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing (STOC), pages 75--94, 1994. Google ScholarDigital Library
- D. L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289--1306, 2006. Google ScholarDigital Library
- L. Engebretsen, P. Indyk, and R. O’Donnell. Derandomized dimensionality reduction with applications. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 705--712, 2002. Google ScholarDigital Library
- 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, pages 10--16, 1992. Google ScholarDigital Library
- M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with 0(1) worst case access time. J. ACM, 31(3):538--544, 1984. Google ScholarDigital Library
- V. Guruswami, J. R. Lee, and A. A. Razborov. Almost euclidean subspaces of ln1 via expander codes. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 353--362, 2008. Google ScholarDigital Library
- V. Guruswami, J. R. Lee, and A. Wigderson. Euclidean sections of with sublinear randomness and error-correction over the reals. In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, pages 444--454, 2008. Google ScholarDigital Library
- P. Indyk. Uncertainty principles, extractors, and explicit embeddings of l2 into l1. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 615--620, 2007. Google ScholarDigital Library
- W. B. Johnson and J. Lindenstrauss. Extensions of lipschitz maps into a hilbert space. Contemporary Mathematics, 26:189--206, 1984.Google ScholarCross Ref
- 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(2):215--234, 1997.Google ScholarCross Ref
- G. A. Margulis. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Problems of Information Transmission, 24(1):39--46, 1988.Google Scholar
- J. Matousek. Lectures on discrete Geometry. GTM. springer, 2002. Google ScholarDigital Library
- J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. on Computing, 22(4):838--856, 1993. Google ScholarDigital Library
- J. P. Schmidt and A. Siegel. The analysis of closed hashing under limited randomness (extended abstract). In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing (STOC), pages 224--234, 1990. Google ScholarDigital Library
- D. Sivakumar. Algorithmic derandomization via complexity theory. In Proceedings on 34th Annual ACM Symposium on Theory of Computing (STOC), pages 619--626, 2002. Google ScholarDigital Library
- 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), pages 124--127, 2008. Google ScholarDigital Library
Index Terms
- Explicit construction of a small epsilon-net for linear threshold functions
Recommendations
Tight lower bounds for the size of epsilon-nets
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometryAccording to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an ε-net of size O(1/ε log 1/ε). Using probabilistic techniques, Pach and Woeginger (1990) showed that there exist range spaces of VC-...
Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions
We give explicit constructions of $\epsilon$-nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dimension $n$ and in $\frac{1}{\epsilon}$. To the best of our knowledge no ...
Fast segment insertion and incremental construction of constrained delaunay triangulations
SoCG '13: Proceedings of the twenty-ninth annual symposium on Computational geometryThe most commonly implemented method of constructing a constrained Delaunay triangulation (CDT) in the plane is to first construct a Delaunay triangulation, then incrementally insert the input segments one by one. For typical implementations of segment ...
Comments