ClusterComm: Discrete Communication in Decentralized MARL using Internal Representation Clustering
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:LGM3LFWDrecord.jsonopen to challenge →
read the original abstract
In the realm of Multi-Agent Reinforcement Learning (MARL), prevailing approaches exhibit shortcomings in aligning with human learning, robustness, and scalability. Addressing this, we introduce ClusterComm, a fully decentralized MARL framework where agents communicate discretely without a central control unit. ClusterComm utilizes Mini-Batch-K-Means clustering on the last hidden layer's activations of an agent's policy network, translating them into discrete messages. This approach outperforms no communication and competes favorably with unbounded, continuous communication and hence poses a simple yet effective strategy for enhancing collaborative task-solving in MARL.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
SCALE-COMM: Shared, Contrastively-Aligned Latent Embeddings for MARL Communication
SCALE-COMM uses contrastive alignment on latent embeddings to decouple and stabilize communication learning from policy optimization in decentralized MARL, showing gains on benchmarks and a warehouse task.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.