Learning conjunctions with noise under product distributions

Information Processing Letters

Volumn 68, Issue 4, 1998, Pages 189-196

  Mansour, Yishay ^a   Parnas, Michal ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Computational learning theory; Noise; PAC learning; Product distribution

Indexed keywords

COMPUTATION THEORY; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS;

PROBABLY APPROXIMATELY CORRECT (PAC) LEARNING; PRODUCT DISTRIBUTION;

LEARNING ALGORITHMS;

EID: 0041763189     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00165-3     Document Type: Article

References (9)

1. D. Angluin, P. Laird, Learning from noisy examples, Machine Learning 2 (4) (1988) 343-370.
2. S. Decatur, Statistical queries and faulty PAC oracles, in: Proc. 6th Annual Workshop on Comput. Learning Theory, ACM Press, New York, 1993, pp. 262-268.
3. M. Kearns, Efficient noise tolerant learning from statistical queries, in: Proc. 17th Annual ACM Symposium on Theory of Computing, May 1993.
4. M. Kearns, M. Li, Learning in the presence of malicious errors, in: Proc. Twentieth Annual ACM Symposium on Theory of Computing, Chicago, IL, May 1988.
5. M.J. Kearns, R.E. Schapire, L.M. Sellie, Toward efficient agnostic learning, in: Proc. 5th Annual Workshop on Comput. Learning Theory, ACM Press, New York, 1992, pp. 341-352.
6. N. Littlestone, Learning when irrelevant attributes abound: A new linear-threshold algorithm, Machine Learning 2 (1988) 285-318.
7. R.H. Sloan, Types of noise in data for concept learning, in: D. Haussler, L. Pitt (Eds.), First Workshop on Computational Learning Theory, Morgan Kaufmann, San Mateo, CA, 1988, pp. 91-96.
8. L.G. Valiant, A theory of the learnable, Comm. ACM 27 (11) (1984) 1134-1142.
9. L.G. Valiant, Learning disjunctions of conjunctions, in: Proc. IJCAI-85, Los Angeles, CA, Morgan Kaufmann, San Mateo, CA, 1985, pp. 560-566.