How many queries are needed to learn?

Journal of the ACM

Volumn 43, Issue 5, 1996, Pages 840-862

  Hellerstein, Lisa ^a,e   Pillaipakkamnatt, Krishnan ^b   Raghavan, Vijay ^c,f   Wilkins, Dawn ^d  

^a NORTHWESTERN UNIVERSITY   (United States)

^b HOFSTRA UNIVERSITY   (United States)

^c VANDERBILT UNIVERSITY   (United States)

^d UNIVERSITY OF MISSISSIPPI   (United States)

^e Northwestern University   (United States)

^f VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; MATHEMATICAL MODELS; POLYNOMIALS;

EQUIVALENCE QUERY MODEL; EXACT LEARNING; MEMBERSHIP QUERIES; QUERY COMPLEXITY; TIME COMPLEXITY;

QUERY LANGUAGES;

EID: 0030230237     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/234752.234755     Document Type: Article

References (30)

1. AIZENSTEIN, H., HELLERSTEIN, L., AND PITT, L. 1992. Read-thrice DNF is hard to learn with membership and equivalence queries. In Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science. IEEE, New York, pp. 523-532.
2. ANGLUIN, D. 1987. Learning regular sets from queries and counterexamples. Inf. Comput. 75, 87-106.
3. ANGLUIN, D. 1988. Queries and concept learning. Mach. Learn. 2, 319-342.
4. ANGLUIN, D. 1990. Negative results for equivalence queries. Mach. Learn. 5, 121-150.
5. ANGLUIN, D., FRAZIER, M., AND PITT, L. 1992. Learning conjunctions of Horn clauses. Mach. Learn. 9, 147-164.
6. ANGLUIN, D., HELLERSTEIN, L., AND KARPINSKI, M. 1993. Learning read-once formulas with queries. J. ACM 40, 1 (Jan.), 185-210.
7. ANGLUIN, D., AND KHARITONOV, M. 1991. When won't membership queries help? In Proceedings of the 23rd ACM Symposium on Theory of Computing (New Orleans, La., May 6-8). ACM, New York, pp. 444-454.
8. ANTHONY, M., BRIGHTWELL, G., AND SHAWE-TAYLOR, J. 1992. On specifying Boolean functions by labelled examples. Tech. Rep. London School of Economics, London, U.K.
9. BIOCH, J., AND IBARAKI, T. 1993. Complexity of identification and dualization of positive boolean functions. Tech. Rep. RRR 25-93. Rutgers Center for Operations Research, Rutgers, N.J.
10. BLUMER, A., EHRENFEUCHT, A., HAUSSLER, D., AND WARMUTH, M. K. 1989. Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36, 4 (Oct.), 929-965.
11. BREITBART, Y. 1992. Complexity of the calculation of predicates by finite automata. Ph.D. dissertation. Technion, Haifa, Israel.
12. BSHOUTY, N. 1993. Exact learning via the monotone theory. In Proceedings of the 34th Annual IEEE Symposium on the Foundations of Computer Science. IEEE, New York, 302-311.
13. BSHOUTY, N., CLEVE, R., KANNAN, S., AND TAMON, C. 1994. Oracles and queries that are sufficient for exact learning. In Proceedings of the 7th Annual ACM Conference on Computational Learning Theory (New Brunswick, N.J., June 12-15). ACM, New York, pp. 130-136).
14. ERDÖS, P., AND SPENCER, J. 1974. Probabilistic Methods in Combinatorics. Probability and Mathematical Statistics A Series of Monographs and Textbooks. Academic Press, Orlando, Fla.
15. GAVALDÀ, R. 1993. On the Power of Equivalence Queries. In Proceedings of EUROCOLT '93, 193-203.
16. GOLDMAN, S., AND KEARNS, M. 1991. On the complexity of teaching. In Proceedings of the 4th Annual Workshop on Computational Learning Theory. 303-314.
17. HANCOCK, T. 1990. Identifying μ-formula decision trees with queries. In Proceedings of the 3rd Annual Workshop on Computational Learning Theory, pp. 23-37.
18. HEGEDÜS, T. 1995. Generalized teaching dimensions and the query complexity of learning. In Proceedings of the 8th Annual ACM Conference on Computational Learning Theory (Santa Cruz, Calif., July 5-8). ACM, New York, pp. 108-117.
19. HOPCROFT, J., AND ULLMAN, J. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley.
20. KANEPS, T., AND FREIVALDS, R. 1991. Running time to recognize nonregular languages by 2-way probabilistic finite automata. In Lecture Notes in Computer Science, vol. 510. Springer-Verlag, New York, pp. 355-361.
21. KANNAN, S. 1993. On the query complexity of learning. In Proceedings of the 6th Annual ACM Conference on Computational Learning Theory
22. KARP, R. 1967. Some bounds on the storage requirements of sequential machines and Turing machines. J. ACM 14, 3 (July) 478-489.
23. KUSHILEVITZ, E., AND MANSOUR, Y. 1993. Learning decision trees using the Fourier spectrum. SLAM J. Comput. 22, 6, 1331-1348.
24. MOSHKOV, M. 1983. Conditional tests. Prob. Kibern. (in Russian) 40, 131-170.
25. NAOR, J., AND NAOR, M. 1990. Small-bias probability spaces: Efficient constructions and applications. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (Baltimore, Md., May 12-14). ACM, New York, pp. 213-223.
26. PILLAIPAKKAMNATT, K., AND RAGHAVAN, V. 1994. On the limits of proper learnability of subclasses of DNF formulas. In Proceedings of the 7th Annual ACM Conference on Computational Learning Theory (New Brunswick, N.J., June 12-15). ACM, New York, pp. 118-129.
27. RIVEST, R., AND SCHAPIRE, R. 1989. Inference of finite automata using homing sequences. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (Seattle, Wash., May 15-17). ACM, New York, pp. 411-420.
28. SHINOHARA, A., AND MIYANO, S. 1991. Teachability in computational learning. New Gen. Comput. 8, 337-347.
29. STOCKMEYER, L. 1985. On approximation algorithms for #P. SIAM J. Comput. 14, 849-861.
30. VALIANT, L. 1984. A theory of the learnable. Commun. ACM 27, 11 (Nov.), 1134-1142.