pith. sign in

arxiv: 1609.03960 · v1 · pith:Z6N26Z4Mnew · submitted 2016-09-13 · 🧮 math.OC · cs.LG· stat.ML

Self-Sustaining Iterated Learning

classification 🧮 math.OC cs.LGstat.ML
keywords iteratedself-sustainabilitylanguagelearningself-sustainingachieveagentsalgorithms
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.