One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
As some cognitive research suggests, in the process of learning languages, in addition to overt explicit negative evidence, a child often receives covert explicit evidence in form of corrected or rephrased sentences. In this paper, we suggest one approach to formalization of overt and covert evidence within the framework of one-shot learners via subset and membership queries to a teacher (oracle). We compare and explore general capabilities of our models, as well as complexity advantages of learnability models of one type over models of other types, where complexity is measured in terms of number of queries. In particular, we establish that “correcting” positive examples give sometimes more power to a learner than just negative (counter)examples and access to full positive data.
Unable to display preview. Download preview PDF.
- Becerra-Bonache, L., Bibire, C., Dediu, A.H.: Learning dfa from corrections. In: Fernau, H. (ed.) Theoretical Aspects of Grammar Induction (TAGI), pp. 1–12 (2005). WSI–2005–14Google Scholar
- Becerra-Bonache, L., Dediu, A.H., Tîrnăucă, C.: Learning dfa from correction and equivalence queries. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 281–292. Springer, Heidelberg (2006)Google Scholar
- Gasarch, W., Smith, C.: Learning via queries. Journal of the ACM, 649–674 (1991)Google Scholar
- Jain, S., Kinber, E.: Learning languages from positive data and negative counterexamples. Journal of Computer and System Sciences (to appear, 2007)Google Scholar
- Jain, S., Kinber, E.: One-shot learners using negative counterexamples and nearest positive examples. Technical Report TRA3/07, School of Computing, National University of Singapore (2007)Google Scholar
- Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill (1967) (reprinted by MIT Press in 1987)Google Scholar