Oracles and queries that are sufficient for exact learning

Journal of Computer and System Sciences

Volumn 52, Issue 3, 1996, Pages 421-433

  Bshouty, Nader H ^a   Cleve, Richard ^a   Gavaldà, Ricard ^b   Kannan, Sampath ^c   Tamon, Christino ^a  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c UNIVERSITY OF ARIZONA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CIRCUIT THEORY; COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; INFORMATION THEORY; LEARNING ALGORITHMS; MEMBERSHIP FUNCTIONS; OPTIMIZATION; POLYNOMIALS; QUERY LANGUAGES; RANDOM PROCESSES; SET THEORY;

DNF FORMULAS; LEARNABILITY; MEMBERSHIP QUERIES; ORACLES; POLYNOMIAL TIME;

LEARNING SYSTEMS;

EID: 0030165961     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0032     Document Type: Article

References (22)

1. D. Angluin, Queries and concept learning, Much. Learning 2 (1988), 319-342.
2. D. Angluin, Negative results for equivalence queries, Mach. Learning 5 (1990), 121-150.
3. D. Angluin, L. Hellerstein, and M. Karpinski, Learning read-once formulas with queries, J. Assoc. Comput. Mach. 40, No. 1 (1993), 185-210.
4. R. Boppana, Amplification of probabilistic boolean formulas, Adv. in Comput. Res. 5, No. 4 (1989), 27-45.
5. N. Bshouty, Exact learning via the monotone theory, in "Proceedings, 34th Symposium on Foundations of Computer Science, 1993," pp. 302-311.
6. N. Bshouty and R. Cleve, On the exact learning of formulas in parallel, in "Proceedings, 33rd Symposium on Foundations of Computer Science, 1992," pp. 513-522.
7. R. Gavaldà, On the power of equivalence queries, in "Proceedings, EUROCOLT '93," pp. 193-203, Oxford Univ. Press, Oxford, 1994.
8. S. Goldman, M. Kearns, and R. Schapire, Exact identification of read-once formulas using fixed points of amplification functions, SIAM J. Comput. 22 (1993).
9. S. Goldman, R. Rivest, and R. Schapire, Learning binary relations and total orders, SIAM J. Comput. 22, No. 5 (1993), 1006-1034.
10. M. Jerrum, L. Valiant, and V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci. 43 (1986), 169-188.
11. S. Kannan, On the query complexity of learning, in "Proceedings, Sixth Annual Workshop on Computational Learning Theory, 1993," pp. 58-66.
12. R. M. Karp and R. J. Lipton, Some connections between non-uniform and uniform complexity classes, in "Proceedings, 12th Annual ACM Symposium on Theory of Computing, 1980," pp. 302-309.
13. E. Kushilevitz and Y. Mansour, Learning decision trees using the Fourier spectrum, in "Proceedings, 23rd Annual ACM Symposium on Theory of Computing, 1991," pp. 455-464.
14. N. Littlestone, Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm, Mach. Learning 2 (1988), 285-318.
15. E. F. Moore and C. Shannon, Reliable circuits using less reliable relays, J. Franklin Inst. 262 (1956), 191-208, 281-297.
16. L. Pitt and L. Valiant, Computational limitations on learning from examples, J. Assoc. Comput. Mach. 35, No. 4 (1988), 965-984.
17. P. Raghavan, Lecture Notes on Randomized Algorithms, Research Report RC15340 (#68237), IBM Research Division, 1990.
18. M Sipser, A complexity theoretic approach to randomness, in "Proceedings, 15th Annual ACM Symposium on Theory of Computing, 1983," pp. 330-334.
19. L. Stockmeyer, On approximation algorithms for # P, SIAM J. Comput. 14, No. 4 (1985), 849-861.
20. L. Valiant, Short monotone formulae for the majority function, J. Algorithms 5 (1984), 363-366.
21. L. Valiant, A theory of the learnable, Comm. ACM 27, No. 11 (1984), 1134-1142.
22. O. Watanabe, personal communication, 1994.