Learning nested differences in the presence of malicious noise

Theoretical Computer Science

Volumn 185, Issue 1, 1997, Pages 159-175

  Auer, Peter ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; FORMAL LOGIC; LEARNING SYSTEMS;

INTERSECTION CLOSED CLASSES; NESTED DIFFERENCES; ONLINE LEARNING ALGORITHM; PRUNING TECHNIQUE;

LEARNING ALGORITHMS;

EID: 0346044653     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00019-4     Document Type: Article

References (18)

1. D. Angluin, Queries and concept learning, Machine Learning 2(4) (1988) 319-342.
2. M. Anthony, J. Shawe-Taylor, A result of Vapnik with applications. Discrete Appl. Math. 47 (1993) 207-217.
3. J.A. Aslam, S.E. Decatur, Specification and simulation of statistical query algorithms for efficiency and noise tolerance, in Proc. 8th Ann. Conf. on Comput. Learning Theory, ACM Press, New York, NY, 1995, pp. 437-446.
4. P. Auer, On-line learning of rectangles in noisy environments, in: Proc. 6th Ann. ACM Conf. on Computational Learning Theory, ACM Press, New York, NY, 1993, pp. 253-261.
5. P. Auer, N. Cesa-Bianchi, On-line learning with malicious noise and the closure algorithm, in: S. Arikawa, K.P. Jantke, (eds.,) Algorithmic Learnung Theory, AII'94, ALT'94, Lecture Notes in Artificial Intelligence, Vol. 872, Springer, Berlin 1994, pp. 229-247. The journal version was accepted for publication in Ann. Math. Artificial Intelligence.
6. P. Auer, N. Cesa-Bianchi, On-line learning with malicious noise and the closure algorithm, in: S. Arikawa, K.P. Jantke, (eds.,) Algorithmic Learnung Theory, AII'94, ALT'94, Lecture Notes in Artificial Intelligence, Vol. 872, Springer, Berlin 1994, pp. 229-247. The journal version was accepted for publication in Ann. Math. Artificial Intelligence.
7. S.E. Decatur, Statistical queries and faulty PAC oracles, in: Proc. 6th Ann. Workshop on Comput. Learning Theory, ACM Press, New York, NY, 1993, pp. 262-268.
8. D. Haussler, N. Littlestone, M.K. Warmuth, Predicting {0,1} functions on randomly drawn points, Inform, and Comput., 115(2): (1994) 284-293. Was in FOCS88, COLT88, and Univ. of California at Santa Cruz TR UCSC-CRL-90-54.
9. D. Helmbold, R. Sloan, M.K. Warmuth, Learning nested differences of intersection closed concept classes, Machine Learning, 5(2) (1990) 165-196. Special Issue on Computational Learning Theory; first appeared in 2nd COLT Conf., 1989.
10. D. Helmbold, R. Sloan, M.K. Warmuth, Learning nested differences of intersection closed concept classes, Machine Learning, 5(2) (1990) 165-196. Special Issue on Computational Learning Theory; first appeared in 2nd COLT Conf., 1989.
11. D. Helmbold, R. Sloan, M.K. Warmuth, Learning integer lattices, SIAM J. Comput. 21(2) (1992) 240-266.
12. M. Kearns, Efficient noise-tolerant learning from statistical queries, in: Proc. 25th Ann. ACM Symp. Theory Comput., ACM Press, New York, NY, 1993, pp. 392-401.
13. M. Kearns, M. Li, Learning in the presence of malicious errors, SIAM J. Comput. 22 (1993) 807-837.
14. R. Lidl, H. Niederreiter, Introduction to Finite Fields and their Applications, Cambridge University Press, Cambridge revised edition, 1994.
15. N. Littlestone, Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning 2 (1988) 285-318.
16. B.K. Natarajan, Machine Learning: A Theoretical Approach, Morgan Kaufmann, San Mateo, CA, 1991.
17. L.G. Valiant, A theory of the learnable, Comm. ACM 27(11) (1984) 1134-1142.
18. V.N. Vapnik, A.Y. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971) 264-280.