On-line learning with malicious noise and the closure algorithm

Annals of Mathematics and Artificial Intelligence

Volumn 23, Issue 1-2, 1998, Pages 83-99

  Auer, Peter ^a   Cesa Bianchi, Nicolò ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042376985     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018960107028     Document Type: Article

References (21)

1. D. Angluin, Queries and concept learning, Machine Learning 2(4) (1988) 319-342.
2. M. Anthony and J. Shawe-Taylor, A result of Vapnik with applications, Discrete Applied Mathematics 47 (1994) 207-217.
3. P. Auer, On-line learning of rectangles in noisy environments, in: Proceedings of the 6th Annual ACM Workshop on Computational Learning Theory (ACM Press, 1993) pp. 253-261.
4. P. Auer and P.M Long, Simulating access to hidden information while learning, in: Proceedings of the 26th ACM Symposium on the Theory of Computing (ACM Press, 1994) pp. 263-272.
5. S. Boucheron, Learnability from positive examples in the Valiant framework, Manuscript (1988).
6. N. Cesa-Bianchi, Models of learning with noise, Unpublished manuscript (1994).
7. N. Cesa-Bianchi, Y. Freund, D.P. Helmbold and M.K. Warmuth, On-line prediction and conversion strategies, in: Proceedings of the First Euro-COLT Workshop, The Institute of Mathematics and its Applications Conference Series - New Series Number 53 (Clarendon Press, Oxford, 1994) pp. 205-216.
8. Z. Chen and S. Homer, On learning counting functions with queries, in: Proceedings of the 7th Annual ACM Workshop on Computational Learning Theory (ACM Press, 1994) pp. 218-227.
9. P. Fischer and H.U. Simon, On learning ring-sum-expansions, SIAM Journal on Computing 21 (1992) 181-192.
10. D. Haussler, N. Littlestone and M.K. Warmuth, Predicting {0,1}-functions on randomly drawn points, Information and Computation 115(2) (1994) 248-292.
11. D.P. Helmbold and P.M Long, Tracking drifting concepts by minimizing disagreements, Machine Learning 14(1) (1994) 27-45.
12. D.P. Helmbold, R. Sloan and M.K. Warmuth, Learning nested differences of intersection-closed concept classes, Machine Learning 5(2) (1990) 165-196.
13. D.P. Helmbold, R. Sloan and M.K. Warmuth, Learning integer lattices, SIAM Journal on Computing 21(2) (1992) 240-266.
14. M.J. Kearns and M. Li, Learning in the presence of malicious errors, SIAM Journal on Computing 22(4) (1993) 807-837.
15. N. Littlestone, Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm, Machine Learning 2(4) (1988) 285-318.
16. N. Littlestone, Mistake bounds and logarithmic linear-threshold learning algorithms, Ph.D. thesis, University of California at Santa Cruz (1989).
17. N. Littlestone and M.K. Warmuth, The weighted majority algorithm, Information and Computation 108 (1994) 212-261.
18. B.K. Natarajan, On learning boolean functions, in: Proceedings of the 19th ACM Symposium on the Theory of Computing (ACM Press, 1987) pp. 296-304.
19. B.K. Natarajan, Machine Learning: A Theoretical Approach (Morgan Kaufmann, San Mateo, CA, 1991).
20. A. Schrijver, Theory of Linear and Integer Programming (Wiley, New York, 1986).
21. L. Valiant, A theory of the learnable, Communications of the ACM 27(11) (1984) 1134-1142.