Decoupling Communication from Policy: Robust MARL under Bandwidth Constraints

Alexi Canesse, Benoît Goupil, Jesse Read, Sonia Vanier
5/20/2026
cs.MAcs.AIcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Communication enables coordination in multi-agent reinforcement learning (MARL), but many real-world applications, e.g., search-and-rescue with drone swarms, operate under severe bandwidth constraints. Many communication architectures still expose a coupled bottleneck in which a shared latent representation is used for both policy execution and inter-agent communication. Consequently, reducing message size directly limits the policy's latent space, often leading to significant performance degradation. We address this with two contributions. First, we introduce $β$, a normalised per-agent bandwidth budget that unifies sparsity, rounds, and message dimension into a single comparable constraint. Second, we provide SLIM, a minimal architecture that decouples the communication pathway from the policy's latent representation, allowing us to isolate the effect of bandwidth from the effect of policy capacity while benefiting from in-step communication. We evaluate our method on several partially-observable MARL benchmarks, where communication is essential. Our approach achieves state-of-the-art performance and exhibits scalability and robustness under limited communication, with only marginal degradation as bandwidth is reduced.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{canesse2026decoupling,
  title  = {Decoupling Communication from Policy: Robust MARL under Bandwidth Constraints},
  author = {Alexi Canesse and Benoît Goupil and Jesse Read and Sonia Vanier},
  year   = {2026},
  eprint = {2605.21085},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2605.21085v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2605.21085.svg)](https://codeofpaper.com/paper/2605.21085)

Discussion