The complexity of learning with queries
We survey recent research concerning the qualitative complexity of Angluin's 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...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1994 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/370054 |
| Acceso en línea: | https://hdl.handle.net/2117/370054 |
| Access Level: | acceso abierto |
| Palabra clave: | Query languages (Computer science) Llenguatges d'interrogació (Informàtica) Àrees temàtiques de la UPC::Informàtica |
| Sumario: | We survey recent research concerning the qualitative complexity of Angluin's 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. |
|---|