Information Bottlenecks for Multi-Agent Communication

56 concepts38 papers1 proposal

In cooperative multi-agent reinforcement learning (MARL) and distributed robotic systems, coordination requires information sharing. However, if agents naively transmit their raw observations or unconstrained high-dimensional states, the system quickly hits a scalability wall. Unconstrained communication channels flood the network with redundant chatter and environmental noise, which degrades policy convergence and overwhelms available bandwidth.

The core insight of this research direction is that agents do not need to know everything their teammates observe; they only need the specific information that alters their own optimal decision-making. By forcing communication through information-theoretic and structural bottlenecks, multi-agent systems can learn highly compressed, task-predictive protocols that maximize coordination quality while minimizing bandwidth.

Compressing Observations into Latent Spaces

The first step toward efficient coordination is moving away from raw data transmission. Instead of sharing raw sensor feeds or full environmental grids, agents learn to map high-dimensional observations into compact latent representations.

Prince M. Abudu in CommNets: Communicating Neural Network Architectures for Resource Constrained Systems demonstrates that restricting the shared latent space to a minimal number of dimensions forces nodes to compress complex local observations while still preserving global logical dependencies. Similarly, Zhenning Li et al. (Network-wide traffic signal control optimization using a multi-agent deep reinforcement learning) transform local observations into latent space embeddings before integrating them with global information, preventing raw sensor data from overwhelming the communication channel.

This encoder-processor-decoder pipeline is highly effective across diverse domains:

The Information Bottleneck Objective

Simply reducing the dimensionality of a vector does not guarantee that the remaining bits are relevant to the task. To enforce true information efficiency, researchers apply the Information Bottleneck (IB) principle.

The goal of the IB objective is to minimize the mutual information $I(X; M)$ between an agent's local state $X$ and its transmitted message $M$, while maximizing the mutual information $I(M; Y)$ between $M$ and the target task variable $Y$ (such as joint actions or value functions).

  Local State (X)  ───► [ Information Bottleneck ] ───►  Message (M)  ───►  Target Task (Y)
                           Minimize I(X; M)                                Maximize I(M; Y)

Rundong Wang et al. (Learning Efficient Multi-agent Communication: An Information Bottleneck Approach) formalize this by treating messages as latent variables, forcing the system to learn compact, task-relevant protocols. By squeezing information through this bottleneck, the network naturally filters out redundant data that would otherwise interfere with policy learning. This mechanism is highly effective for resource allocation; Farhad Rezazadeh et al. (Intelligible Protocol Learning for Resource Allocation in 6G O-RAN Slicing) combine MARL with IB theory to compress state information, drastically reducing resource conflicts and latency.

The IB principle acts as a powerful regularizer across different facets of multi-agent learning:

Eliminating Redundancy via Mutual Information Estimation

An efficient communication protocol must not only compress local data but also account for what the receiver already knows. If two agents share overlapping fields of view, transmitting identical features wastes bandwidth.

To solve this, Genjia Liu et al. (RATE-DISTORTION OPTIMIZED PRAGMATIC COMMUNICATION FOR COLLABORATIVE PERCEPTION) introduce Pragmatic Rate-Distortion Theory. By using a neural estimator to calculate the mutual information between a sender's abstract features and a receiver's local observations, agents perform a "feature handshake" to filter out overlapping data and transmit only complementary insights.

Similarly, Jianzhun Shao et al. (Complementary Attention for Multi-Agent Reinforcement Learning) utilize a conditional mutual information estimator as an information bottleneck between a global observer and local agents. This ensures that agents only receive supplemental environmental information not already captured by their local sensors.

To guarantee that the transmitted data directly drives optimal behavior, the communication module can be explicitly tied to the downstream task's utility. For example, the authors of Heterogeneous Multi-Agent Communication Learning via Graph Information Maximization maximize the mutual information between received messages and an agent's local action-value function, forcing the network to produce expressive, task-optimized representations.

Taking this to the extreme, Jingdi Chen et al. (RGMComm: Return Gap Minimization via Discrete Communications in Multi-Agent Reinforcement Learning) demonstrate that agents can bypass descriptive environmental details entirely, focusing communication exclusively on the utility or action-values associated with an observation. This extreme compression mirrors decentralized market mechanisms, such as the work by Hadi Hosseini (Dynamic Multiagent Resource Allocation: Integrating Auctions and MDPs for Real-Time Decisions), which uses iterative auctions to compress high-dimensional agent preferences into simple scalar values.

Structural Bottlenecks: Discretization, Variance, and Topology

Beyond explicit information-theoretic loss functions, researchers use structural constraints within the communication architecture to naturally limit information flow.

Discretization and Binarization

When neural agents are forced to communicate through discrete channels, the channel itself acts as a regularizer. Eugene Kharitonov et al. (Entropy Minimization In Emergent Languages) show that agents trained via discrete channels naturally converge on protocols that minimize message entropy, reaching the theoretical lower bound required for task completion. In practical MARL settings, binarizing communication messages serves as a powerful regularizer that eliminates redundant information and slashes bandwidth requirements (Esmaeil Seraj [Learning Efficient Diverse Communication for Cooperative Heterogeneous Teaming]; Daewoo Kim et al. [Learning to Schedule Communication in Multi-agent Reinforcement Learning]).

Variance Control

Another structural approach involves penalizing message variance during training. Sai Qian Zhang et al. (Efficient Communication in Multi-Agent Reinforcement Learning via Variance Based Control) integrate a variance-based penalty into the reinforcement learning loss function. By minimizing the variability of transmitted messages, this constraint forces agents to suppress low-signal or redundant information, ensuring that only high-signal data is transmitted.

Network Topology and Grounding

Finally, the network topology itself can serve as a bottleneck. Instead of all-to-all communication, the authors of Self-Organized Group for Cooperative Multi-agent Reinforcement Learning propose a hub-and-spoke model that utilizes variational message summarization. By compressing the high-dimensional local observations of multiple agents into a single compact latent variable for broadcast, the system maintains group coordination while requiring substantially less bandwidth.

This architectural efficiency is complemented by physical constraints, such as:

Key Foundational Work

Fully Decentralized Policies for Multi-Agent Systems: An Information Theoretic Approach (2017) — contributed 2 concept elements to this direction.
Dynamic Multiagent Resource Allocation: Integrating Auctions and MDPs for Real-Time Decisions (2012) — contributed 1 concept elements to this direction.
History & citationVersion 1 · 2026-10-04

Current · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_information_bottlenecked_coordination_15a9f0b8,
  title = {information-bottlenecked coordination},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/information-bottlenecked-coordination/rdr_15a9f0b8d2654498b1ea8229b675a536},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_information_bottlenecked_coordination_15a9f0b8_v1,
  title = {information-bottlenecked coordination},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/information-bottlenecked-coordination/rdr_15a9f0b8d2654498b1ea8229b675a536/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}
About

These directions overlap with this one through shared papers.

See something wrong? Report a mistake