Please use this identifier to cite or link to this item:
|Title:||Prescribed learning of indexed families||Authors:||Jain, S.
|Issue Date:||2008||Citation:||Jain, S.,Stephan, F.,Nan, Y. (2008). Prescribed learning of indexed families. Fundamenta Informaticae 83 (1-2) : 159-175. ScholarBank@NUS Repository.||Abstract:||This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studies mainly focused on the case where the learner chooses a particular hypothesis space, the goal of this work is to investigate the case where the learner has to cope with all possible hypothesis spaces. In that sense, the present work combines the approach of Angluin, Lange and Zeugmann with the question of how a learner can be synthesized. The investigation for the case of uniformly r.e. classes has been done by Jain, Stephan and Ye . This paper investigates the case for indexed families and gives a special attention to the notions of conservative and non U-shaped learning.||Source Title:||Fundamenta Informaticae||URI:||http://scholarbank.nus.edu.sg/handle/10635/43100||ISSN:||01692968|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.