Title :
The complexity of learning with queries
Author_Institution :
Dept. of Software, Univ. Politecnica de Catalunya, Barcelona, Spain
fDate :
28 Jun- 1 Jul 1994
Abstract :
We survey recent research concerning the qualitative complexity of Angluin´s (1993) model of learning with queries. In this model, there is a learner that tries to identify a target concept by means of queries to a teacher. Thus, the process can be naturally formulated as an oracle computation. Among the results we review there are: characterizations of the power of different learning protocols by complexity classes of oracle machines; relations between the complexity of learning and the complexity of computing advice functions for nonuniform classes; and combinatorial characterizations of the concept classes that are learnable in specific protocols
Keywords :
automata theory; computational complexity; learning (artificial intelligence); advice functions; combinatorial characterizations; complexity; complexity classes; learning protocols; learning with queries; oracle computation; oracle machines; Books; Complexity theory; Large scale integration; Machine learning; Polynomials; Protocols; Transducers; Turing machines;
Conference_Titel :
Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth Annual
Conference_Location :
Amsterdam
Print_ISBN :
0-8186-5670-0
DOI :
10.1109/SCT.1994.315791
