Mastering Complex Coordination through Attention-based Dynamic Graph

December 07, 2023 Β· Declared Dead Β· πŸ› International Conference on Neural Information Processing

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Guangchong Zhou, Zhiwei Xu, Zeren Zhang, Guoliang Fan arXiv ID 2312.04245 Category cs.MA: Multiagent Systems Cross-listed cs.AI Citations 0 Venue International Conference on Neural Information Processing Last Checked 3 months ago
Abstract
The coordination between agents in multi-agent systems has become a popular topic in many fields. To catch the inner relationship between agents, the graph structure is combined with existing methods and improves the results. But in large-scale tasks with numerous agents, an overly complex graph would lead to a boost in computational cost and a decline in performance. Here we present DAGMIX, a novel graph-based value factorization method. Instead of a complete graph, DAGMIX generates a dynamic graph at each time step during training, on which it realizes a more interpretable and effective combining process through the attention mechanism. Experiments show that DAGMIX significantly outperforms previous SOTA methods in large-scale scenarios, as well as achieving promising results on other tasks.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Multiagent Systems

Died the same way β€” πŸ‘» Ghosted