On Learning Languages from Positive Data and a Limited Number of Short Counterexamples
We consider two variants of a model for learning languages in the limit from positive data and a limited number of short negative counterexamples (counterexamples are considered to be short if they are smaller that the largest element of input seen so far). Negative counterexamples to a conjecture are examples which belong to the conjectured language but do not belong to the input language. Within this framework, we explore how/when learners using n short (arbitrary) negative counterexamples can be simulated (or simulate) using least short counterexamples or just ‘no’ answers from a teacher. We also study how a limited number of short counterexamples fairs against unconstrained counterexamples. A surprising result is that just one short counterexample (if present) can sometimes be more useful than any bounded number of counterexamples of least size. Most of results exhibit salient examples of languages learnable or not learnable within corresponding variants of our models.
KeywordsTarget Language Initial Sequence Positive Data Negative Data Input Language
Unable to display preview. Download preview PDF.
- [Ang88]Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)Google Scholar
- [Bār74]Bārzdiņš, J.: Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs, vol. 1, pp. 82–88. Latvian State University (1974) (in Russian)Google Scholar
- [GM98]Gasarch, W., Martin, G.: Bounded Queries in Recursion Theory. Birkhauser, Basel (1998)Google Scholar
- [JK05]Jain, S., Kinber, E.: On learning languages from positive data and a limited number of short counterexamples. Technical Report TR21/05, School of Computing, National University of Singapore (2005)Google Scholar
- [JK06b]Jain, S., Kinber, E.: Learning languages from positive data and negative counterexamples. Journal of Computer and System Sciences (to appear, 2006)Google Scholar
- [Rog67]Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967); Reprinted by MIT Press in (1987)Google Scholar
- [ZL95]Zeugmann, T., Lange, S.: A guided tour across the boundaries of learning recursive languages. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS (LNAI), vol. 961, pp. 190–258. Springer, Heidelberg (1995)Google Scholar