Oracles in (formula presented) are sufficient for exact learning

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

Volumn 1316, Issue , 1997, Pages 277-290

  Köbler, Johannes ^a   Lindner, Wolfgang ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; POLYNOMIAL APPROXIMATION;

BOOLEAN CIRCUIT; COMBINATORIAL PROPERTIES; EQUIVALENCE QUERIES; HASHING TECHNIQUES; POLYNOMIAL TIME LEARNABILITY; POLYNOMIAL-TIME; QUERY COMPLEXITY; REPRESENTATION CLASS;

POLYNOMIALS;

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

References (16)

1. D. ANGLUIN. Queries and concept learning. Machine Learning, 2:319-342, 1988.
2. D. ANGLUIN. Negative results for equivalence queries. Machine Learning, 5(2):121-150, 1990.
3. N. BSHOUTY, R. CLEVE, R. GAVALDÀ, S. KANNAN, AND C. TAMON. Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52:421-433, 1996.
4. A. BLUMER, A. EHRENFEUCHT, D. HAUSSLER, AND M. K. WARMUTH. Occam's razor. Information Processing Letters, 24(6):377-380, 1987.
5. A. BLUMER, A. EHRENFEUCHT, D. HAUSSLER, AND M. K. WARMUTH. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4):929-965, 1989.
6. J. L. CARTER AND M. N. WEGMAN. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143-154, 1979.
7. R. GAVALDÀ. On the power of equivalence queries. In Proceedings of the 1st European Conference on Computational Learning Theory, 193-203, 1993.
8. R. GAVALDÀ. Bounding the complexity of advice functions. Journal of Computer and System Sciences, 50(3):468-475, 1995.
9. T. HEGEDÜS. Generalized teaching dimensions and the query complexity of learning. In Proceedings of the 8th Annual Conference on Computational Learning Theory (COLT'95), 108-117, New York, NY, USA, July 1995. ACM Press.
10. L. HELLERSTEIN, K. PILLAIPAKKAMNATT, V. RAGHAVAN, AND D. WILKINS. How many queries are needed to learn? Journal of the ACM, 43(5):840-862, 1996.
11. J. KÖBLER. Lowness-Eigenschaften und Erlernbarkeit yon Booleschen Schaltkreisklassen. Habilitation Thesis, Universität Ulm, 1995.
12. J. KÖBLER AND O. WATANABE. New collapse consequences of NP having small circuits. In Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science #944, 196-207. Springer-Verlag, 1995.
13. L. PITT AND L.G. VALIANT. Computational limitations on learning from examples. Journal of the ACM, 35(4):965-984, 1988.
14. M. SIPSER. A complexity theoretic approach to randomness. In Proceedings of the 15th ACM Symposium on Theory of Computing, 330-335. ACM Press, 1983.
15. L. STOCKMEYER. On approximation algorithms for #P. SIAM Journal on Computing, 14(4):849-861, 1985.
16. L. VALIANT. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.