Exact learning via teaching assistants

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1316, Issue , 1997, Pages 291-306

  Arvind, V ^a   Vinodchandran, N V ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; INFORMATION THEORY;

CONCEPT CLASS; EXACT LEARNING; LEARNABILITY; MACHINE CHARACTERIZATION; PRECISE DEFINITION; TEACHING ASSISTANTS;

TEACHING;

EID: 84958044312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63577-7_50     Document Type: Conference Paper

References (13)

1. D. Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
2. D. Angluin. Negative results for equivalence queries. Machine Learning, 5:121-150, 1990.
3. V. Arvind and N. V. Vinodchandran. The complexity of exactly learning algebraic concepts. Seventh Workshop on Algorithmic Learning Theory, LNAI 1160, 100-112, 1996.
4. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity - I & II. Springer Verlag, Berlin Hiedelberg, 1988.
5. R. Book, T. Long and A. Selman. Quantitative relativization of complexity classes. SIAM Journal on Computing, 13:461-487, 1984.
6. S. Fenner, L. Fortnow, S. Kurtz. Gap-definable counting classes. Proc. 6th Structure in Complexity Theory Conference, 30-42, 1991.
7. M. Furst, J. E. Hopcroft and E. Luks. Polynomial time algorithms for permutation groups. Proc. 21st IEEE Symposium of Foundations of Computer Science, 36-45, 1980.
8. R. Gavaldb. On the power of equivalence queries. EUROCOLT, 193-203, 1993.
9. S. A. Goldman and M. J. Kearns On the complexity of teaching. Journal of Computer and System Sciences 50: 20-31, 1995.
10. M. Hall. The Theory of Groups. Macmillan, New York, 1959.
11. L. tiellerstein, K. Pillaipakkamnatt, V. Raghavan and D. Vilkins. How many queries are needed to learn? Proc. of the 27 th Symposium on the Theory of Compurating, 190-199, 1995.
12. O. Watanabe. A formal study of learning via queries. 17th International Colloquium on Automata, Languages and Programming, LNCS 443: 139-152, 1990.
13. O. Watanabe and R. Gavaldk. Structural analysis of polynomial time query learnability. Mathematical Systems Theory, 27:231-256, 1994.