Tracking the best hyperplane with a simple budget perception

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

Volumn 4005 LNAI, Issue , 2006, Pages 483-498

  Cesa Bianchi, Nicolò ^a   Gentile, Claudio ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUDGET CONTROL; COMPUTATIONAL COMPLEXITY; PUBLIC POLICY; SENSORY PERCEPTION;

BUDGET PERCEPTION; ON-LINE CLASSIFICATION ALGORITHMS; RANDOMIZED ALGORITHMS;

PROBLEM SOLVING;

EID: 33746104458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_36     Document Type: Conference Paper

References (23)

1. D. ANGLUIN. Queries and concept learning. Machine Learning, 2(4):319-342, 1988.
2. P. AUER AND M. WARMUTH. Tracking the best disjunction. Machine Learning, 3:127-150, 1998.
3. H.D. BLOCK. The Perceptron: A model for brain functioning. Reviews of Modern Physics, 34:123-135, 1962.
4. A. BORDES, S. ERTEKIN, J. WESTON, AND L. BOTTOU. Fast kernel classifiers with online and active learning. JMLR, 6:1579-1619, 2005.
5. N. CESA-BIANCHI, A. CONCONI, AND C. GENTILE. A second-order Perceptron algorithm. SI AM Journal of Computing, 34(3):640-668, 2005.
6. K. CRAMMER, J. KANDOLA, AND Y. SINGER. Online classification on a budget. In Proc. 16th NIPS, 2003.
7. O. DEKEL, S. SHALEV-SHWARTZ, Y. SINGER, The Forgetron: a kernel-based Perceptron on a fixed budget. In Proc. 19th NIPS, 2005.
8. Y. FREUND, AND R. SCHAPIRE. Large margin classification using the Perceptron algorithm. Journal of Machine Learning, 37(3)277-296, 1999.
9. C. GENTILE. A new approximate maximal margin classification algorithm. Journal of Machine Learning Research, 2:213-242, 2001.
10. C. GENTILE. The robustness of the p-norm algorithms. Machine Learning, 53:265299, 2003.
11. C. GENTILE AND M. WARMUTH, Linear hinge loss and average margin. In Advances in Neural Information Processing Systems 10, MIT Press, pp. 225-231, 1999.
12. A. J. GROVE, N. LITTLESTONE AND D. SCHUURMANS. General convergence results for linear discriminant updates. Journal of Machine Learning, 43(3):173-210.
13. M. HERBSTER AND M. WARMUTH. Tracking the best expert. Machine Learning, 32:151-178, 1998.
14. M. HERBSTER AND M. WARMUTH. Tracking the best linear predictor. Journal of Machine Learning Research, 1:281-309, 2001.
15. J. KIVINEN, A.J. SMOLA, AND R.C. WILLIAMSON. Online learning with kernels. IEEE Transactions on Signal Processing, 52(8):2165-2176, 2004.
16. Y. Li, AND P. LONG. The relaxed online maximum margin, algorithm. Journal of Machine Learning, 46(l):361-387, 2002.
17. N. LITTLESTONE. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
18. N. LITTLESTONE. Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms. PhD thesis, University of California Santa Cruz, 1989.
19. N. LITTLESTONE AND M. K. WARMUTH. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994.
20. A.B.J. NOVIKOV. On convergence proofs on Perceptrons. In Proc. of the Symposium on the Mathematical Theory of Automata, vol. XII, pages 615-622, 1962.
21. B. SCHÖLKOPF AND A. SMOLA, Learning with kernels, MIT Press, 2002.
22. V. VAPNIK. Statistical learning theory. J. Wiley & Sons, Now York, 1998.
23. J. WESTON, A. BORDES, AND L. BOTTOU. Online (and offline) on an even tighter budget. In Proc. 10th AIStat, pp. 413-420, 2005.