43 citations · 59 across the 7 of their papers we have counts for
8 papers
Heterogeneous Information-Bottleneck Coordination Graphs for Multi-Agent Reinforcement Learning
Wei Duan, Junyu Xuan, En Yu +2
Coordination graphs are a central abstraction in cooperative multi-agent reinforcement learning (MARL), yet existing sparse-graph learners lack a theoretically grounded mechanism t…
Bandwidth-constrained Variational Message Encoding for Cooperative Multi-agent Reinforcement Learning
Wei Duan, Jie Lu, En Yu +1
Graph-based multi-agent reinforcement learning (MARL) enables coordinated behavior under partial observability by modeling agents as nodes and communication links as edges. While r…
Bayesian Ego-graph Inference for Networked Multi-Agent Reinforcement Learning
Wei Duan, Jie Lu, Junyu Xuan
In networked multi-agent reinforcement learning (Networked-MARL), decentralized agents must act under local observability and constrained communication over fixed physical graphs.…
Group-Aware Coordination Graph for Multi-Agent Reinforcement Learning
Wei Duan, Jie Lu, Junyu Xuan
Cooperative Multi-Agent Reinforcement Learning (MARL) necessitates seamless collaboration among agents, often represented by an underlying relation graph. Existing methods for lear…
Layer-diverse Negative Sampling for Graph Neural Networks
Wei Duan, Jie Lu, Yu Guang Wang +1
Graph neural networks (GNNs) are a powerful solution for various structure learning applications due to their strong representation capabilities for graph data. However, traditiona…
Inferring Latent Temporal Sparse Coordination Graph for Multi-Agent Reinforcement Learning
Wei Duan, Jie Lu, Junyu Xuan
Effective agent coordination is crucial in cooperative Multi-Agent Reinforcement Learning (MARL). While agent cooperation can be represented by graph structures, prevailing graph l…
Graph Convolutional Neural Networks with Diverse Negative Samples via Decomposed Determinant Point Processes
Wei Duan, Junyu Xuan, Maoying Qiao +1
Graph convolutional networks (GCNs) have achieved great success in graph representation learning by extracting high-level features from nodes and their topology. Since GCNs general…
Learning from the Dark: Boosting Graph Convolutional Neural Networks with Diverse Negative Samples
Wei Duan, Junyu Xuan, Maoying Qiao +1
Graph Convolutional Neural Networks (GCNs) has been generally accepted to be an effective tool for node representations learning. An interesting way to understand GCNs is to think…