{"title":"通过查询学习的复杂性","authors":"Ricard Gavaldà","doi":"10.1109/SCT.1994.315791","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"The complexity of learning with queries\",\"authors\":\"Ricard Gavaldà\",\"doi\":\"10.1109/SCT.1994.315791\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":386782,\"journal\":{\"name\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1994.315791\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1994.315791","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
