Robust and Efficient Communication for Multi-Agent Learning
- URL: http://arxiv.org/abs/2609.15361v1
- Date: Mon, 14 Sep 2026 10:44:11 GMT
- Title: Robust and Efficient Communication for Multi-Agent Learning
- Abstract summary: This paper introduces Multi-Agent Regularized Communication (MARC), a novel framework inspired by information-theoretic principles of conditional mutual information.<n>MARC employs an attention-based architecture coupled with a unique message regularization mechanism designed to minimize uncertainty regarding future system states.<n>Our results demonstrate that MARC significantly outperforms state-of-the-art methods in complex cooperative domains.
- Score: 1.7205106391379026
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Effective communication is a cornerstone of distributed intelligence in Multi-Agent Reinforcement Learning (MARL), yet ensuring that generated messages are both informative and robust to physical constraints remains a significant challenge. This paper introduces Multi-Agent Regularized Communication (MARC), a novel framework inspired by information-theoretic principles of conditional mutual information. MARC employs an attention-based architecture coupled with a unique message regularization mechanism designed to minimize uncertainty regarding future system states, thereby inducing the learning of highly representative communication protocols. Crucially, we evaluate MARC under stringent communication bottlenecks and lossy channels, simulating the real-world constraints of autonomous robotic networks and decentralized systems. Our results demonstrate that MARC significantly outperforms state-of-the-art methods in complex cooperative domains. Furthermore, we provide a deep analysis of message characteristics, proving that MARC maintains high operational performance even under significant data compression, offering a scalable path for deploying intelligent agents in resource-constrained environments.
Related papers
- Task-Oriented Sensing and Covert Transmissions for Collaborative Multi-AUV Systems [67.63956000297922]
This paper proposes a Sensed Information Value Realization Multi-Agent Reinforcement Learning (SVR-MARL) framework to characterize the utility of information for cooperative tasks.<n>The potential of the proposed framework to improve collaborative task efficiency while reducing unnecessary communication and exposure risks is demonstrated.
arXiv Detail & Related papers (2026-07-15T14:29:25Z) - SCALE-COMM: Shared, Contrastively-Aligned Latent Embeddings for MARL Communication [0.0]
We propose a self-supervised framework for learning compact, stable, and policy-relevant communication representations.<n>We show that the learned communication space yields improved stability, sample efficiency, and throughput under policy fine-tuning.
arXiv Detail & Related papers (2026-05-26T18:06:19Z) - CIA: Inferring the Communication Topology from LLM-based Multi-Agent Systems [52.48183625867145]
Multi-Agent Systems (MAS) have demonstrated remarkable capabilities in solving complex tasks.<n>Central to MAS is the communication topology which governs how agents exchange information internally.<n>In this paper, we investigate a critical privacy risk: MAS communication topologies can be inferred under a restrictive black-box setting.
arXiv Detail & Related papers (2026-04-14T08:48:15Z) - Robust and Efficient Communication in Multi-Agent Reinforcement Learning [18.405707681765453]
Multi-agent reinforcement learning (MARL) has made significant strides in enabling coordinated behaviors among autonomous agents.<n>Most existing approaches assume that communication is instantaneous, reliable, and has unlimited bandwidth; these conditions are rarely met in real-world deployments.<n>This survey systematically reviews recent advances in robust and efficient communication strategies for MARL under realistic constraints.
arXiv Detail & Related papers (2025-11-14T15:23:11Z) - Communicating Plans, Not Percepts: Scalable Multi-Agent Coordination with Embodied World Models [0.0]
A central question in Multi-Agent Reinforcement Learning (MARL) is whether to engineer communication protocols or learn them end-to-end.<n>We propose and compare two communication strategies for a cooperative task-allocation problem.<n>Our experiments reveal that while emergent communication is viable in simple settings, the engineered, world model-based approach shows superior performance, sample efficiency, and scalability as complexity increases.
arXiv Detail & Related papers (2025-08-04T21:29:07Z) - Understanding the Information Propagation Effects of Communication Topologies in LLM-based Multi-Agent Systems [58.95962217043371]
We present a causal framework to analyze how agent outputs, whether correct or erroneous, propagate under topologies with varying sparsity.<n>Our empirical studies reveal that moderately sparse topologies, which effectively suppress error propagation while preserving beneficial information diffusion, typically achieve optimal task performance.<n>We propose a novel topology design approach, EIB-leanrner, that balances error suppression and beneficial information propagation by fusing connectivity patterns from both dense and sparse graphs.
arXiv Detail & Related papers (2025-05-29T11:21:48Z) - Reward-Independent Messaging for Decentralized Multi-Agent Reinforcement Learning [7.872846260392537]
MARL-CPC is a framework that enables communication among fully decentralized, independent agents.<n>Unlike conventional methods that treat messages as part of the action space and assume cooperation, MARL-CPC links messages to state inference.<n> Benchmarks show thatBandit-CPC and IPPO-CPC outperform standard message-as-action approaches.
arXiv Detail & Related papers (2025-05-28T05:23:47Z) - Exponential Topology-enabled Scalable Communication in Multi-agent Reinforcement Learning [9.48183472865413]
We develop a scalable communication protocol for cooperative multi-agent reinforcement learning (MARL)<n>We propose utilizing the exponential topology to enable rapid information dissemination among agents by leveraging its small-diameter and small-size properties.<n>Experiments on large-scale cooperative benchmarks, including MAgent and Infrastructure Management Planning, demonstrate the superior performance and robust zero-shot transferability of ExpoComm.
arXiv Detail & Related papers (2025-02-27T03:15:31Z) - AI Flow at the Network Edge [58.31090055138711]
AI Flow is a framework that streamlines the inference process by jointly leveraging the heterogeneous resources available across devices, edge nodes, and cloud servers.<n>This article serves as a position paper for identifying the motivation, challenges, and principles of AI Flow.
arXiv Detail & Related papers (2024-11-19T12:51:17Z) - Collaborative Information Dissemination with Graph-based Multi-Agent
Reinforcement Learning [2.9904113489777826]
This paper introduces a Multi-Agent Reinforcement Learning (MARL) approach for efficient information dissemination.
We propose a Partially Observable Game (POSG) for information dissemination empowering each agent to decide on message forwarding independently.
Our experimental results show that our trained policies outperform existing methods.
arXiv Detail & Related papers (2023-08-25T21:30:16Z) - Cooperative Policy Learning with Pre-trained Heterogeneous Observation
Representations [51.8796674904734]
We propose a new cooperative learning framework with pre-trained heterogeneous observation representations.
We employ an encoder-decoder based graph attention to learn the intricate interactions and heterogeneous representations.
arXiv Detail & Related papers (2020-12-24T04:52:29Z) - Learning Structured Communication for Multi-agent Reinforcement Learning [104.64584573546524]
This work explores the large-scale multi-agent communication mechanism under a multi-agent reinforcement learning (MARL) setting.
We propose a novel framework termed as Learning Structured Communication (LSC) by using a more flexible and efficient communication topology.
arXiv Detail & Related papers (2020-02-11T07:19:45Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.