Bandwidth-constrained Variational Message Encoding for Cooperative Multi-agent Reinforcement Learning
Wei Duan, Jie Lu, En Yu, Junyu Xuan

TL;DR
This paper introduces BVME, a variational message encoding method for multi-agent reinforcement learning that effectively manages bandwidth constraints, maintaining high coordination performance with significantly fewer message dimensions.
Contribution
The paper proposes BVME, a novel variational encoding module that controls message compression in multi-agent RL under bandwidth limits, improving efficiency and coordination.
Findings
BVME achieves 67-83% reduction in message dimensions across benchmarks.
It maintains or improves coordination performance under bandwidth constraints.
BVME performs best on sparse communication graphs.
Abstract
Graph-based multi-agent reinforcement learning (MARL) enables coordinated behavior under partial observability by modeling agents as nodes and communication links as edges. While recent methods excel at learning sparse coordination graphs-determining who communicates with whom-they do not address what information should be transmitted under hard bandwidth constraints. We study this bandwidth-limited regime and show that naive dimensionality reduction consistently degrades coordination performance. Hard bandwidth constraints force selective encoding, but deterministic projections lack mechanisms to control how compression occurs. We introduce Bandwidth-constrained Variational Message Encoding (BVME), a lightweight module that treats messages as samples from learned Gaussian posteriors regularized via KL divergence to an uninformative prior. BVME's variational framework provides…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
