Pith. sign in

REVIEW 4 cited by

QPLEX: Duplex Dueling Multi-Agent Q-Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2008.01062 v3 pith:BRHNZMM2 submitted 2020-08-03 cs.LG cs.AIcs.MAstat.ML

classification cs.LGcs.AIcs.MAstat.ML
keywords qplexduelingduplexfunctionmarlmulti-agentvalueachieves
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Zero-Incentive Dynamics: a look at reward sparsity through the lens of unrewarded subgoals

    cs.LG 2025-07 conditional novelty 6.0 of 10

    Unrewarded bottleneck transitions, called zero-incentive dynamics, cause state-of-the-art subgoal-based RL methods to fail, and learning quality degrades sharply with delay between subgoal completion and reward.

  2. Active Domain Knowledge Acquisition with 100-Dollar Budget: Enhancing LLMs via Cost-Efficient, Expert-Involved Interaction in Sensitive Domains

    cs.CL 2025-08 unverdicted novelty 5.0 of 10

    A budget-aware framework (PU-ADKA) selects which domain expert an LLM should query under a fixed $100 budget, improving specialized-domain answers at low cost.

  3. ToMacVF : Temporal Macro-action Value Factorization for Asynchronous Multi-Agent Reinforcement Learning

    cs.MA 2025-07 reject novelty 5.0 of 10

    A temporal macro-action value factorization method with a segmented replay buffer improves asynchronous multi-agent RL performance, but the claimed proof that it generalizes standard IGM is invalid.

  4. Novel Multi-Agent Action Masked Deep Reinforcement Learning for General Industrial Assembly Lines Balancing Problems

    cs.AI 2025-07 conditional novelty 4.0 of 10

    A multi-agent, action-masked deep RL framework for general assembly line balancing that claims faster convergence to optimal schedules and polynomial action-space growth on small benchmark instances.

Pith tools