Abstract
In language learning, strong relationships between Gold-style models and query models have recently been observed: in some quite general setting Gold-style learners can be replaced by query learners and vice versa, without loss of learning capabilities. These ‘equalities’ hold in the context of learning indexable classes of recursive languages.
Former studies on Gold-style learning of such indexable classes have shown that, in many settings, the enumerability of the target class and the recursiveness of its languages are crucial for learnability. Moreover, studying query learning, non-indexable classes have been mainly neglected up to now. So it is conceivable that the recently observed relations between Gold-style and query learning are not due to common structures in the learning processes in both models, but rather to the enumerability of the target classes or the recursiveness of their languages.
In this paper, the analysis is lifted onto the context of learning arbitrary classes of r.e. languages. Still, strong relationships between the approaches of Gold-style and query learning are proven, but there are significant changes to the former results. Though in many cases learners of one type can still be replaced by learners of the other type, in general this does not remain valid vice versa. All results hold even for learning classes of recursive languages, which indicates that the recursiveness of the languages is not crucial for the former ‘equality’ results. Thus we analyse how constraints on the algorithmic structure of the target class affect the relations between two approaches to language learning.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adleman, L., Blum, M.: Inductive inference and unsolvability. J. Symbolic Logic 56, 891–900 (1991)
Angluin, D.: Inductive inference of formal languages from positive data. Inform. Control 45, 117–135 (1980)
Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
Angluin, D.: Queries revisited. Theoret. Comput. Sci. 313, 175–194 (2004)
Barzdins, J.: Two theorems on the limiting synthesis of functions. Theory of Algorithms and Programs, Latvian State University, Riga 210, 82–88 (1974)
Case, J., Lynes, C.: Machine inductive inference and language identification. In: Proc. ICALP 1982. LNCS, vol. 140, pp. 107–115. Springer, Heidelberg (1982)
De Jongh, D., Kanazawa, M.: Angluin’s theorem for indexed families of r.e. sets and applications. In: Proc. COLT 1996, pp. 193–204. ACM Press, New York (1996)
Fulk, M.: Prudence and other conditions for formal language learning. Inform. Comput. 85, 1–11 (1990)
Gold, E.M.: Language identification in the limit. Inform. Control 10, 447–474 (1967)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading (1979)
Jain, S., Kinber, E.: Learning languages from positive data and negative counterexamples. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol. 3244, pp. 54–68. Springer, Heidelberg (2004)
Jain, S., Kinber, E.: Learning languages from positive data and a finite number of queries. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS (LNAI), vol. 3328, pp. 360–371. Springer, Heidelberg (2004)
Lange, S., Zeugmann, T.: Language learning in dependence on the space of hypotheses. In: Proc. COLT 1993, pp. 127–136. ACM Press, New York (1993)
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. 129–143. Springer, Heidelberg (2004)
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.: Relations between Gold-style learning and query learning. Submitted to Inform. Comput.
Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)
Stephan, F.: Degrees of Computing and Learning. Habilitationsschrift, Ruprecht-Karls-Univ., Heidelberg (1999)
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
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S., Lange, S., Zilles, S. (2005). Gold-Style and Query Learning Under Various Constraints on the Target Class. In: Jain, S., Simon, H.U., Tomita, E. (eds) Algorithmic Learning Theory. ALT 2005. Lecture Notes in Computer Science(), vol 3734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564089_19
Download citation
DOI: https://doi.org/10.1007/11564089_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29242-5
Online ISBN: 978-3-540-31696-1
eBook Packages: Computer ScienceComputer Science (R0)