paper-with-me

홈 › Papers

QPLEX: Duplex Dueling Multi-Agent Q-Learning

2020-08-03 · ICLR 2021 1 · Jianhao Wang, Zhizhou Ren, Terry Liu, Yang Yu, Chongjie Zhang

We explore value-based multi-agent reinforcement learning (MARL) in the popular paradigm of centralized training with decentralized execution (CTDE). CTDE has an important concept, Individual-Global-Max (IGM) principle, which requires the consistency between joint and local action selections to support efficient local decision-making. However, in order to achieve scalability, existing MARL methods either limit representation expressiveness of their value function classes or relax the IGM consistency, which may suffer from instability risk or may not perform well in complex domains. This paper presents a novel MARL approach, called duPLEX dueling multi-agent Q-learning (QPLEX), which takes a duplex dueling network architecture to factorize the joint value function. This duplex dueling structure encodes the IGM principle into the neural network architecture and thus enables efficient value function learning. Theoretical analysis shows that QPLEX achieves a complete IGM function class. Empirical experiments on StarCraft II micromanagement tasks demonstrate that QPLEX significantly outperforms state-of-the-art baselines in both online and offline data collection settings, and also reveal that QPLEX achieves high sample efficiency and can benefit from offline datasets without additional online exploration.

📄 PDF Abstract BibTeX arXiv:2008.01062

Code (6)

wjh720/QPLEX 공식 구현 pytorch
cathyhxh/ctds pytorch
hyunghona/emu pytorch
oxwhirl/wqmix pytorch
somnathhazra/uncertainties_marl pytorch
umersheikh846/WQMIX pytorch

Tasks

Decision MakingMulti-agent Reinforcement LearningQ-LearningStarcraftStarcraft II

Methods 이 논문이 사용한 방법론

Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Double Q-learning Double Q-learning is an off-policy reinforcement learning algorithm that utilises double estimation to counteract overestimation problems with traditional Q-learning. The…
Q-Learning Q-Learning is an off-policy temporal difference control algorithm: $$Q\left(S\_{t}, A\_{t}\right) \leftarrow Q\left(S\_{t}, A\_{t}\right) + \alpha\left[R_{t+1} +…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Dueling Network A Dueling Network is a type of Q-Network that has two streams to separately estimate (scalar) state-value and the advantages for each action. Both streams share a common…

Similar Papers 제목 키워드 기반

Fixing Incomplete Value Function Decomposition for Multi-Agent Reinforcement Learning

2025-05-15 · Andrea Baisero, Rupali Bhati, Shuo Liu, Aathira Pillai 외

Value function decomposition methods for cooperative multi-agent reinforcement learning compose joint values from individual per-agent utilities, and train them using a joint objective. To ensure that the action selectio…

Multi-agent Reinforcement Learningreinforcement-learningReinforcement Learning

Residual Q-Networks for Value Function Factorizing in Multi-Agent Reinforcement Learning

2022-05-30 · Rafael Pina, Varuna De Silva, Joosep Hook, Ahmet Kondoz

Multi-Agent Reinforcement Learning (MARL) is useful in many problems that require the cooperation and coordination of multiple agents. Learning optimal policies using reinforcement learning in a multi-agent setting can b…

Multi-agent Reinforcement Learningreinforcement-learningReinforcement Learning (RL)

Dueling Bandits: From Two-dueling to Multi-dueling

2022-11-16 · Yihan Du, Siwei Wang, Longbo Huang

We study a general multi-dueling bandit problem, where an agent compares multiple options simultaneously and aims to minimize the regret due to selecting suboptimal arms. This setting generalizes the traditional two-duel…

Vocal Bursts Valence Prediction

KLUCB Approach to Copeland Bandits

2019-02-07 · Nischal Agrawal, Prasanna Chaporkar

Multi-armed bandit(MAB) problem is a reinforcement learning framework where an agent tries to maximise her profit by proper selection of actions through absolute feedback for each action. The dueling bandits problem is a…

Information RetrievalReinforcement LearningRetrievalThompson Sampling

VideoFDB: Evaluating Full-Duplex Vision-Speech Capabilities in Conversational Agents

2026-05-28 · Amrita Mazumdar, Seonwook Park, Rajarshi Roy, Nikhil Srihari 외 arxiv

Natural human conversation is full-duplex and audio-visual: people simultaneously speak and listen while continuously interpreting and producing nonverbal cues, such as nods, smiles, and gestures. To support successful h…

Visual Question Answering