Emergent Communication under Varying Sizes and Connectivities

Jooyeon Kim, Alice OhNeurIPS 2021 · OpenReview

TL;DR

As AI agent groups scale from pairs to hundreds, their emergent languages become less similar across the population, yet they maintain high communication success rates. When communication is restricted to local neighbors or optimized for efficiency, the system naturally evolves "dialects" and "hub nodes," mirroring the scale-free structures found in human social networks.

What Problem Does This Paper Address?

Most research in Emergent Communication (EC)—where AI agents "invent" a language to solve a task—focuses on pairs or very small groups. However, humans communicate in groups of millions.

The authors tackle a fundamental scaling question: If we increase the number of agents to hundreds, does the language converge to a single "universal" protocol, or does it fragment? Furthermore, how does the "social graph" (who is allowed to talk to whom) affect the language? In the real world, we don't talk to everyone; we talk to neighbors or through central hubs. This paper investigates if AI agents will naturally adopt similar structural solutions when constrained.

Methods

The researchers designed a bipartite referential game based on partial information to force communication:

Bipartite referential game setup
  • The Agents: Agents are split into two groups: "Color-only" agents (who see an object's color but not its shape) and "Shape-only" agents (who see shape but not color).
  • The Task: To identify a specific target object among distractors, a speaker from one group must send a message to a listener in the other group. Since neither has the full picture, communication is mandatory for success.
  • The Architecture: Agents use Variational Autoencoders (VAEs) to process raw pixel observations and feedforward networks to generate and interpret messages.
  • Connectivity Models: The authors tested three main setups:
  • All-to-All: Every agent can talk to every agent in the opposite group.
  • Neighbor-to-Neighbor: Agents only communicate with those "nearby" in a virtual 1D ring.
  • Optimized Graphs: Using the CMA-ES (Covariance Matrix Adaptation Evolution Strategy) algorithm, they searched for the best communication links under constraints (e.g., limited number of links or penalties for "long-distance" talking).

Datasets

  • Synthetic Shapes: A custom dataset of RGB images (32x320 pixels) containing 10 objects with 6 colors and 5 shapes.
  • CIFAR-10: To ensure the findings weren't just an artifact of simple shapes, they validated the results using the CIFAR-10 dataset, treating the 10 image classes as the "referents" for communication.

Key Insights and Ideas

Agents using different words for the same object
  • The Scaling Paradox: As the group size increases, the messages sent by different agents for the same object become less similar (more discordant). However, the communication success rate stays high. This suggests that as groups grow, agents care less about who is talking and more about the content of the message, even if the "vocabulary" is shifting.
  • Emergence of Dialects: When communication is restricted to local neighbors, "dialects" emerge. Agents in the same "neighborhood" develop highly similar topographic language patterns that differ from distant neighborhoods.
  • The "Hub" Solution: When the researchers optimized the communication graph under a "hard constraint" (each agent can only have 3 links), the system didn't just pick random partners. It naturally evolved hub nodes—specific agents that act as central routers for information.
  • Scale-Free Networks: Under "soft constraints" (penalizing long-distance links), the optimized graphs resembled scale-free networks, a structure ubiquitous in human social networks and the internet, where a few nodes have many connections while most have few.

Key Results

  • Baseline vs. Communication: Without talking, agents succeeded only 23.6% of the time. With emergent communication, success jumped to 97.2%.
  • Efficiency of Sparse Graphs: In the optimized setup, the researchers reduced link density by 81.25% compared to a fully connected graph, yet the communication success rate only dropped by 5.89%.
  • Random vs. Optimized: A random sparse graph with the same number of links performed significantly worse, seeing a success drop of over 40%. This proves that the structure of the communication network is as vital as the language itself.

Limitations and Future Work

  • Static Environments: The game is a "one-shot" referential task. The authors note that moving to temporally extended environments (where agents move and interact over time) would be a logical next step.
  • Embodiment: The agents are "non-embodied" (they don't have physical presence in a world), which might change how "locality" and "distance" are perceived.
  • Grammar vs. Vocabulary: While the paper looks at message similarity, it doesn't deeply analyze the grammatical structure (systematicity) of the emergent languages, which is a major area of interest in linguistics.

Overall, this work provides a compelling bridge between multi-agent reinforcement learning and network science, suggesting that the "social" structure of AI agents is a key ingredient in developing robust, human-like communication.

Summary updated

Abstract

Recent advances in deep neural networks allowed artificial agents to derive their own emergent languages that promote interaction, coordination, and collaboration within a group. Just as we humans have succeeded in creating a shared language that allows us to interact within a large group, can the emergent communication within an artificial group converge to a shared, agreed language? This research provides an analytical study of the shared emergent language within the group communication settings of different sizes and connectivities. As the group size increases up to hundreds, agents start to speak dissimilar languages, but the rate at which they successfully communicate is maintained. We observe the emergence of different dialects when we restrict the group communication to have local connectivities only. Finally, we provide optimization results of group communication graphs when the number of agents one can communicate with is restricted or when we penalize communication between distant agent pairs. The optimized communication graphs show superior communication success rates compared to graphs with same number of links as well as the emergence of hub nodes and scale-free networks.
BibTeX
@inproceedings{kim2021emergent,
  author = {Jooyeon Kim and Alice Oh},
  title = {{Emergent Communication under Varying Sizes and Connectivities}},
  booktitle = {Advances in Neural Information Processing Systems},
  year = {2021},
  url = {https://openreview.net/forum?id=iqpFcg2TAa0},
}
Figure