Improved guarantees for learning via similarity functions

21st Annual Conference on Learning Theory, COLT 2008

Volumn , Issue , 2008, Pages 287-298

  Balcan, Maria Florina ^a   Blum, Avrim ^a   Srebro, Nathan ^b  

^a Carnegie Mellon University   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS RESULT; HIGH DIMENSIONAL SPACES; LOWER BOUNDS; MARGIN BOUNDS; NATURAL CONDITIONS; PAC LEARNING; SAMPLE COMPLEXITY; SIMILARITY FUNCTIONS;

EID: 84867127919     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. Arora, S., Babai, L., Stern, J., & Sweedyk, Z. (1997). The hardness of approximate optima in lattices, codes, and systems of linear equations. Journal of Computer and System Sciences, 54, 317-331.
2. Balcan, M.-F., & Blum, A. (2006). On a theory of learning with similarity functions. Proceedings of the 23rd International Conference on Machine Learning.
3. Bartlett, P. L., & Mendelson, S. (2003). Rademacher and gaussian complexities: risk bounds and structural results. J. Mach. Learn. Res., 3, 463-482.
4. Ben-David, S., Eiron, N., & Simon, H.-U. (2003). Limitations of learning via embeddings in euclidean half-spaces. The Journal of Machine Learning Research, 3, 441-461.
5. Benedek, G., & Itai, A. (1988). Learnability by fixed distributions. Proc. 1st Workshop Computat. Learning Theory (pp. 80-90).
6. Bennett, K. P., & Campbell, C. (2000). Support vector machines: hype or hallelujah? SIGKDD Explor. Newsl., 2, 1-13.
7. Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., & Rudich, S. (1994). Weakly learning DNF and characterizing statistical query learning using fourier analysis. Proceedings of the 26th Annual ACM Symposium on Theory of Computing (pp. 253-262).
8. Chapelle, O., Schlkopf, B., & Zien, A. (2006). Semi-supervised learning. MIT Press.
9. Feldman, V., Gopalan, P., Khot, S., & Ponnuswami, A. (2006). New results for learning noisy parities and halfspaces. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (pp. 563-574).
10. Forster, J., & Simon, H.-U. (2006). On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. Theoretical Computer Science, 350, 40-48.
11. Girosi, F. (1998). An equivalence between sparse approximation and support vector machines. Neural Comput., 10, 1455-1480.
12. Guigue, V., Rakotomamonjy, A., & Canu, S. (2005). Kernel basis pursuit. Proceedings of the 16th European Conference on Machine Learning (ECML'05). Springer.
13. Gunn, S. R., & Kandola, J. S. (2002). Structural modelling with sparse kernels. Mach. Learn., 48, 137-163.
14. Guruswami, V., & Raghavendra, P. (2006). Hardness of learning halfspaces with noise. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (pp. 543-552).
15. Herbrich, R. (2002). Learning kernel classifiers. MIT Press, Cambridge.
16. Linial, N., Mansour, Y., & Nisan, N. (1989). Constant depth circuits, fourier transform, and learnability. Proceedings of the Thirtieth Annual Symposium on Foundations of Computer Science (pp. 574-579). Research Triangle Park, North Carolina.
17. Littlestone, N. (1989). From online to batch learning. Proc. 2nd Annual ACM Conference on Computational Learning Theory (pp. 269-284).
18. Mansour, Y. (1994). Learning boolean functions via the fourier transform. In Theoretical advances in neural computation and learning, 391-424.
19. McAllester, D. (2003). Simplified pac-bayesian margin bounds. Proceedings of the 16th Conference on Computational Learning Theory.
20. Mitchell, T. (2006). The discipline of machine learning. CMU-ML-06 108.
21. Osuna, E. E., & Girosi, F. (1999). Reducing the run-time complexity in support vector machines. In Advances in kernel methods: support vector learning, 271-283. Cambridge, MA, USA: MIT Press.
22. Roth, V. (2001). Sparse kernel regressors. ICANN '01: Proceedings of the International Conference on Artificial Neural Networks (pp. 339-346). London, UK: SpringerVerlag.
23. Scholkopf, B., & Smola, A. J. (2002). Learning with kernels. support vector machines, regularization, optimization, and beyond. MIT University Press, Cambridge.
24. Scholkopf, B., Tsuda, K., & Vert, J.-P. (2004). Kernel methods in computational biology. MIT Press.
25. Shawe-Taylor, J., & Cristianini, N. (2004). Kernel methods for pattern analysis. Cambridge University Press.
26. Singer, Y. (2000). Leveraged vector machines. Advances in Neural International Proceedings System 12.
27. Smola, A. J., & Schölkopf, B. (2002). Learning with kernels. MIT Press.
28. Srebro, N. (2007). How Good is a Kernel as a Similarity Function. COLT.
29. Tipping, M. E. (2001). Sparse bayesian learning and the relevance vector machine. J. Mach. Learn. Res., 1, 211-244.
30. Vincent, P., & Bengio, Y. (2002). Kernel matching pursuit. Mach. Learn., 48, 165-187.
31. Warmuth, M. K., & Vishwanathan, S. V. N. (2005). Leaving the span. Proceedings of the Annual Conference on Learning Theory.
32. Zhang, T. (2002). Covering number bounds of certain regularized linear function classes. J. Mach. Learn. Res., 2, 527-550.