Limitations of learning via embeddings in Euclidean half spaces

Journal of Machine Learning Research

Volumn 3, Issue 3, 2003, Pages 441-461

  Ben David, Shai ^a   Eiron, Nadav ^b   Simon, Hans Ulrich ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Concept Learning; Embeddings in Half Spaces; Large Margin Classification

Indexed keywords

COMPUTATIONAL METHODS; EMBEDDED SYSTEMS; VECTORS;

EUCLIDEAN HALF SPACES;

LEARNING SYSTEMS;

EID: 0042967747     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244303321897681     Document Type: Conference Paper

References (16)

1. N. Alon, P. Frankl, and V. Rödl. Geometrical realization of set systems and probabilistic communication complexity. In Proceedings of the 26th Symposium on Foundations of Computer Science, pages 277-280, 1985.
2. Rosa I. Arriaga and Santosh Vempala. An algorithmic theory of learning: Robust concepts and random projection. In Proceedings of the 40'th Annual Symposium on the Foundations of Computer Science, pages 616-623, 1999.
3. Shai Ben-David. A priori generalization bounds for kernel based learning: Can sparsity save the day? Technical Report, Cornell University, 2001.
4. Béla Bollobás. Extremal Graph Theory. Academic Press, 1978.
5. Jürgen Forster. A linear bound on the unbounded error probabilistic communication complexity. In Proceedings of the 16th Annual Conference on Computational Complexity, pages 100-106, 2001.
6. Jürgen Forster, Niels Schmitt, and Hans Ulrich Simon. Estimating the optimal margins of embeddings in euclidean half spaces. In Proceedings of the 14th Annual Workshop on Computational Learning Theory, pages 402-415. Springer Verlag, 2001.
7. Yoav Freund and Robert Schapire. Large margin classification using the perceptron algorithm. Machine Learning, 37(3):277-296, 1999.
8. Wolfgang Maass and György Turán. Lower bound methods and separation results for on-line learning models. Machine Learning, 9:107-145, 1992.
9. Llew Mason, Peter L. Bartlett, and Jonathan Baxter. Improved generalization through explicit optimization of margins. Machine Learning, 38(3):243-255, 2000.
10. Marvin L. Minsky and Seymour A. Papert. Perceptrons. The MIT Press, Cambrigde MA, third edition, 1988.
11. A. B. J. Novikoff. On convergence proofs for perceptrons. In Proceedings of the Symposium of Mathematical Theory of Automata, pages 615-622, 1962.
12. Ramamohan Paturi and Janos Simon. Probabilistic communication complexity. Journal of Computer and System Sciences, 33(1):106-123, 1986.
13. F. Rosenblatt. The perceptron: A probabilistic model for information storage and organization in the brain. Psych. Rev., 65:386-407, 1958.
14. F. Rosenblatt. Principles and Neurodynamics: Perceptrons and the Theory of Brain Mechanisms. Spartan Books, Washington, D.C., 1962.
15. Vladimir Vapnik. Statistical Learning Theory. Wiley Series on Adaptive and Learning Systems for Signal Processing, Communications, and Control. John Wiley & Sons, 1998.
16. K. Zarankiewicz. Problem P 101. Colloq. Math., 2:301, 1951.