Please use this identifier to cite or link to this item:
|Title:||Variations on U-shaped learning|
|Citation:||Carlucci, L.,Jain, S.,Kinber, E.,Stephan, F. (2005). Variations on U-shaped learning. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3559 LNAI : 382-397. ScholarBank@NUS Repository.|
|Abstract:||The paper deals with the following problem: is returning to wrong conjectures necessary to achieve full power of learning? Returning to wrong conjectures complements the paradigm of U-shaped learning [2, 6, 8, 20, 24] when a learner returns to old correct conjectures. We explore our problem for classical models of learning in the limit: TxtEx-learning - when a learner stabilizes on a correct conjecture, and TxtBc-learning - when a learner stabilizes on a sequence of grammars representing the target concept. In all cases, we show that, surprisingly, returning to wrong conjectures is sometimes necessary to achieve full power of learning. On the other hand it is not necessary to return to old "overgeneralizing" conjectures containing elements not belonging to the target language. We also consider our problem in the context of so-called vacillatory learning when a learner stabilizes to a finite number of correct grammars. In this case we show that both returning to old wrong conjectures and returning to old "overgeneralizing" conjectures is necessary for full learning power. We also show that, surprisingly, learners consistent with the input seen so far can be made decisive [2, 21] - they do not have to return to any old conjectures - wrong or right. © Springer-Verlag Berlin Heidelberg 2005.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.