Leaving the Span

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3559 LNAI, Issue , 2005, Pages 366-381

  Warmuth, Manfred K ^a   Vishwanathan, S V N ^b  

^a University of California Santa Cruz   (United States)

^b National IGT Australia   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; EMBEDDED SYSTEMS; LEARNING ALGORITHMS; PROBLEM SOLVING;

COMPONENT-WISE LOGARITHMS; EXPONENTIATED GRADIENT (EG) ALGORITHM; KERNEL FUNCTIONS; SPARSE LINEAR PROBLEMS;

LEARNING SYSTEMS;

EID: 24944493450     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11503415_25     Document Type: Conference Paper

References (22)

1. K. Azoury and M. K. Warmuth. Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning, 43(3):211 - 246, 2001. Special issue on Theoretical Advances in On-line Learning, Game Theory and Boosting.
2. S. Ben-David, N. Eiron, and H. U. Simon. Limitations of learning via embeddings in Euclidean half-spaces. Journal of Machine Learning Research, 3:441 - 461, Nov. 2002.
3. Nello Cristianini, Colin Campbell, and John Shawe-Taylor. Multiplicative updatings for support vector learning. In Proc. of European Symposium on Artificial Neural Networks, pages 189 - 194, 1999.
4. K. R. Davidson and S. J. Szarek. Banach space theory and local operator theory. In J. Lindenstrauss and W. Johnson, editors, Handbook of the Geometry of Banach Spaces. North-Holland, 2003.
5. J. Forster, N. Schmitt, and H. U. Simon. Estimating the optimal margins of embeddings in Euclidean half spaces. In Proc. of the 14th Annual Conference on Computational Learning Theory, pages 402 - 415. Springer, 2001.
6. C. Gentile and N. Littlestone. The robustness of the p-norm algorithms. In Proc. 12th Annu. Conf. on Comput. Learning Theory, pages 1-11. ACM Press, New York, 1999.
7. Claudio Gentile and M. K. Warmuth. Linear hinge loss and average margin. In M. S. Kearns, S. A. Solla, and D. A. Cohn, editors, Advances in Neural Information Processing Systems 11, pages 225 - 231, Cambridge, MA, 1999. MIT Press.
8. D. P. Helmbold, J. Kivinen, and M. K. Warmuth. Relative loss bounds for single neurons. IEEE Transactions on Neural Networks, 10(6): 1291 - 1304, Nov. 1999.
9. R. Herbrich, T. Graepel, and R. C. Williamson. Innovations in Machine Learning, chapter The Structure of Version Space. Springer, January 2005. D. Holmes and L. C. Jain Editors.
10. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985.
11. R. Khardon, D. Roth, and R. Servedio. Efficiency versus convergence of Boolean kernels for on-line learning algorithms. In Advances in Neural Information Processing Systems 14, pages 423-430, 2001.
12. G. S. Kimeldorf and G. Wahba. Some results on Tchebycheffian spline functions. J. Math. Anal. Applic., 33:82 - 95, 1971.
13. J. Kivinen and M. K. Warmuth. Relative loss bounds for multidimensional regression problems. Machine Learning, 45(3):301 - 329, 2001.
14. J. Kivinen and M. K. Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132(1):1 - 64, January 1997.
15. J. Kivinen, M. K. Warmuth, and P. Auer. The perceptron learning algorithm vs. Winnow: Linear vs. logarithmic mistake bounds when few input variables are relevant. Artificial Intelligence, 97(1 - 2):325 - 343, 1997.
16. Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285 - 318, 1988.
17. M. W. Meckes. Concentration of norms and eigenvalues of random matrices. Journal of Functional Analysis, 211(2):508-524, June 2004.
18. L. Pitt and M. K. Warmuth. The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the ACM, 40(1):95 - 142, 1993.
19. R. Schapire, Y. Freund, P. L. Bartlett, and W. S. Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. Annals of Statistics, 26:1651 -1686, 1998.
20. B. Schölkopf, R. Herbrich, and A. J. Smola. A generalized representer theorem. In Proc. of the Annual Conference on Computational Learning Theory, pages 416 - 426, 2001.
21. E. Takimoto and M. K. Warmuth. Path kernels and multiplicative updates. Journal of Machine Learning Research, 4:773 - 818, October 2003.
22. M. K. Warmuth. Towards representation independence in PAC-learning. In J. P. Jantke, editor, Proc. of AII-89 Workshop on Analogical and Inductive Inference, volume 397 of Lecture Notes in Artificial Intelligence 397, pages 78 - 103. Springer-Verlag, October 1989.