Iterative Learning from Texts and Counterexamples Using Additional Information
| dc.contributor.author | JAIN, Sanjay | en_US |
| dc.contributor.author | KINBER, Efim | en_US |
| dc.date.accessioned | 2009-04-27T01:24:54Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:13Z | |
| dc.date.available | 2009-04-27T01:24:54Z | en_US |
| dc.date.available | 2017-01-23T07:00:13Z | |
| dc.date.issued | 2009-04-27T01:24:54Z | en_US |
| dc.description.abstract | A variant of iterative learning in the limit is studied when a learner gets negative examples refuting conjectures containing data in excess of the target language and uses additional information of the following four types: a) memorizing up to n input elements seen so far; b) up to $n$ feedback memberships queries (testing if an item is a member of the input seen so far); c) the number of input elements seen so far; d) the maximal element of the input seen so far. We explore how additional information available to such learners may help. In particular, we show that adding the maximal element or the number of elements seen so far helps such learners to infer any indexed class of languages class-preservingly (using a descriptive numbering defining the class) --- as it was proved by Jain and Kinber, this is not possible without using additional information. We also study how, in the given context, different types of additional information fare agains each other, and establish hierarchies of learners memorizing n+1 versus n input elements seen and n+1 versus n feedback membership queries. | en_US |
| dc.format.extent | 306474 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2937 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRB4/09 | en_US |
| dc.title | Iterative Learning from Texts and Counterexamples Using Additional Information | en_US |
| dc.type | Technical Report | en_US |