Oracles and queries that are sufficient for exact learning

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn Part F129415, Issue , 1994, Pages 130-139

  Bshouty, Nader H ^a   Cleve, Richard ^a   Kannan, Sampath ^b   Tamon, Christino ^a  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF ARIZONA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

COMPUTATIONAL POWER; DETERMINISTIC LEARNING; EQUIVALENCE QUERIES; MEMBERSHIP QUERY; MONOTONE BOOLEAN FUNCTIONS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; TIME POLYNOMIALS;

LEARNING ALGORITHMS;

EID: 0009350553     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/180139.181067     Document Type: Conference Paper

References (17)

1. Dana Angluin. Queries and Concept Learn-ing. Machine Learning, 2:319-342, 1988.
2. Dana Angluin. Negative Results for Equiva-lence Queries Machine Learning, 5:121-150, 1990.
3. Ravi Boppana. Amplification of Probabilis-tic Boolean Formulas. In Advances in Computing Research, 5:4, pages 27-45, 1989.
4. Nader Bshouty. Exact Learning via the Monotone Theory. In IEEE Foundations of Computer Science, pages 302-311, 1993.
5. Nader Bshouty and Richard Cleve. On the Exact Learning of Formulas in Parallel. In Proceedings of the 33rd Symposium on Foundations of Computer Science, pages 513-522, 1992.
6. Ricard Gavalda. On the Power of Equivalence Queries. In Proceedings of EURO-COLT '93, 1993.
7. Sally Goldman, Ronald Rivest and Robert Schapire. Learning Binary Relations and Total Orders. SIAM Journal on Computing, 22:5, pages 1006-1034, 1993.
8. Mark Jerrum, Leslie Valiant, and Vijay Vazirani. Random Generation of Combinatorial Structures from a Uniform Distribution. Theoretical Computer Science, 43, pages 169-188, 1986.
9. Sampath Kannan. On the Query Complexity of Learning. In Proceedings of the Sixth Annual Workshop on Computational Learning Theory, pages 58-66, 1993.
10. Eyal Kushilevitz and Yishay Mansour. Learning Decision Trees using the Fourier Spectrum. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 455-464, 1991.
11. Nick Littlestone. Learning Quickly When Ir-relevant Attributes Abound: A New Linear-Threshold Algorithm. Machine Learning, 2, pages 285-318, 1988.
12. E.F. Moore and C. Shannon. Reliable Circuits Using Less Reliable Relays. J. Franklin Inst, 262, pages 191-208, 281-297, 1956.
13. Leonard Pitt and Leslie Valiant. Computational Limitations on Learning from Examples. Journal of the Association for Computing Machinery, 35:4, pages 965-984, October 1988.
14. Michael Sipser. A Complexity Theoretic Approach to Randomness. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 330-334, 1983.
15. Larry Stockmeyer. On Approximation Al-gorithms for #P. SIAM Journal on Computing, 14:4, pages 849-861, 1985.
16. Leslie Valiant. Short Monotone Formulae for the Majority Function. J. Algorithms, 5, pages 363-366, 1984.
17. Leslie Valiant. A Theory of the Learnable. Communications of the ACM, 27(11):1134-1142, November 1984.