Self-Sustaining Iterated Learning
From MaRDI portal
Abstract: An important result from psycholinguistics (Griffiths & Kalish, 2005) states that no language can be learned iteratively by rational agents in a self-sustaining manner. We show how to modify the learning process slightly in order to achieve self-sustainability. Our work is in two parts. First, we characterize iterated learnability in geometric terms and show how a slight, steady increase in the lengths of the training sessions ensures self-sustainability for any discrete language class. In the second part, we tackle the nondiscrete case and investigate self-sustainability for iterated linear regression. We discuss the implications of our findings to issues of non-equilibrium dynamics in natural algorithms.
Recommendations
Cites work
- scientific article; zbMATH DE number 3103174 (Why is no real title available?)
- Eigenvalues and Condition Numbers of Random Matrices
- Encyclopedia of mathematics. Springer online reference works
- Local operator theory, random matrices and Banach spaces.
- Markov Chains
- Smallest singular value of a random rectangular matrix
Cited in
(3)
This page was built for publication: Self-Sustaining Iterated Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638066)