Abstract
We study the learnability of enumerable families \(\mathcal{L}\) of uniformly recursive languages in dependence on the number of allowed mind changes, i.e., with respect to a well-studied measure of efficiency. We distinguish between exact learnability (\(\mathcal{L}\) has to be inferred w.r.t. \(\mathcal{L}\)) and class preserving learning (\(\mathcal{L}\) has to be inferred w.r.t. some suitable chosen enumeration of all the languages from \(\mathcal{L}\)) as well as between learning from positive and from both, positive and negative data.
The measure of efficiency is applied to prove the superiority of class preserving learning algorithms over exact learning. We considerably improve results obtained previously and establish two infinite hierarchies. Furthermore, we separate exact and class preserving learning from positive data that avoids overgeneralization. Finally, language learning with a bounded number of mind changes is completely characterized in terms of recursively generable finite sets. These characterizations offer a new method to handle overgeneralizations and resolve an open question of Mukouchi (1992).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D. (1980), Inductive inference of formal languages from positive data, Inf. and Control45, 117–135.
Angluin, D., and Smith, C.H. (1987), Formal inductive inference, in “Encyclopedia of Artificial Intelligence” (St.C. Shapiro, Ed.), Vol. 1, pp. 409–418, Wiley-Interscience Publication, New York.
Barzdin, Ya.M., and Freivalds, R.V. (1972), On the prediction of general recursive functions, Sov. Math. Dokl.13, 1224–1228.
Blum, L., and Blum, M. (1975), Toward a mathematical theory of inductive inference, Inf. and Control28, 122–155
Case, J. (1988), The power of vacillation, in “Proc. 1st Workshop on Computational Learning Theory,” (D. Haussler and L. Pitt, Eds.), pp. 196–205, Morgan Kaufmann Publishers Inc.
Case, J., and Lynes, C. (1982), Machine inductive inference and language identification, in “Proc. Automata, Languages and Programming, 9th Colloquium,” (M. Nielsen and E.M. Schmidt, Eds.), Lecture Notes in Computer Science Vol. 140, pp. 107–115, Springer-Verlag, Berlin.
Case, J., and Smith, C. (1983), Comparison of identification criteria for machine inductive inference, Theoretical Computer Science25, 193–220.
Fulk, M.(1990), Prudence and other restrictions in formal language learning, Inf. and Computation85, 1–11.
Gasarch, W.I., and Velauthapillai, M. (1992), Asking questions versus verifiability, in “Proc. 3rd International Workshop on Analogical and Inductive Inference,” (K.P. Jantke, ed.) Lecture Notes in Artificial Intelligence Vol. 642, pp. 197–213, Springer-Verlag, Berlin.
Gold, E.M. (1967), Language Identification in the Limit, Inf. and Control10, 447–474.
Jain, S., and Sharma, A. (1989), Recursion theoretic characterizations of language learning, Univ. of Rochester, Dept. of Comp. Sci., TR 281.
Kapur, S., and Bilardi, G. (1992), Language learning without overgeneralization, in “Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science,” (A. Finkel and M. Jantzen, Eds.), Lecture Notes in Computer Science Vol. 577, pp. 245–256, Springer-Verlag, Berlin.
Lange, S., and Zeugmann, T. (1992), Types of monotonic language learning and their characterization, in “Proc. 5th Annual ACM Workshop on Computational Learning Theory,” pp. 377–390, ACM Press.
Lange, S., Zeugmann, T., and Kapur, S. (1992), Class preserving monotonic language learning, GOSLER-Report 14/92, FB Mathematik und Informatik, TH Leipzig.
Mukouchi, Y. (1992), Inductive Inference with Bounded Mind Changes, in Proc. “Algorithmic Learning Theory,” October 1992, Tokyo, Japan, JSAI.
Osherson, D., Stob, M., and Weinstein, S. (1986), “Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists,” MIT-Press, Cambridge, Massachusetts.
Shinohara, T. (1990), Inductive Inference from Positive Data is Powerful, in “Proc. 3rd Annual Workshop on Computational Learning Theory,” (M. Fulk and J. Case, Eds.), pp. 97–110, Morgan Kaufmann Publishers Inc.
Wiehagen, R. (1977), Identification of formal languages, in “Proc. Mathematical Foundations of Computer Science,” (J. Gruska, Ed.), Lecture Notes in Computer Science Vol. 53, pp. 571–579, Springer-Verlag, Berlin.
Wiehagen, R., Freivalds, R., and Kinber, B. (1984), On the power of probabilistic strategies in inductive inference, Theoretical Computer Science28, 111–133.
Zeugmann, T. (1983), A-posteriori characterizations in inductive inference of recursive functions, J. of Inf. Processing and Cybernetics (EIK)19, 559–594.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lange, S., Zeugmann, T. (1993). Language learning with a bounded number of mind changes. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_67
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive