A lower bound for agnostically learning disjunctions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4539 LNAI, Issue , 2007, Pages 409-423

  Klivans, Adam R ^a   Sherstov, Alexander A ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; COMPUTATIONAL COMPLEXITY; FUNCTIONS; POLYNOMIAL APPROXIMATION; REAL TIME SYSTEMS;

LEARNING DISJUNCTIONS; POINTWISE APPROXIMATION; REAL-VALUED FUNCTIONS;

LEARNING ALGORITHMS;

EID: 38049000958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72927-3_30     Document Type: Conference Paper

References (34)

1. Alon, N.: Problems and results in extremal combinatorics, Part I. Discrete Mathematics 273(1-3), 31-53 (2003)
2. Ben-David, S., Eiron, N., Simon, H.U.: Limitations of learning via embeddings in Euclidean half spaces. J. Mach. Learn. Res 3, 441-461 (2003)
3. Bshouty, N.H., Tamon, C.: On the Fourier spectrum of monotone functions. J. ACM 43(4), 747-770 (1996)
4. Buhrman, H., de Wolf, R.: Communication complexity lower bounds by polynomials. In: Conference on Computational Complexity (CCC), pp. 120-130 (2001)
5. Buhrman, H., Vereshchagin, N.K., de Wolf, R.: On computation and communication with small bias. In: 22nd IEEE Conference on Computational Complexity (2007)
6. Decatur, S.E.: Statistical queries and faulty PAC oracles. In: COLT, pp. 262-268 (1993)
7. Forster, J.: A linear lower bound on the unbounded error probabilistic communication complexity. J. Comput. Syst. Sci. 65(4), 612-625 (2002)
8. Forster, J., Simon, H.U.: 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)
9. Golub, G.H., Loan, C.F.V.: Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore, MD, USA (1996)
10. Jackson, J.C.: The harmonic sieve: A novel application of Fourier analysis to machine learning theory and practice. PhD thesis, Carnegie Mellon University (1995)
11. Kalai, A., Klivans, A., Mansour, Y., Servedio, R.: Agnostically learning halfspaces. In: FOCS: IEEE Symposium on Foundations of Computer Science (FOCS) (2005)
12. Kashin, B., Razborov, A.A.: Improved lower bounds on the rigidity of Hadamard matrices (In Russian). Matematicheskie zamet 63(4), 535-540 (1998)
13. Kearns, M.: Efficient noise-tolerant learning from statistical queries. In: STOC '93: Proceedings of the twenty-fifth annual ACM symposium on theory of computing, pp. 392--401. ACM Press, New York (1993)
14. Kearns, M., Li, M.: Learning in the presence of malicious errors. SIAM Journal on Computing 22(4), 807-837 (1993)
15. Kearns, M.J., Shapire, R.E., Sellie, L.M.: Toward efficient agnostic learning. Machine Learning 17(2-3), 115-141 (1994)
16. Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge, MA, USA (1994)
17. Klivans, A.R., O'Donnell, R., Servedio, R.A.: Learning intersections and thresholds of half-spaces. J. Comput. Syst. Sci. 68(4), 808-840 (2004)
18. Õ(n1/3). In: STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 258-265. ACM Press, New York (2001)
19. Kushilevitz, E., Mansour, Y.: Learning decision trees using the Fourier spectrum. SIAM J. Comput. 22(6), 1331-1348 (1993)
20. Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, Cambridge (1997)
21. Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, Fourier transform, and learnability. J. ACM 40(3), 607-620 (1993)
22. Linial, N., Mendelson, S., Schechtman, G., Shraibman, A.: Complexity measures of sign matrices. Combinatorica, (2006) To appear, Manuscript at http ://www.cs.huji.ac.il/~nati/PAPERS/complexity_matrices.ps.gz
23. Linial, N., Shraibman, A.: Learning complexity vs. communication complexity. (December 2006) Manuscript at http://www.cs.huji.ac.il/~nati/PAPERS/ lcc.pdf
24. Linial, N., Shraibman, A.: Lower bounds in communication complexity based on factorization norms. (December 2006) Manuscript at http://www.cs.huji.ac.il/ ~nati/PAPERS/ccfn.pdf
25. Lokam, S.V.: Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity. J. Comput. Syst. Sci. 63(3), 449-473 (2001)
26. log log n) learning algorithm for DNF under the uniform distribution. In: COLT '92: Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pp. 53-61. ACM Press, New York, USA (1992)
27. Mansour, Y., Parnas, M.: On learning conjunctions with malicious noise. In: ISTCS, pp. 170-175 (1996)
28. O'Donnell, R., Servedio, R.A.: Extremal properties of polynomial threshold functions. In: IEEE Conference on Computational Complexity, pp. 3-12 (2003)
29. Paturi, R.: On the degree of polynomials that approximate symmetric Boolean functions. In: STOC: ACM Symposium on Theory of Computing (STOC) (1992)
30. Razborov, A.A.: Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Science, Mathematics 67, 145-159 (2002)
31. Rudin, W.: Principles of Mathematical Analysis, 3rd edn. McGraw-Hill, New York (1976)
32. Sherstov, A.A.: Halfspace matrices. In: Proc. of the 22nd Conference on Computational Complexity (CCC) (2007)
33. 0 from depth-2 majority circuits. In: Proc. of the 39th Symposium on Theory of Computing (STOC) (2007)
34. Valiant, L.G.: Learning disjunctions of conjunctions. California 1, 560-566 (1985)