Malicious Omissions and Errors in Answers to Membership Queries

Machine Learning

Volumn 28, Issue 2-3, 1997, Pages 211-255

  Angluin, Dana ^a   Kriķis, Martiņš ^a   Sloan, Robert H ^b   Turán, György ^c,d  

^a Yale University   (United States)

^b 1120 Science and Engineering Offices   (United States)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^d Automata Theor Res Grp Hung A   (Hungary)

Author keywords

Concept learning; Errors; Queries

Indexed keywords

BOOLEAN FUNCTIONS; ENCODING (SYMBOLS); EQUIVALENCE CLASSES; ERRORS; LEARNING ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; MEMBERSHIP FUNCTIONS; POLYNOMIALS;

DECISION TREES; EQUIVALENCE QUERIES; MEMBERSHIP QUERIES;

LEARNING SYSTEMS;

EID: 0031209746     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1007311411259     Document Type: Article

References (25)

1. Anderson, J. R. (1980). Cognitive Psychology and Its Implications. W. H. Freeman and Company.
2. Angluin, D. (1987). Learning regular sets from queries and counterexamples. Inform. Comput., 75(2):87-106.
3. Angluin, D. (1988). Queries and concept learning. Machine Learning, 2(4):319-342.
4. Angluin, D. (1994). Exact learning of μ-DNF formulas with malicious membership queries. Technical Report YALEU/DCS/TR-1020, Yale University Department of Computer Science.
5. Angluin, D., & Kriķis, M. (1994a). Malicious membership queries and exceptions. Technical Report YALEU/-DCS/TR-1019, Yale University Department of Computer Science.
6. Angluin, D., & Kriķis, M. (1994b). Learning with malicious membership queries and exceptions. In Proc. 7th Annu. ACM Workshop on Comput. Learning Theory, pages 57-66. ACM Press, New York, NY.
7. Angluin, D., & Slonim, D. K. (1994). Randomly fallible teachers: learning monotone DNF with an incomplete membership oracle. Machine Learning, 14(1):7-26.
8. Auer, P., & Long, P. M. (1994). Simulating access to hidden information while learning. In Proc. of the 26th Annual ACM Symposium on Theory of Computing, pages 263-272. ACM Press, New York, NY.
9. Baum, E. (1991). Neural net algorithms that learn in polynomial time from examples and queries. IEEE Transactions on Neural Networks, 2:5-19.
10. Board, R., & Pitt, L. (1992). On the necessity of Occam algorithms. Theoret. Comput. Sci., 100:157-184.
11. Bshouty, N. H., (1993). Exact learning via the monotone theory. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pages 302-311. IEEE Computer Society Press, Los Alamitos, CA.
12. Bultman, W. J. (1991). Topics in the Theory of Machine Learning and Neural Computing. PhD thesis, University of Illinois at Chicago Mathematics Department.
13. Dean, T., Angluin, D., Basye, K., Engelson, S., Kaelbling, L., Kokkevis, E., & Maron, O. (1995). Learning finite automata with stochastic output functions and an application to map learning. Machine Learning, 18(1):81-108.
14. Frazier, M., Goldman, S., Mishra, N., & Pitt, L. (1994). Learning from a consistently ignorant teacher. In Proc. 7th Annu. ACM Workshop on Comput. Learning Theory, pages 328-339. ACM Press, New York, NY.
15. Goldman, S. A., Kearns, M. J., & Schapire, R. E. (1993). Exact identification of read-once formulas using fixed points of amplification functions. SIAM J. Comput., 22(4):705-726.
16. Goldman, S. A., & Mathias, H. D. (1992). Learning k-term DNF formulas with an incomplete membership oracle. In Proc. 5th Annu. Workshop on Comput. Learning Theory, pages 77-84. ACM Press, New York, NY.
17. Kearns, M. (1993). Efficient noise-tolerant learning from statistical queries. In Proc. 25th Annu. ACM Sympos. Theory Comput., pages 392-401. ACM Press, New York, NY.
18. Kushilevitz, E., & Mansour, Y. (1993). Learning decision trees using the Fourier spectrum. SIAM J. Comput., 22(6):1331-1348. Earlier version appeared in STOC 1991.
19. Lang, K.J., & Baum, E. B. (1992). Query learning can work poorly when a human oracle is used. In International Joint Conference on Neural Networks, Beijing.
20. Maass, W., & Turán, G. (1992). Lower bound methods and separation results for on-line learning models. Machine Learning, 9:107-145.
21. Ron, D., & Rubinfeld, R. (1995). Learning fallible deterministic finite automata. Machine Learning, 18(2/3):149-185.
22. Sakakibara, K. (1991). On learning from queries and counterexamples in the presence of noise. Inform. Proc. Lett., 37(5):279-284.
23. Sloan, R. H., & Turán G. (1994). Learning with queries but incomplete information. In Proc. 7th Annu. ACM Workshop on Comput. Learning Theory, pages 237-245. ACM Press, New York, NY.
24. Valiant, L. G. (1985). Learning disjunctions of conjunctions. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, vol. 1, pages 560-566, Los Angeles, California. International Joint Committee for Artificial Intelligence.
25. Zhuravlev, Y., & Kogan, Y. (1985). Realization of boolean functions with a small number of zeros by disjunctive normal forms, and related problems. Soviet Math. Doklady, 32:771-775.