Pith. sign in

Multi-Agent Cooperation and the Emergence of (Natural) Language

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

The current mainstream approach to train natural language systems is to expose them to large amounts of text. This passive learning is problematic if we are interested in developing interactive machines, such as conversational agents. We propose a framework for language learning that relies on multi-agent communication. We study this learning in the context of referential games. In these games, a sender and a receiver see a pair of images. The sender is told one of them is the target and is allowed to send a message from a fixed, arbitrary vocabulary to the receiver. The receiver must rely on this message to identify the target. Thus, the agents develop their own language interactively out of the need to communicate. We show that two networks with simple configurations are able to learn to coordinate in the referential game. We further explore how to make changes to the game environment to cause the "word meanings" induced in the game to better reflect intuitive semantic properties of the images. In addition, we present a simple strategy for grounding the agents' code into natural language. Both of these are necessary steps towards developing machines that are able to communicate with humans productively.

fields

cs.CL 1 cs.LG 1

years

2026 2

representative citing papers

Provably Optimal Learning Algorithms for Assistance Games

cs.LG · 2026-07-09 · accept · novelty 7.5

Decentralized poly-time algorithms achieve (1-1/e)-approximate assistance regret Õ(T^{3/4}) (or Õ(√T) with shared randomness) for online assistance games, and better approximation is intractable.

Agent-based models for the evolution of morphological alternation patterns

cs.CL · 2026-06-10 · unverdicted · novelty 6.0

Multi-agent simulations with naturalistic lexicons and phonological rules show scale-free networks and Bernoulli adoption produce more plausible morphologies, evaluated by an LLM historical linguist debate system and tested via historical case studies.

citing papers explorer

Showing 2 of 2 citing papers.

  • Provably Optimal Learning Algorithms for Assistance Games cs.LG · 2026-07-09 · accept · none · ref 39 · internal anchor

    Decentralized poly-time algorithms achieve (1-1/e)-approximate assistance regret Õ(T^{3/4}) (or Õ(√T) with shared randomness) for online assistance games, and better approximation is intractable.

  • Agent-based models for the evolution of morphological alternation patterns cs.CL · 2026-06-10 · unverdicted · none · ref 100 · internal anchor

    Multi-agent simulations with naturalistic lexicons and phonological rules show scale-free networks and Bernoulli adoption produce more plausible morphologies, evaluated by an LLM historical linguist debate system and tested via historical case studies.