New results for learning noisy parities and halfspaces

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 563-572

  Feldman, Vitaly ^a   Gopalan, Parikshit ^b   Khot, Subhash ^b   Ponnuswami, Ashok Kumar ^b  

^a HARVARD UNIVERSITY   (United States)

^b Georgia Tech

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION NOISE; COMPUTATIONAL LEARNING; HALFSPACES; UNIFORM DISTRIBUTION;

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; PROBLEM SOLVING;

LEARNING SYSTEMS;

EID: 34547698378     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.51     Document Type: Conference Paper

References (38)

1. th ACM Symp. on Theory of Computing, pages 284-293, 1997.
2. th IEEE Symp. on Foundations of Computer Science, 2004.
3. S. Arora, L. Babai, J. Stern, and E. Sweedyk. The hardness of approximate optima in lattices, codes and systems of linear equations. Journal of Computer and System Sciences, 54:317-331, 1997.
4. th IEEE Symp. on Foundations of Computer Science, pages 330-338, 1996.
5. A. Blum, A. Kalai, and H. Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. Journal of the ACM, 50(4):506-519, 2003.
6. A. Blum and R. Kannan. Learning an intersection of a constant number of halfspaces over a uniform distribution. Journal of Computer and System Sciences, 54(2):371-380, 1997.
7. A. Blum and P. Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1-2):245-271, 1997.
8. th International Conference on Algorithmic Learning Theory, pages 83-97, 2002.
9. N. Bshouty and V. Feldman. On using extended statistical queries to avoid membership queries. Journal of Machine Learning Research, 2:359-395, 2002.
10. V. Feldman. On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. Electronic Colloquium on Computational Complexity (ECCC), (066), 2006. (preliminary version in COLT '05).
11. V. Feldman, P. Gopalan, S. Khot, and A. K. Ponnuswami. New results for learning noisy parities and halfspaces. Electronic Colloquium on Computational Complexity (ECCC), (59), 2006.
12. rd Annual Workshop on Computational Learning Theory, pages 202-216, 1990.
13. th Annual Workshop on Computational Learning Theory, pages 391-398, 1992.
14. th Annual International Cryptology Conference on Advances in Cryptology, pages 105-111, London, UK, 1997. Springer-Verlag.
15. st ACM Symp. on Theory of Computing, pages 25-32, 1989.
16. th IEEE Symp. on Foundations of Computer Science, 2006.
17. A. Hajnal, W. Maass, P. Pudlak, G. Turan, and M. Szegedy. Threshold circuits of bounded depth. Journal of Computer and System Sciences, Volume 46(2):129 - 154, 1993.
18. th ACM Symp. Theory of Computing, pages 1-10, 1997. El Paso, Texas, 4-6 May 1997.
19. D.Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1):78-150, 1992.
20. J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 55:414-440, 1997.
21. th IEEE Symp. on Foundations of Computer Science, pages 11-20, 2005.
22. M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM Journal on Computing, 22(4):807-837, 1993.
23. M. Kearns, R. Schapire, and L. Sellie. Toward efficient agnostic learning. Machine Learning, 17(2/3): 115-142, 1994.
24. st ACM Symp. on Theory of Computing, pages 433-444, 1989.
25. M. Kearns and U. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
26. M. Kharitonov. Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution. Journal of Computer and System Sciences, 50(3):600-610, 1995.
27. rd International Colloquium on Automata, Languages and Programming, pages 226-237, 2006.
28. rd IEEE Symp. on Foundations of Computer Science, pages 177-186, 2002.
29. rd ACM Symp. on Theory of Computing, pages 258-265, 2001.
30. A. Klivans and R. Servedio. Boosting and hard-core set construction. Machine Learning, 51(3):217-238, 2003.
31. th IEEE Symp. on Foundations of Computer Science, 2006.
32. th Annual Conference on Learning Theory, 2006.
33. rd; ACM Symp. Theory of Computing, pages 455-464, 1991.
34. L. Levin. Randomness and non-determinism. Journal of Symbolic Logic, 58(3):1102-1103, 1993.
35. th ACM Symp. on Theory of Computing, 2003.
36. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
37. th International Joint Conference on Artificial Intelligence, pages 560-566, 1985.
38. S. Vempala. The Random Projection Method. AMS, 2004.