Foresight Of Graph Reinforcement Learning Latent Permutations Learnt By Gumbel Sinkhorn Network

Abstract

Vital importance has necessity to be attached to cooperation in multi-agent environments, as a result of which some reinforcement learning algorithms combined with graph neural networks have been proposed to understand the mutual interplay between agents. However, highly complicated and dynamic multi-agent environments require more ingenious graph neural networks, which can comprehensively represent not only the graph topology structure but also evolution process of the structure due to agents emerging, disappearing and moving. To tackle these difficulties, we propose Gumbel Sinkhorn graph attention reinforcement learning, where a graph attention network highly represents the underlying graph topology structure of the multi-agent environment, and can adapt to the dynamic topology structure of graph better with the help of Gumbel Sinkhorn network by learning latent permutations. Empirically, simulation results show how our proposed graph reinforcement learning methodology outperforms ex

Stats

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

Related papers

• Towards Heterogeneous Multi-agent Reinforcement Learning With Graph Neural Networks (2020)6.34
• Spectra: Scalable Multi-agent Reinforcement Learning With Permutation-free Networks (2025)0.00
• Soft Hierarchical Graph Recurrent Networks For Many-agent Partially Observable Environments (2021)0.00
• Efficient Policy Generation In Multi-agent Systems Via Hypergraph Neural Network (2022)0.00
• Cooperative Policy Learning With Pre-trained Heterogeneous Observation Representations (2020)0.00
• Reinforcement Learning With A Network Of Spiking Agents (2019)0.00
• Inferring Latent Temporal Sparse Coordination Graph For Multi-agent Reinforcement Learning (2024)6.77
• Multi-agent Game Abstraction Via Graph Attention Neural Network (2019)17.02