Algorithmic luckiness

Journal of Machine Learning Research

Volumn 3, Issue 2, 2003, Pages 175-212

  Herbrich, Ralf ^a   Williamson, Robert C ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE; LEARNING ALGORITHMS; STATISTICAL METHODS; VECTORS;

LEARNING THEORY;

LEARNING SYSTEMS;

EID: 0041965981     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244303765208368     Document Type: Article

References (37)

1. N. Alon, J. H. Spencer, and P. Erdös. The Probabilistic Method. John Wiley and Sons, 1991.
2. M. Anthony and P. Bartlett. A Theory of Learning in Artificial Neural Networks. Cambridge University Press, 1999.
3. M. Anthony and J. Shawe-Taylor. A result of Vapnik with applications. Discrete Applied Mathematics, 47:207-217, 1993.
4. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Learnability and the Vapnik-Chervonenkis Dimension. Journal of the ACM, 36(4):929-965, 1989.
5. B. E. Boser, I. M. Guyon, and V. N. Vapnik. A training algorithm for optimal margin classifiers. In D. Haussler, editor, Proceedings of the Annual Conference on Computational Learning Theory, pages 144-152, Pittsburgh, PA, July 1992. ACM Press.
6. S. Boucheron, G. Lugosi, and P. Massart. A sharp concentration inequality with applications. Random Structures and Algorithms, 16(3):277-292, 2000.
7. O. Bousquet and A. Elisseeff. Algorithmic stability and generalization performance. In T. K. Leen, T. G. Dietterich, and V. Tresp, editors, Advances in Neural Information Processing Systems 13, pages 196-202. MIT Press, 2001.
8. C. Cortes and V. Vapnik. Support vector networks. Machine Learning, 20:273-297, 1995.
9. N. Cristianini, J. Shawe-Taylor, A. Elisseeff, and J. Kandola. On kernel-target alignment. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, pages 367-373, Cambridge, MA, 2002. MIT Press.
10. L. Devroye and G. Lugosi. Combinatorial Methods in Density Estimation. Springer, 2001.
11. T. Feder and D. H. Greene. Optimal algorithms for approximate clustering. In Proceedings of the 20th Symposium on the Theory of Computing, pages 434-444, 1988.
12. W. Feller. An Introduction To Probability Theory and Its Application, volume 2. John Wiley and Sons, New York, 1966.
13. S. Floyd and M. Warmuth. Sample compression, learnability, and the Vapnik Chervonenkis dimension. Machine Learning, 27:1-36, 1995.
14. T. Graepel, R. Herbrich, and J. Shawe-Taylor. Generalisation error bounds for sparse linear classifiers. In Proceedings of the Annual Conference on Computational Learning Theory, pages 298-303, 2000.
15. S. Har-Peled. Clustering motion. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 84-93, 2001.
16. R. Herbrich. Learning Kernel Classifiers: Theory and Algorithms. MIT Press, 2002.
17. R. Herbrich and T. Graepel. A PAC-Bayesian margin bound for linear classifiers: Why SVMs work. In T. K. Leen, T. G. Dietterich, and V. Tresp, editors, Advances in Neural Information Processing Systems 13, pages 224-230, Cambridge, MA, 2001. MIT Press.
18. R. Herbrich, T. Graepel, and C. Campbell. Bayes point machines. Journal of Machine Learning Research, 1:245-279, 2001.
19. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.
20. J. P. Kahane. Some Random Series of Functions. Cambridge University Press, 1968.
21. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, Cambridge, Massachusetts, 1994.
22. N. Littlestone and M. Warmuth. Relating data compression and learnability. Technical report, University of California Santa Cruz, 1986.
23. Y. Makovoz. Random approximants and neural networks. Journal of Approximation Theory, 85:98-109, 1996.
24. R. J. McEliece, E. R. Rodemich, H. Rumsey, and L. R. Welch. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Transactions on Information Theory, 23(2):157-166, 1977.
25. S. Mika, G. Rätsch, J. Weston, B. Schölkopf, and K.-R. Müller. Fisher discriminant analysis with kernels. In Y.-H. Hu, J. Larsen, E. Wilson, and S. Douglas, editors, Neural Networks for Signal Processing IX, pages 41-48. IEEE, 1999.
26. F. Rosenblatt. The perception: A probabilistic model for information storage and organization in the brain. Psychological Review, 65(6):386-408, 1958.
27. P. Ruján and M. Marchand. Computing the Bayes kernel classifier. In A. J. Smola, P. L. Bartlett, B. Schölkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 329-347, Cambridge, MA, 2000. MIT Press.
28. N. Sauer. On the density of families of sets. Journal of Combinatorial Theory, 13:145-147, 1972.
29. B. Schölkopf, R. Herbrich, and A. Smola. A generalized representer theorem. In Proceedings of the Annual Conference on Computational Learning Theory, pages 416-426, 2001.
30. J. Shawe-Taylor, P. L. Bartlett, R. C. Williamson, and M. Anthony. Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5):1926-1940, 1998.
31. M. Tipping. Sparse Bayesian learning and the relevance vector machine. Journal of Machine Learning Research, 1:211-244, 2001.
32. V. Vapnik. The Nature of Statistical Learning Theory. Springer, New York, 1995. ISBN 0-387-94559-8.
33. V. Vapnik. Statistical Learning Theory. John Wiley and Sons, New York, 1998.
34. V. N. Vapnik. Estimation of Dependences Based on Empirical Data. Springer, Berlin, 1982.
35. V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264-281, 1971.
36. V. N. Vapnik and A. Y. Chervonenkis. The necessary and sufficient conditions for consistency in the empirical risk minimization method. Pattern Recognition and Image Analysis, 1(3):283-305, 1991.
37. J. Weston and C. Watkins. Multi-class support vector machines. In M. Verleysen, editor, Proceedings ESANN, Brussels, 1999. D Facto.