Abstract
Different formal learning models address different aspects of learning. Below we compare learning via queries—interpreting learning as a one-shot process in which the learner is required to identify the target concept with just one hypothesis—to Gold-style learning—interpreting learning as a limiting process in which the learner may change its mind arbitrarily often before converging to a correct hypothesis.
Although these two approaches seem rather unrelated, a previous study has provided characterisations of different models of Gold-style learning (learning in the limit, conservative inference, and behaviourally correct learning) in terms of query learning. Thus under certain circumstances it is possible to replace limit learners by equally powerful one-shot learners. Both this previous and the current analysis are valid in the general context of learning indexable classes of recursive languages.
The main purpose of this paper is to solve a challenging open problem from the previous study. The solution of this problem leads to an important observation, namely that there is a natural query learning type hierarchically in-between Gold-style learning in the limit and behaviourally correct learning. Astonishingly, this query learning type can then again be characterised in terms of Gold-style inference.
In connection with this new in-between inference type we have gained new insights into the basic model of conservative learning and the way conservative learners work. In addition to these results, we compare several further natural inference types in both models to one another.
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.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)
Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
Angluin, D.: Queries revisited. Theoretical Computer Science 313, 175–194 (2004)
Baliga, G., Case, J., Jain, S.: The synthesis of language learners. Information and Computation 152, 16–43 (1999)
Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the ACM 14, 322–336 (1967)
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)
Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading (1979)
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.: On the learnability of erasing pattern languages in the query model. In: Gavaldá, R., Jantke, K.P., Takimoto, E. (eds.) ALT 2003. LNCS (LNAI), vol. 2842, pp. 129–143. Springer, Heidelberg (2003)
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)
Rogers, H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)
Stephan, F.: Degrees of Computing and Learning. Habilitationsschrift, Ruprecht-Karls-Universität, 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, vol. 961, pp. 190–258. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lange, S., Zilles, S. (2004). Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space. In: Ben-David, S., Case, J., Maruoka, A. (eds) Algorithmic Learning Theory. ALT 2004. Lecture Notes in Computer Science(), vol 3244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30215-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-30215-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23356-5
Online ISBN: 978-3-540-30215-5
eBook Packages: Springer Book Archive