Learning from a consistently ignorant teacher

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn Part F129415, Issue , 1994, Pages 328-339

  Frazier, Michael ^a   Goldman, Sally ^b   Mishra, Nina ^a   Pitt, Leonard ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; LEARNING ALGORITHMS; LOGIC PROGRAMMING; TEACHING;

COMPUTATIONAL LEARNING THEORY; FORMAL MODEL; HORN CLAUSE; KNOWLEDGE GAPS;

EDUCATION;

EID: 84872739732     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/180139.181170     Document Type: Conference Paper

References (41)

1. Howard Aizenstein, Lisa Hellerstein, and Leonard Pitt. Read-thrice DNF is hard to learn with membership and equivalence queries. In SSnd Annual Symposium on Foundations of Computer Science, pages 523-532, October 1992.
2. Howard Aizenstein and Leonard Pitt. Exact learning of read-twice DNF formulas. In 32nd Annual Symposium on Foundations of Computer Science, pages 170-179, October 1991.
3. Dana Angluin. Learning fc-term DNF formulas using queries and counterexamples. Technical Report YALEU/DCS/RR-559, Yale University, August 1987.
4. Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, November 1987.
5. Dana Angluin. Negative results for equivalence queries. Machine Learning, 5:121-150, 1990.
6. Dana Angluin. Exact learning of μ-DNF formulas with malicious membership queries. Technical Report YALEU/DCS/TR-1020, Yale University, March 1994.
7. Dana Angluin, Michael Frazier, and Leonard Pitt. Learning conjunctions of Horn clauses. Machine Learning, 9:147-164, 1992.
8. Dana Angluin, Lisa Hellerstein, and Marek Karpinski. Learning read-once formulas with queries. Journal of the Association for Computing Machinery, 40(1):185-210, 1993.
9. Dana Angluin and Michael Kharitonov. When won't membership queries help? In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, pages 444-454, May 1991.
10. Dana Angluin and Martin Krikis. Learning with malicious membership queries and exceptions. In Proceedings of the Seventh Annual Workshop on Computational Learning Theory, July 1994.
11. Dana Angluin and Philip Laird. Learning from noisy examples. Machine Learning, 2(4):343-370, 1988.
12. Dana Angluin and Donna K. Slonim. Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle Machine Learning, 14:7-26, 1994.
13. Dana Angluin and Leslie G. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings. Journal of Computer and System Sciences, 18(2):155-193, April 1979.
14. Avrim Blum and Steven Rudich. Fast learning of ifc-term DNF formulas with queries. In Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, pages 382-389, May 1992.
15. Anselm Blumer, Andrzej Ehrenfeucht, David Haus-sler, and Manfred K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the Association for Computing Machinery, 36(4):929-965, October 1989.
16. Nader H. Bshouty. Exact Learning via the Monotone Theory. In 34th Annual Symposium on Foundations of Computer Science, pages 302-311, November 1993.
17. Nader H. Bshouty, Thomas R. Hancock, and Lisa Hellerstein. Learning arithmetic read-once formulas. In Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, pages 370-381, May 1992.
18. Nader H. Bshouty, Thomas R. Hancock, and Lisa Hellerstein. Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates. In Proceeding's of the Fifth Annual Workshop on Computational Learning Theory, pages 1-15, August 1992.
19. Zhixiang Chen. Learning unions of two rectangles in the plane with equivalence queries. In Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, pages 243-252. ACM Press, July 1993.
20. Zhixiang Chen and Steven Homer. Fast learning unions of rectangles with queries. Unpublished manuscript, July 1993.
21. Zhixiang Chen and Wolfgang Maass. On-line learning of rectangles. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pages 16-27. ACM Press, July 1992.
22. Michael Frazier and Leonard Pitt. Learning from entailments: an application to propositional Horn sentences. In Machine Learning Proceedings of the Tenth International Conference, pages 120-127, June 1993.
23. Michael Frazier and Leonard Pitt. CLASSIC Learning. In Proceedings of the Seventh Annual Workshop on Computational Learning Theory, July 1994.
24. Paul W. Goldberg, Sally A. Goldman, and H. David Mathias. Learning unions of rectangles with membership and equivalence queries. In Proceedings of the Seventh Annual Workshop on Computational Learning Theory, July 1994.
25. Sally A. Goldman, Michael J. Kearns, and Robert E. Schapire. Exact identification of circuits using fixed points of amplification functions. SIAM Journal on Computing, 22(4):705-726, August 1993.
26. Sally A. Goldman and Robert H. Sloan. Can PAC learning algorithms tolerate random attribute noise? Technical Report WUCS-92-25, Washington University, Department of Computer Science, July 1992. To appear in Algorthmica.
27. Thomas R. Hancock. Learning 2μ DNF formulas and kμ decision trees. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 199-209, August 1991.
28. David Haussler. Generalizing the PAC model: sample size bounds from metric dimension-based uniform convergence results. In 30th Annual Symposium on Foundations of Computer Science, pages 40-45, October 1989.
29. David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth. Equivalence of models for polynomial learnability. Information and Computation, 25(2):129-161, December 1991.
30. Michael Kearns and Ming Li. Learning in the presence of malicious errors. SIAM Journal on Computing, 22(4):807-837, August 1993.
31. Michael Kearns and Leslie Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 433444, May 1989. To appear in JACM.
32. Michael J. Kearns and Robert E. Schapire. Efficient distribution-free learning of probabilistic concepts. In 31st Annual Symposium on Foundations of Computer Science, pages 382-391, 1990.
33. Philip D. Laird. Learning from Good and Bad Data. Kluwer international series in engineering and computer science. Kluwer Academic Publishers, Boston, 1988.
34. Nicholas Littlestone. Redundant noisy attributes, attribute errors, and lineary-threshold learning using winnow. In Fourth Workshop on Computational Learning Theory, pages 147-156, 1991.
35. Philip M. Long and Manfred K. Warmuth. Composite geometric concepts and polynmomial predictability. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 273-287. Morgan Kauf-mann, August 1990.
36. Thomas Mitchell. Generalization as Search. Artificial Intelligence, 18:203-226, 1982.
37. Leonard Pitt and Manfred K. Warmuth. Prediction preserving reducibility. Journal of Computer and System Sciences, 41(3):430-467, December 1990.
38. Yasubumi Sakakibara. On learning from queries and counterexamples in the presence of noise. Information Processing Letters. To appear.
39. George Shackelford and Dennis Volper. Learning k-DNF with noise in the attributes. In Proceedings of the 1988 Workshop on Computational Learning Theory, pages 97-103. Morgan Kaufmann, August 1988.
40. Robert H. Sloan. Types of noise in data for concept learning. In Proceedings of the 1988 Workshop on Computational Learning Theory, pages 91-96. Morgan Kaufmann, 1988.
41. Leslie Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, November 1984.