Learning geometric concepts via gaussian surface area

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

Volumn , Issue , 2008, Pages 541-550

  Klivans, Adam R ^a   O'Donnell, Ryan ^b   Servedio, Rocco A ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c Och Spine at New York Presbyterian Hospitals

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY NOISES; COMPLEXITY MEASURES; CONVEX SETS; FREE MODELS; GAUSSIAN SURFACES; GEOMETRIC CONCEPTS; HALF SPACES; LEARNABILITY; LOWER BOUNDS; SUBEXPONENTIAL TIMES; SURFACE AREAS; TIME ALGORITHMS;

CESIUM; COMPUTATIONAL COMPLEXITY; COMPUTERS; CONTROL THEORY; EDUCATION; FIBER OPTIC CHEMICAL SENSORS; GAUSSIAN DISTRIBUTION; LEARNING SYSTEMS; SET THEORY; TRELLIS CODES;

LEARNING ALGORITHMS;

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

References (37)

1. D. Bakry. L'hypercontractivité et son utilisation en théorie des semigroupes, pages 1-114. Springer, 1994.
2. K. Ball. The Reverse Isoperimetric Problem for Gaussian Measure. Discrete and Computational Geometry, 10:411-420, 1993.
3. E. Baum. On learning a union of halfspaces. Journal of Complexity, 6(1):67-101, 1990.
4. E. Baum. The Perception algorithm, is fast for nonmalicious distributions. Neural Computation, 2:248-260, 1990.
5. S. Ben-David, N. Eiron, and P. Long. On the difficulty of approximately maximizing agreements. JCSS: Journal of Computer and System Sciences, 66, 2003.
6. G. Benedek and A. Itai. Learnability by fixed distributions. In First Workshop on Computational Learning Theory, pages 201-210, 1988.
7. V. Bentkus. On the dependence of the Berry-Esseen bound on dimension. Journal of Statistical Planning and Inference, 113:385-402, 2003.
8. C. M. Bishop. Pattern Recognition and Machine Learning. Springer, 2006.
9. A. Blum, and R. Kannan. Learning an intersection of a constant number of halfspaces under a uniform, distribution. Journal of Computer and System Sciences, 54(2):371-380, 1997.
10. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4):929-965, 1989.
11. S. Bobkov. An isoperimetric inequality on the discrete cube and an elementary proof of the isoperimetric inequality in Gauss space. The Annals of Probability, 25(1):206-214, 1997.
12. S. Bobkov and C. Houdre. Some Connections between Isoperimetric and Sobolev-type Inequalities. American Mathematical Society, Providence, 1997.
13. C. Borell. The Brunn-Minkowski inequality in Gauss space. Invent. Math., 30:207-216, 1975.
14. N. H. Bshouty and L. Burroughs. Maximizing agreements with one-sided, error with applications to heuristic learning. Machine Learning, 59(1-2):99-123, 2005.
15. A. Ehrenfeucht, D. Haussier, M. Kearns, and L. Valiant. A general lower bound on the number of examples needed for learning. Information and Computation, 82(3):247-251, 1989.
16. S.Janson. Gaussian Hubert Spaces. Cambridge University Press, Cambridge, UK, 1997.
17. A. Kalai, A. Klivans, Y. Mansour, and R. Servedio. Agnostically learning halfspaces. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), pages 11-20, 2005.
18. M. Kearns and U. Vazirani. An introduction to computational learning theory. MIT Press, Cambridge, MA, 1994.
19. A. Klivans, R. O'Donnell, and R. Servedio. Learning intersections and thresholds of halfspaces. Journal of Computer & System Sciences, 68(4):808-840, 2004. Preliminary version in Proc. of FOCS'02.
20. A. Klivans and R. Servedio. Learning intersections of halfspaces with a margin. In Proceedings of the 17th Annual Conference on Learning Theory, pages 348-362, 2004.
21. A. R. Klivans and A. A. Sherstov. Cryptographic hardness for learning intersections of halfspaces. In FOCS, pages 553-562. IEEE Computer Society, 2006.
22. S. Kwek and L. Pitt. PAC learning intersections of halfs-paces with membership queries. Algorithmica, 22(l/2):53-75, 1998.
23. N. D. Lawrence and M. I. Jordan. Semi-supervised learning via gaussian processes. In NIPS, 2004.
24. M. Ledoux. Semigroup proofs of the isoperimetric inequality in Euclidean and Gauss space. Bull. Sci. Math, 118:485-510, 1994.
25. M. Ledoux. Personal communication, 2006.
26. M. Ledoux and M. Talagrand. Probability in Banach Spaces. Springer, 1991.
27. P. Long. Halfspace learning, linear programming, and non-malicious distributions. Information Processing Letters, 51:245-250, 1994.
28. P. Long. On the sample complexity of PAC learning halfspaces against the uniform distribution. IEEE Transactions on Neural Networks, 6(6): 1556-1559, 1995.
29. F. Nazarov. Personal communication, 2003.
30. n with respect to a Gaussian measure. In Geometric aspects of functional analysis (2001-2002), pages 169-187. Lecture Notes in Math., Vol. 1807, Springer, 2003.
31. G. Pisier. Probabilistic, methods in the geometry of Banach spaces, pages 167-241. Springer, 1986.
32. C. E. Rasmussen and C. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006.
33. V. Sudakov and B. Tsirel'son. Extremal properties of halfspaces for spherically invariant measures. J. Soviet Math., 9:9-18, 1978. Translated from Zap. Nauchn. Sem. Leningrad. Otdel. Math. Inst. Steklova. 41 (1974), 14-21.
34. L. Valiant. A. theory of the learnable. Communications of the ACM, 27(11): 1134-1142, 1984.
35. 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.
36. S. Vempala. The Random Projection Method. American Mathematical Society, DIMACS, 2004.
37. X. Zhu, Z. Ghahramani, and J. D. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML. AAAI Press, 2003.