Bandwidth-constrained Variational Message Encoding For Cooperative Multi-agent Reinforcement Learning

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 principled, tunable control over compression strength through interpretable hyperparameters, directly constrai

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyduan2025bandwidth

Related papers

• Efficient Communication In Multi-agent Reinforcement Learning Via Variance Based Control (2019)0.00
• Learning What To Say And How Precisely: Efficient Communication Via Differentiable Discrete Communication Learning (2025)0.00
• Asynchronous Cooperative Multi-agent Reinforcement Learning With Limited Communication (2025)0.00
• V-learning -- A Simple, Efficient, Decentralized Algorithm For Multiagent RL (2021)0.00
• Context-aware Communication For Multi-agent Reinforcement Learning (2023)3.14
• NVIF: Neighboring Variational Information Flow For Large-scale Cooperative Multi-agent Scenarios (2022)0.00
• Cooperative Multi-agent RL With Communication Constraints (2026)0.00
• Robust Multi-agent Reinforcement Learning With Social Empowerment For Coordination And Communication (2020)0.00