Avrim Blum
- 1.D. Angluin. Exact learning of p-DNF formulas with malicious membership queries. Technical Report YALEU/DCS/TR- 1020, Yale University Department of Computer Science, March 1994.Google Scholar
- 2.D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, April 1988. Google ScholarCross Ref
- 3.D. Angluin and M. Kril~is. 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, 1994. Google ScholarDigital Library
- 4.D. Angluin and D. K. Slonim. Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle. Machine Learning, 14(1):7-26, January 1994. A preliminary version of this paper appeared in COLT '91. Google ScholarDigital Library
- 5.E. Baum. Neural net algorithms that learn in polynomial time from examples and queries. IEEE Transactions on Neural Networks, 2:5-19, 1991.Google ScholarDigital Library
- 6.E. B. Baum. Polynomial time algorithms for learning neural nets. In Proc. 3rd Annu. Workshop on Com. put. Learning Theory, pages 258-272, San Mateo, CA, 1990. Morgan Kaufmann. Google ScholarDigital Library
- 7.A. Blum and R. L. Rivest. Training a 3-node neural net is NP-Complete. In Advances in Neural Information Processing Systems I, pages 494-501. Morgan Kaufmann, 1989. Google ScholarDigital Library
- 8.M. Frazier, S. Goldman, N. Mishra, and L. Pitt. Learning from a consistently ignorant teacher. In Proc. 7th Annu. ACM Workshop on Comput. Learning Theory, pages 328-339. ACM Press, New York, NY, 1994. To appear, J. of Comput. Syst. Sci. Google ScholarDigital Library
- 9.M. Frazier and L. Pitt. CLASSIC learning. In Proc. 7th Annu. ACM Workshop on Comput. Learning Theory, pages 23-34. ACM Press, New York, NY, 1994. Google ScholarDigital Library
- 10.S. Goldman and R, Sloan. Can PAC learning algorithms tolerate random noise? Technical Report WUCS-92- 25, Washington University Department of Computer Science, July 1992. To appear, Algorithmica.Google Scholar
- 11.S.A. Goldman, M. J. Kearns, and R. E. Schapire. Exact identification of circuits using fixed points of amplification functions. SIAM J. Comput., 22(4):705-726, August 1993. Google ScholarDigital Library
- 12.S. A. Goldman and H. D. Mathias. 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, 1992. Google ScholarDigital Library
- 13.M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM J. Comput., 22:807-837, 1993. Google ScholarDigital Library
- 14.M. J. Kearns and R. E. Schapire. Efficient distributionfree learning of probabilistic concepts. In Proc. of the 31st Symposium on the Foundations of Comp. Sci., pages 382-391. IEEE Computer Society Press, Los Alamitos, CA, 1990.Google ScholarDigital Library
- 15.Philip D. Laird. Learning from Good and Bad Data. Kluwer international series in engineering and computer science. Kluwer Academic Publishers, Boston, 1988. Google ScholarDigital Library
- 16.K.J. Lang and E.B. Baum. Query learning can work poorly when a human oracle is used. In Proceedings of International Joint Conference on Neural Networks, IEEE, 1992.Google Scholar
- 17.N. Littlestone. Redundant noisy attributes, attributeerrors, and linear threshold learning using Winnow. In Proc. 4th Annu. Workshop on Comput. Learning Theory, pages 147-156, San Mateo, CA, 1991. Morgan Kaufmann. Google ScholarDigital Library
- 18.Y. Sakakibara. On learning from queries and counterexamples in the presence of noise. Inform. Proc. Lett., 37(5):279-284, March 1991. Google ScholarDigital Library
- 19.G. Shackelford and D. Volper. Learning k-DNF with noise in the attributes. In Proc. 1st Annu. Workshop on Comput. Learning Theory, pages 97-103, San Mateo, CA, 1988. Morgan Kaufmann. Google ScholarDigital Library
- 20.R. Sloan. Types of noise in data for concept learning. In Proc. lst Annu. Workshop on Comput. Learning Theory, pages 91-96, San Mateo, CA, 1988. Morgan Kaufmann. Google ScholarDigital Library
- 21.R. H. Sloan and G. Turtin. Learning with queries but incomplete information. In Proc. 7th Annu. A CM Workshop on Comput. Learning Theory, pages 237-245. ACM Press, New York, NY, 1994. Google ScholarDigital Library
- 22.L. G. Valiant. A theory of the learnable. Commun. A CM, 27(11): 1134-1142, November 1984. Google ScholarDigital Library
Index Terms
- Learning with unreliable boundary queries
Recommendations
Learning with Unreliable Boundary Queries
Special issue on the eighth annual workshop on computational learning theory, July 5–8, 1995We introduce a model for learning from examples and membership queries in situations where the boundary between positive and negative examples is somewhat ill-defined. In our model, queries near the boundary of a target concept may receive incorrect or “...
Learning twig and path queries
ICDT '12: Proceedings of the 15th International Conference on Database TheoryWe investigate the problem of learning XML queries, path queries and twig queries, from examples given by the user. A learning algorithm takes on the input a set of XML documents with nodes annotated by the user and returns a query that selects the ...
Learning with errors in answers to membership queries
We study the learning models defined in [D. Angluin, M. Krikis, R.H. Sloan, G. Turan, Malicious omissions and errors in answering to membership queries, Machine Learning 28 (2-3) (1997) 211-255]: Learning with equivalence and limited membership queries ...
Comments