Abstract
We propose a new framework for computational analysis of language acquisition in a finite parameter space, for instance, in the “principles and parameters” approach to language. The prior knowledge multi-armed bandit algorithm abstracts the idea of a casino of slot machines in which a player has to play machines in order to find out how good they are, but where he has some prior knowledge that some machines are likely to have similar rates of reward. Each grammar is represented as an arm of a bandit machine with the mean-reward function drawn from a Gaussian Process specified by a covariance function between grammars. We test our algorithm on a ten-parameter space and show that the number of iterations required to identify the target grammar is much smaller than the number of all the possible grammars that the learner would have to explore if he was searching exhaustively the entire parameter space.
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
Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning (47), 235–256 (2002)
Bubeck, S., Munos, R., Stoltz, G., Szepesvari, S.: Online optimization in x-armed bandits. In: Proceedings of NIPS (2008)
Chomsky, N.: Aspects of the Theory of Syntax. MIT Press, Cambridge (1965)
Chomsky, N.: Lectures on government and binding. Foris, Dordrecht (1981)
Davis, S.M.: Syllable onsets as a factor in stress rules. Phonology (5), 1–19 (1988)
Dresher, B.E., Kaye, J.D.: A computational learning model for metrical phonology. Cognition 34, 137–195 (1990)
Gibson, T., Wexler, K.: Triggers. Linguistic Inguiry 25(4), 407–474 (1994)
Gold, E.M.: Language identification in the limit. Information and Control 10(4), 407–454 (1967)
Hale, K., Keyser, J.: On argument structure and the lexical expression of syntactic relations. In: Hale, K., Keyser, J. (eds.) The view from building 20, pp. 53–110. MIT Press, Cambridge (1993)
Hayes, B.: Metrical Stress Theory: Principles and Case Studies. The University of Chicago Press, Chicago (1995)
Kleinberg, R., Slivkins, A., Upfal, E.: Multi-Armed Bandits in Metric Spaces. In: Proceedings of STOC (2008)
Niyogi, P., Berwick, R.C.: A language learning model for finite parameter spaces. Cognition 61, 161–193 (1996)
Niyogi, P.: The Computational Nature of Language Learning and Evolution. MIT Press, Cambridge (2006)
Rasmussen, C.E., Williams, C.K.I.: Gaussian Processes for Machine Learning. MIT Press, Cambridge (2006)
Wang, Y., Audibert, J., Munos, R.: Algorithms for infinitely many-armed bandits. In: Proceedings of NIPS (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Głowacka, D., Dorard, L., Medlar, A., Shawe-Taylor, J. (2011). Prior Knowledge in Learning Finite Parameter Spaces. In: de Groote, P., Egg, M., Kallmeyer, L. (eds) Formal Grammar. FG 2009. Lecture Notes in Computer Science(), vol 5591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20169-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-20169-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20168-4
Online ISBN: 978-3-642-20169-1
eBook Packages: Computer ScienceComputer Science (R0)