Language evolution by iterated learning with Bayesian agents

Cognitive Science

Volumn 31, Issue 3, 2007, Pages 441-480

  Griffiths, Thomas L ^a   Kalish, Michael L ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF LOUISIANA AT LAFAYETTE   (United States)

Author keywords

Bayesian models; Cultural transmission; Iterated learning; Language evolution

Indexed keywords

EID: 34447569515     PISSN: 03640213     EISSN: None     Source Type: Journal    
DOI: 10.1080/15326900701326576     Document Type: Article

References (88)

1. Anderson, J. R. (1990). The adaptive character of thought. Hillsdale, NJ: Erlbaum.
2. Ashby, F. G. (1992). Multidimensional models of perception and cognition. Hillsdale, NJ: Erlbaum.
3. Ashby, F. G., & Alfonso-Rcese, L. A. (1995). Categorization as probability density estimation. Journal of Mathematical Psychology, 39, 216-233.
4. Ashby, F. G., & Maddox, W. T. (1993). Relations between prototype, exemplar, and decision bound models of categorization. Journal of Mathematical Psychology, 37, 372-400.
5. Bilmes, J. A. (1997). A gentle tutorial of the EM algorithm and its applications to parameter estimation for Gaussian mixture and hidden Markov models (Tech. Rep. No. TR-97-021). Berkeley, CA: International Computer Science Institute.
6. Brighton, H. (2002). Compositional syntax from cultural transmission. Artificial Life, 25-54.
7. Briscoe, E. (2002). Linguistic evolution through language acquisition: Formal and computational models. Cambridge, UK: Cambridge University Press.
8. Celeux, G., Chauveau, D., & Diebolt, J. (1995). On stochastic versions of the EM algorithm (Tech. Rep. No. 2514). Monbonnot, France: Institut National de Recherche en Informatique et en Automatique.
9. Celeux, G., & Diebolt, J. (1985). The SEM algorithm: A probabilistic teacher algorithm derived from the EM algorithm for the mixture problem. Computational Statistics Quarterly, 2, 73-82.
10. Celeux, G., & Diebolt, J. (1988). A probabilistic teacher algorithm for iterative maximum likelihood estimation. In H. H. Bock (Ed.), Classification and related methods of data analysis (pp. 617-623). North-Holland: Elsevier.
11. Celeux, G., & Diebolt, J. (1992). A stochastic approximation type EM algorithm for the mixture problem. Stochastics and Stochastics Reports, 41, 119-134.
12. Chater, N. (1996). Reconciling simplicity and likelihood principles in perceptual organization. Psychological Review, 103, 566-581.
13. Chater, N., & Oaksford, M. (1999). Ten years of the rational analysis of cognition. Trends in Cognitive Science, 3, 57-65.
14. Chomsky, N. (1965). Aspects of the theory of syntax. Cambridge, MA: MIT Press.
15. Christiansen, M. H., & Kirby, S. (Eds.). (2003). Language evolution. Oxford: Oxford University Press.
16. Comrie, B. (1981). Language universals and linguistic typology. Chicago: University of Chicago Press.
17. Delyon, B., Lavielle, M., & Moulines, E. (1999). Convergence of a stochastic approximation version of the EM algorithm. The Annals of Statistics, 27, 94-128.
18. Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, B, 39.
19. Diebolt, J., & Celeux, G. (1993). Asymptotic properties of a stochastic EM algorithm for estimating mixing proportions. Communications in Statistics - Stochastic models, 9, 599-613.
20. Diebolt, J., & Ip, E. H. S. (1996). Stochastic EM: method and application. In W. Gilks, S. Richardson, & D. J. Spiegelhalter (Eds.), Markov chain Monte Carlo in practice (pp. 259-273). Suffolk, UK: Chapman and Hall.
21. Dowman, M., Kirby, S., & Griffiths, T. L. (2006). Innateness and culture in the evolution of language. In A. Cangelosi, A. D. M. Smith, & K. Smith (Eds.), The evolution of language: Proceedings of the 6th international conference. Hackensack, NJ: World Scientific.
22. Fort, G., & Moulines, E. (2003). Convergence of the Monte Carlo expectation maximization for curved exponential families. The Annals of Statistics, 31, 1220-1259.
23. Friedman, N. (1998). The Bayesian structural EM algorithm. In Proceedings of the 14th Annual Conference on Uncertainty in Artificial Intelligence (UAI 14) (pp. 129-138).
24. Geman, S., Bienenstock, E., & Doursat, R. (1992). Neural networks and the bias-variance dilemma. Neural Computation, 4, 1-58.
25. Geman, S., & Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 721-741.
26. Gibson, E., & Wexler, K. (1994). Triggers. Linguistic Inquiry, 25, 355-407.
27. Gilks, W., Richardson, S., & Spiegelhalter, D. J. (Eds.). (1996). Markov chain Monte Carlo in practice. Suffolk, UK: Chapman and Hall.
28. Greenberg, J. (Ed.). (1963). Universals of language. Cambridge, MA: MIT Press.
29. Hawkins, J. (Ed.). (1988). Explaining language universals. Oxford: Blackwell.
30. Hirsch, M., & Smale, S. (1974). Differential equations, dynamical systems, and linear algebra. New York: Academic Press.
31. Hoeting, J. A., Madigan, D., Raftery, A. E., & Volinsky, C. T. (1999). Bayesian model averaging: A tutorial (with discussion). Statistical Science, 14, 382-417.
32. Hudson-Kam, C. L., & Newport, E. L. (2005). Regularizing unpredictable variation: The roles of adult and child learners in language formation and change. Language Learning and Development, 1, 151-195.
33. Hurford, J., Studdert-Kennedy, M., & Knight, C. (Eds.). (1998). Approaches to the evolution of language: Social and cognitive bases. Cambridge: Cambridge University Press.
34. Ip, E. H. (2002). On single versus multiple imputation for a class of stochastic algorithms estimating maximum likelihood. Computational Statistics, 17, 517-524.
35. Ip, E. H. S. (1994). A stochastic EM estimator in the presence of missing data - Theory and applications (Tech. Rep.). Stanford, CA: Department of Statistics, Stanford University.
36. Jaynes, E. T. (2003). Probability theory: The logic of science. Cambridge: Cambridge University Press.
37. Kearns, M., & Vazirani, U. (1994). An introduction to computational learning theory. Cambridge, MA: MIT Press.
38. Kemeny, J. G., & Snell, J. L. (1983). Finite Markov chains. New York: Springer-Verlag.
39. Kimura, M. (1983). The neutral theory of molecular evolution. Cambridge: Cambridge University Press.
40. Kirby, S. (1999). Function, selection and innateness: The emergence of language universals. Oxford: Oxford University Press.
41. Kirby, S. (2001). Spontaneous evolution of linguistic structure: An iterated learning model of the emergence of regularity and irregularity. IEEE Journal of Evolutionary Computation, 5, 102-110.
42. Kirby, S., & Hurford, J. (2002). The emergence of linguistic structure: An overview of the iterated learning model. In A. Cangelosi & D. Parisi (Eds.), Simulating the evolution of language (pp. 121-148). London: Springer Verlag.
43. Kirby, S., Smith, K., & Brighton, H. (2004). From UG to universals: linguistic adaptation through iterated learning. Studies in Language, 28, 587-607.
44. Komarova, N. L., Niyogi, P., & Nowak, M. A. (2001). The evolutionary dynamics of grammar acquisition. Journal of Theoretical Biology, 209, 43-59.
45. Komarova, N. L., & Nowak, M. A. (2003). Language dynamics in finite populations. Journal of Theoretical Biology, 221, 445-457.
46. Krifka, M. (2001). Compositionality. In R. A. Wilson & F. Keil (Eds.), The MIT encyclopedia of the cognitive sciences. Cambridge, MA: MIT Press.
47. Kruschke, J. K. (1992). Alcove: An exemplar-based connectionist model of category learning. Psychological Review, 99, 22-44.
48. Li, M., & Vitanyi, P. (1997). An introduction to Kolmogorov complexity and its applications. London: Springer Verlag.
49. Liu, J. S., Wong, W. H., & Kong, A. (1995). Covariance structure and convergence rate of the Gibbs sampler with various scans. Journal of the Royal Statistical Society B, 57, 157-169.
50. Luce, R. D. (1959). Individual choice behavior. New York: John Wiley.
51. MacKay, D. (1995). Probable networks and plausible predictions - A review of practical Bayesian methods for supervised neural networks. Network: Computation in Neural Systems, 6, 469-505.
52. Mackay, D. J. C. (2003). Information theory, inference, and learning algorithms. Cambridge: Cambridge University Press.
53. Manning, C., & Schütze, H. (1999). Foundations of statistical natural language processing. Cambridge, MA: MIT Press.
54. Marr, D. (1982). Vision. San Francisco, CA: W. H. Freeman.
55. McLachlan, G., & Krishnan, T. (1997). The EM algorithm and extensions. New York: Wiley.
56. Myers, J. L. (1976). Probability learning and sequence learning. In W. K. Estes (Ed.), Handbook of learning and cognitive processes: Approaches to human learning and motivation (pp. 171-205). Hillsdale, NJ: Erlbaum.
57. Neal, R. M. (1992). Connectionist learning of belief networks. Artificial Intelligence, 56, 71-113.
58. Neal, R. M. (1993). Probabilistic inference using Markov chain Monte Carlo methods (Tech. Rep. No. CRG-TR-93-1). University of Toronto.
59. Neal, R. M., & Hinton, G. E. (1998). A view EM algorithm that justifies incremental, sparse, and other variants. In M. I. Jordan (Ed.), Learning in graphical models. Cambridge, MA: MIT Press.
60. Nielsen, S. F. (2000). The stochastic EM algorithm: Estimation and asymptotic results. Bernoulli, 6, 457-489.
61. Niyogi, P., & Berwick, R. C. (1995). The logical problem of language change (Tech. Rep.). AI Lab, MIT. (AI Memo-1516)
62. Niyogi, P., & Berwick, R. C. (1996). A language learning model for finite parameter spaces. Cognition, 61, 161-193.
63. Niyogi, P., & Berwick, R. C. (1997a). A dynamical systems model for language change. Complex Systems, 11, 161-204.
64. Niyogi, P., & Berwick, R. C. (1997b). Evolutionary consequences of language learning. Linguistics and Philosophy, 20, 697-719.
65. Norris, J. R. (1997). Markov chains. Cambridge, UK: Cambridge University Press.
66. Nosofsky, R. M. (1986). Attention, similarity, and the identification-categorization relationship. Journal of Experimental Psychology: General, 115, 39-57.
67. Nosofsky, R. M. (1987). Attention and learning processes in the identification and categorization of integral stimuli. Journal of Experimental Psychology: Learning, Memory, and Cognition, 13, 87-108.
68. Nowak, M. A., Komarova, N. L., & Niyogi, P. (2001). Evolution of universal grammar. Science, 291, 114-118.
69. Nowak, M. A., Komarova, N. L., & Niyogi, P. (2002). Computational and evolutionary aspects of language. Nature, 417, 611-617.
70. Nowak, M. A., Plotkin, J. B., & Jansen, V. A. A. (2000). The evolution of syntactic communication. Nature, 404, 495-498.
71. Oaksford, M., & Chater, N. (Eds.). (1998). Rational models of cognition. Oxford: Oxford University Press.
72. Quine, W. V. O. (1960). Word and object. Cambridge, MA: MIT Press.
73. Rice, S. (2004). Evolutionary theory: Mathematical and conceptual foundations. Sunderland, MA: Sinauer.
74. Robert, C. P. (1994). The Bayesian choice: A decision-theoretic motivation. New York: Springer.
75. Rosenthal, J. S. (1995). Convergence rates of Markov chains. SIAM Review, 37, 387-405.
76. Rumelhart, D., & McClelland, J. (1986). On learning the past tenses of English verbs. In J. McClelland, D. Rumelhart, & the PDP research group (Eds.), Parallel distributed processing: Explorations in the microstructure of cognition (Vol. 2). Cambridge, MA: MIT Press.
77. Savage, L. J. (1954). Foundations of statistics. New York: John Wiley & Sons.
78. Schervish, M. J., & Carlin, B. P. (1992). On the convergence of successive substitution sampling. Journal of Computational and Graphical Statistics, 1, 111-127.
79. Shepard, R. N. (1987). Towards a universal law of generalization for psychological science. Science, 237, 1317-1323.
80. Sherman, R. P., Ho, Y.-Y. K., & Dalal, S. R. (1999). Conditions for convergence of Monte-Carlo EM sequences with an application to product diffusion modeling. The Econometrics Journal, 2, 248-267.
81. Smith, K., Kirby, S., & Brighton, H. (2003). Iterated learning: A framework for the emergence of language. Artificial Life, 9, 371-386.
82. Stewart, W. J. (1994). Introduction to the numerical solution of Markov chains. Princeton, NJ: Princeton University Press.
83. Steyvers, M., Tenenbaum, J. B., Wagenmakers, E. J., & Blum, B. (2003). Inferring causal networks from observations and interventions. Cognitive Science, 27, 453-489.
84. Tanner, M. A., & Wong, W. H. (1987). The calculation of posterior distributions by data augmentation (with discussion). Journal of the American Statistical Association, 82, 528-550.
85. Tenenbaum, J. B., & Griffiths, T. L. (2001). Generalization, similarity, and Bayesian inference. Behavioral and Brain Sciences, 24, 629-641.
86. Vapnik, V. N. (1995). The nature of statistical learning theory. New York: Springer.
87. Vulkan, N. (2000). An economist's perspective on probability matching. Journal of Economic Surveys, 14, 101-118.
88. Wei, G. C. G., & Tanner, M. A. (1990). A Monte-Carlo implementation of the EM algorithm and the poor man's data augmentation algorithms. Journal of the American Statistical Assocation, 85, 699-704.