Skip to main content

Prior knowledge in learning finite parameter spaces

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Głowacka, D., Dorard, L., Medlar, A., & Shawe-Taylor, J. (2011). Prior knowledge in learning finite parameter spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5591 LNAI, pp. 199–213). https://doi.org/10.1007/978-3-642-20169-1_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free