Tracking the best hyperplane with a simple budget Perceptron

Machine Learning

Volumn 69, Issue 2-3, 2007, Pages 143-167

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

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

Budget algorithms; Mistake bounds; Pattern classification; Perceptron algorithm

Indexed keywords

DATABASE SYSTEMS; LEARNING ALGORITHMS; ONLINE SYSTEMS; PATTERN RECOGNITION; PROBLEM SOLVING; SUPPORT VECTOR MACHINES;

BUDGET ALGORITHMS; EVICTION POLICY; MISTAKE BOUNDS; SHIFTING BOUNDS; SHIFTING PERCEPTRON ALGORITHM;

NEURAL NETWORKS;

EID: 35348858944     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-007-5003-0     Document Type: Conference Paper

References (23)

1. Angluin, D. (1988). Queries and concept learning. Machine Learning, 2(4), 319-342.
2. Auer, P., & Warmuth, M. (1998). Tracking the best disjunction. Machine Learning, 32(2), 127-150.
3. Block, H. (1962). The Perceptron: A model for brain functioning. Review of Modern Physics, 34, 123-135.
4. Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2003). Learning probabilistic linear-threshold classifiers via selective sampling. In Proceedings of the 16th Annual Conference on Learning Theory (pp. 373-386).
5. Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2005). A second-order Perceptron algorithm. SIAM Journal on Computing, 43(3), 640-668.
6. Crammer, K., Kandola, J., & Singer, Y. (2004). Online classification on a budget. In Advances in Neural Information Processing Systems 16.
7. Dekel, O., Shalev-Shwartz, S., & Singer, Y. (2006). The Forgetron: A Kernel-based Perceptron on a fixed budget. In Advances in Neural Information Processing Systems, 18 (pp. 259-266).
8. Freund, Y., & Schapire, R. (1999). Large margin classification using the Perceptron algorithm. Machine Learning (pp. 277-296).
9. Gentile, C. (2001). A new approximate maximal margin classification algorithm. Journal of Machine Learning Research, 2, 213-242.
10. Gentile, C. (2003). The robustness of the p-norm algorithms. Machine Learning, 53(3), 265-299.
11. Gentile, C., & Warmuth, M. (1999). Linear hinge loss and average margin. In Advances in Neural Information Processing Systems, 10 (pp. 225-231).
12. Grove, A., Littlestone, N., & Schuurmans, D. (1997). General convergence results for linear discriminant updates. In Proceedings of the 10th Annual Conference on Computational Learning Theory (pp. 171-183).
13. Herbster, M., & Warmuth, M. (1998). Tracking the best expert. Machine Learning, 32(2), 151-178.
14. Herbster, M., & Warmuth, M. (2001). Tracking the best linear predictor. Journal of Machine Learning Research, 1, 281-309.
15. Kivinen, J., Smola, A., & Williamson, R. (2004). Online learning with Kernels. IEEE Transactions on Signal Processing, 52(8), 2165-2176.
16. Li, Y., & Long, P. (2002). The relaxed online maximum margin algorithm. Machine Learning, 46(1/3), 361-387.
17. Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4), 285-318.
18. Littlestone, N., & Warmuth, M. (1994). The weighted majority algorithm. Information and Computation, 108, 212-261.
19. Novikoff, A. (1962). On Convergence proofs of Perceptrons. In Proceedings of the Symposium on the Mathematical Theory of Automata (Vol. XII. pp. 615-622).
20. Reuters (2000). http://about.reuters.com/researchandstandards/corpus/.
21. Schölkopf, B., & Smola, A. (2002). Learning with kernels. MIT Press.
22. Vapnik, V. (1998). Statistical Learning Theory. Wiley.
23. Weston, J., Bordes, A., & Bottou, L. (2005). Online (and offline) on an even tighter budget. In Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics (pp. 413-420).