Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
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)
Baliga, G., Case, J., Jain, S.: Language learning with some negative information. Journal of Computer and System Sciences 51(5), 273–285 (1995)
Case, J., Lynes, C.: Machine inductive inference and language identification. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 107–115. Springer, Heidelberg (1982)
Case, J., Smith, C.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25, 193–220 (1983)
Gasarch, W., Martin, G.: Bounded Queries in Recursion Theory. Birkhauser, Basel (1998)
Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
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)
Jain, S., Kinber, E.: Learning languages from positive data and a finite number of queries. Information and Computation 204, 123–175 (2006)
Jain, S., Kinber, E.: Learning languages from positive data and negative counterexamples. Journal of Computer and System Sciences (to appear, 2006)
Lange, S., Zilles, S.: Comparison of query learning and gold-style learning in dependence of the hypothesis space. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol. 3244, pp. 99–113. Springer, Heidelberg (2004)
Lange, S., Zilles, S.: Replacing limit learners with equally powerful one-shot query learners. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS (LNAI), vol. 3120, pp. 155–169. Springer, Heidelberg (2004)
Motoki, T.: Inductive inference from all positive and some negative data. Information Processing Letters 39(4), 177–182 (1991)
Osherson, D., Weinstein, S.: Criteria of language learning. Information and Control 52, 123–138 (1982)
Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967); Reprinted by MIT Press in (1987)
Wiehagen, R., Zeugmann, T.: Ignoring data be the only way to learn efficiently. Journal of Experimental and Theoretical Artificial Intelligence 6, 131–144 (1994)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S., Kinber, E. (2006). On Learning Languages from Positive Data and a Limited Number of Short Counterexamples. In: Lugosi, G., Simon, H.U. (eds) Learning Theory. COLT 2006. Lecture Notes in Computer Science(), vol 4005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11776420_21
Download citation
DOI: https://doi.org/10.1007/11776420_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35294-5
Online ISBN: 978-3-540-35296-9
eBook Packages: Computer ScienceComputer Science (R0)