Learning a common language through an emergent interaction topology

We study the effects of various emergent topologies of inter-action on the rate of language convergence in a population of communicating agents. The agents generate, parse, and learn the meanings of sentences from each other using re-current neural networks. An agent chooses another agent to interact with and learn from, based on the second agent’s fitness. Fitness is defined to include a frequency-dependent term capturing the approximate number of interactions an agent has had with others—its “popularity ” as a linguistic partner, which in turn is a measure of the proportion of the population which it has taught. This method of frequency-dependent selection is based on our earlier Noisy Preferential Attachment algorithm, which has been shown to produce various network topologies, including scale-free and small-world networks. We show that convergence occurs much more quickly with this strategy than it does for uniformly random interactions. In addition, this strategy more closely represents choice preference dynamics in large natural popu-lations, and so may be more realistic as a model for adaptive language. 1

Learning a Common Language Through an Emergent Interaction Topology

We study the effects of various emergent topologies of interaction on the rate of language convergence in a population of communicating agents. The agents generate, parse, and learn the meanings of sentences from each other using recurrent neural networks. An agent chooses another agent to interact with and learn from, based on the second agent’s fitness. Fitness is defined to include a frequency-dependent term capturing the approximate number of interactions an agent has had with others—its “popularity ” as a linguistic partner, which in turn is a measure of the proportion of the population which it has taught. This method of frequencydependent selection is based on our earlier Noisy Preferential Attachment algorithm, which has been shown to produce various network topologies, including scale-free and smallworld networks. We show that convergence occurs much more quickly with this strategy than it does for uniformly random interactions. In addition, this strategy more closely represents choice preference dynamics in large natural populations, and so may be more realistic as a model for adaptive language. 1