Halfspace matrices

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 83-95

  Sherstov, Alexander A ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; LINEAR SYSTEMS; PROBLEM SOLVING; STATE SPACE METHODS; STATISTICAL METHODS;

BOOLEAN MATRIX; CIRCUIT COMPLEXITY; HALFSPACE MATRIX; LINEAR THRESHOLD FUNCTIONS;

MATRIX ALGEBRA;

EID: 34748927136     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.11     Document Type: Conference Paper

References (42)

1. N. Alon, P. Frankl, and V. Rödl. Geometrical realization of set systems and probabilistic communication complexity. In FOCS, pages 277-280, 1985.
2. R. I. Arriaga and S. Vempala. An algorithmic theory of learning: Robust concepts and random projection. In FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, page 616, Washington, DC, USA, 1999. IEEE Computer Society.
3. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In FOCS, pages 337-347, 1986.
4. S. Ben-David, N. Eiron, and H. U. Simon. Limitations of learning via embeddings in Euclidean half spaces. J. Mach. Learn. Res., 3:441-461, 2003.
5. A. Blum, A. M. Frieze, R. Kannan, and S. Vempala. A polynomial-time algorithm for learning noisy linear threshold functions. Algorithmica, 22(1/2):35-52, 1998.
6. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich. Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pages 253-262, New York, NY, USA, 1994. ACM Press.
7. A. Blum, A. Kalai, and H. Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM, 50(4):506-519, 2003.
8. H. Buhrman, N. K. Vereshchagin, and R. de Wolf. On computation and communication with small bias. In 22nd IEEE Conference on Computational Complexity, 2007.
9. C. J. C. Burges. A tutorial on support vector machines for pattern recognition. Data Min. Knowl. Discov., 2(2):121-167, 1998.
10. J. Ford and A. Gál. Hadamard tensors and lower bounds on multiparty communication complexity. In ICALP, pages 1163-1175, 2005.
11. J. Forster. A linear lower bound on the unbounded error probabilistic communication complexity. J. Comput. Syst. Sci., 65(4):612-625, 2002.
12. J. Forster, M. Krause, S. V. Lokam, R. Mubarakzjanov, N. Schmitt, and H.-U. Simon. Relations between communication complexity, linear arrangements, and computational complexity. In FST TCS '01: Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, pages 171-182, London, UK, 2001. Springer-Verlag.
13. J. Forster, N. Schmitt, H. U. Simon, and T. Suttorp. Estimating the optimal margins of embeddings in Euclidean half spaces. Mach. Learn., 51(3):263-281, 2003.
14. J. Forster and H. U. Simon. On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. Theor. Comput. Sci., 350(1):40-48, 2006.
15. M. Goldmann, J. Håstad, and A. A. Razborov. Majority gates vs. general weighted threshold gates. Computational Complexity, 2:277-300, 1992.
16. J. Håstad. On the size of weights for threshold gates. SIAM J. Discret. Math., 7(3):484-492, 1994.
17. B. Kalyanasundaram and G. Schintger. The probabilistic communication complexity of set intersection. SIAM J. Discret. Math., 5(4):545-557, 1992.
18. M. Kearns. Efficient noise-tolerant learning from statistical queries. In STOC '93: Proceedings of the twenty-fifth annual ACM symposium on theory of computing, pages 392-401, New York, NY, USA, 1993. ACM Press.
19. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, Cambridge, MA, USA, 1994.
20. A. R. Klivans, R. O'Donnell, and R. A. Servedio. Learning intersections and thresholds of halfspaces. J. Comput. Syst. Sci., 68(4):808-840, 2004.
21. A. R. Klivans and R. A. Servedio. Learning intersections of halfspaces with a margin. In COLT, pages 348-362, 2004.
22. A. R. Klivans and A. A. Sherstov. Cryptographic hardness for learning intersections of halfspaces. In FOCS '06: Proceedings of the 47th Annual Symposium on Foundations of Computer Science, Berkeley, CA, October 2006.
23. A. R. Klivans and A. A. Sherstov. Improved lower bounds for learning intersections of halfspaces. In Proceedings of the 19th Annual Conference on Learning Theory (COLT), Pittsburg, USA, June 2006.
24. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Computational Complexity, 8(1):21-49, 1999.
25. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, New York, NY, USA, 1997.
26. S. Kwek and L. Pitt. PAC learning intersections of half-spaces with membership queries. Algorithmica, 22(1/2):53-75, 1998.
27. N. Linial, S. Mendelson, G. Schechtman, and A. Shraibman. Complexity measures of sign matrices. Combinatorica, 2006. To appear. Manuscript at http://www.cs.huji.ac.il/~nati/PAPERS/complexity_matrices.ps. gz.
28. N. Linial and A. Shraibman. Learning complexity vs. communication complexity. Manuscript at http: //www.cs.huji.ac.il/~nati/PAPERS/lcc.pdf, December 2006.
29. N. Linial and A. Shraibman. Lower bounds in communication complexity based on factorization norms. Manuscript at http ://www.cs.huji.ac.il/~nati/ PAPERS/ccfn.pdf, December 2006.
30. S. V. Lokam. Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity. J. Comput. Syst. Sci., 63(3):449-473, 2001.
31. R. Paturi and J. Simon. Probabilistic communication complexity. J. Comput. Syst. Sci., 33(1):106-123, 1986.
32. R. Raz. The BNS-Chung criterion for multi-party communication complexity. Comput. Complex., 9(2):113-122, 2000.
33. A. A. Razborov. Ob ustoichivyh matritsah. Research report, Steklov Mathematical Institute, Moscow, Russia, 1989. In Russian. Engl, title: "On rigid matrices".
34. A. A. Razborov. On the distributional complexity of disjointness. Theor. Comput. Sci., 106(2):385-390, 1992.
35. M. E. Saks. Slicing the hypercube. Surveys in combinatorics, 1993, pages 211-255, 1993.
36. H. U. Simon. Spectral norm in learning theory: Some selected topics. In ALT, pages 13-27, 2006.
37. K.-Y. Siu and J. Bruck. On the power of threshold circuits with small weights. SIAM J. Discrete Math., 4(3):423-435, 1991.
38. N. Srebro and A. Shraibman. Rank, trace-norm and maxnorm. In COLT, pages 545-560, 2005.
39. L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, 1984.
40. V. N. Vapnik. The nature of statistical learning theory. Springer-Verlag New York, Inc., New York, NY, USA, 1995.
41. S. Vempala. A random sampling based algorithm for learning the intersection of halfspaces. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 508-513, 1997.
42. K. Yang. New lower bounds for statistical query learning. J. Comput. Syst. Sci., 70(4):485-509, 2005.