A new transformer-based multi-agent world model with teammate prediction and prioritized replay achieves near-optimal performance on cooperative benchmarks in as few as 50,000 environment steps.
Decentralized Transformers with Centralized Aggregation are Sample-Efficient Multi-Agent World Models
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Learning a world model for model-free Reinforcement Learning (RL) agents can significantly improve the sample efficiency by learning policies in imagination. However, building a world model for Multi-Agent RL (MARL) can be particularly challenging due to the scalability issue in a centralized architecture arising from a large number of agents, and also the non-stationarity issue in a decentralized architecture stemming from the inter-dependency among agents. To address both challenges, we propose a novel world model for MARL that learns decentralized local dynamics for scalability, combined with a centralized representation aggregation from all agents. We cast the dynamics learning as an auto-regressive sequence modeling problem over discrete tokens by leveraging the expressive Transformer architecture, in order to model complex local dynamics across different agents and provide accurate and consistent long-term imaginations. As the first pioneering Transformer-based world model for multi-agent systems, we introduce a Perceiver Transformer as an effective solution to enable centralized representation aggregation within this context. Results on Starcraft Multi-Agent Challenge (SMAC) show that it outperforms strong model-free approaches and existing model-based methods in both sample efficiency and overall performance.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Transformer World Model for Sample Efficient Multi-Agent Reinforcement Learning
A new transformer-based multi-agent world model with teammate prediction and prioritized replay achieves near-optimal performance on cooperative benchmarks in as few as 50,000 environment steps.