Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Emergent Communication: Generalization and Overfitting in Lewis Games (2209.15342v2)

Published 30 Sep 2022 in cs.MA, cs.CL, cs.IT, and math.IT

Abstract: Lewis signaling games are a class of simple communication games for simulating the emergence of language. In these games, two agents must agree on a communication protocol in order to solve a cooperative task. Previous work has shown that agents trained to play this game with reinforcement learning tend to develop languages that display undesirable properties from a linguistic point of view (lack of generalization, lack of compositionality, etc). In this paper, we aim to provide better understanding of this phenomenon by analytically studying the learning problem in Lewis games. As a core contribution, we demonstrate that the standard objective in Lewis games can be decomposed in two components: a co-adaptation loss and an information loss. This decomposition enables us to surface two potential sources of overfitting, which we show may undermine the emergence of a structured communication protocol. In particular, when we control for overfitting on the co-adaptation loss, we recover desired properties in the emergent languages: they are more compositional and generalize better.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Mathieu Rita (7 papers)
  2. Corentin Tallec (16 papers)
  3. Paul Michel (27 papers)
  4. Jean-Bastien Grill (13 papers)
  5. Olivier Pietquin (90 papers)
  6. Emmanuel Dupoux (80 papers)
  7. Florian Strub (39 papers)
Citations (18)