Prescribed Learning of Indexed Families
| dc.contributor.author | JAIN, Sanjay | en_US |
| dc.contributor.author | STEPHAN, Frank | en_US |
| dc.contributor.author | YE, Nan | en_US |
| dc.date.accessioned | 2007-09-21T01:27:00Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:26Z | |
| dc.date.available | 2007-09-21T01:27:00Z | en_US |
| dc.date.available | 2017-01-23T07:00:26Z | |
| dc.date.issued | 2007-09-21T01:27:00Z | en_US |
| dc.description.abstract | This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypotheses space used by the learner. While previous studies mainly focused on the case where the learner chooses a particular hypotheses space, the goal of this work is to investigate the case where the learner has to cope with all possible hypotheses 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 recursively enumerable classes has been presented by Jain, Stephan and Ye at the conference Algorithmic Learning Theory 2007. This paper investigates the case for indexed families and gives a special attention to the notions of conservative and non U-shaped learning. | en_US |
| dc.format.extent | 359169 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2573 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRB/07 | en_US |
| dc.title | Prescribed Learning of Indexed Families | en_US |
| dc.type | Technical Report | en_US |