Pith. sign in

REVIEW 13 cited by

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 2409.03052 v1 pith:KKDGCOA3 submitted 2024-09-04 cs.LG cs.MA

An Introduction to Centralized Training for Decentralized Execution in Cooperative Multi-Agent Reinforcement Learning

classification cs.LG cs.MA
keywords ctdeexecutiontrainingcentralizeddecentralizedinformationcooperativeduring
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Multi-agent reinforcement learning (MARL) has exploded in popularity in recent years. Many approaches have been developed but they can be divided into three main types: centralized training and execution (CTE), centralized training for decentralized execution (CTDE), and Decentralized training and execution (DTE). CTDE methods are the most common as they can use centralized information during training but execute in a decentralized manner -- using only information available to that agent during execution. CTDE is the only paradigm that requires a separate training phase where any available information (e.g., other agent policies, underlying states) can be used. As a result, they can be more scalable than CTE methods, do not require communication during execution, and can often perform well. CTDE fits most naturally with the cooperative case, but can be potentially applied in competitive or mixed settings depending on what information is assumed to be observed. This text is an introduction to CTDE in cooperative MARL. It is meant to explain the setting, basic concepts, and common methods. It does not cover all work in CTDE MARL as the subarea is quite extensive. I have included work that I believe is important for understanding the main concepts in the subarea and apologize to those that I have omitted.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 13 Pith papers

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

  1. CHORUS: Decentralized Multi-Embodiment Collaboration with One VLA Policy

    cs.RO 2026-06 unverdicted novelty 7.0

    CHORUS adapts a single VLA backbone for decentralized control of diverse robot teams, achieving 64-point gains over from-scratch decentralized baselines and outperforming centralized methods in real-world tasks using ...

  2. Plasticity-Enhanced Multi-Agent Mixture of Experts for Dynamic Objective Adaptation in UAVs-Assisted Emergency Communication Networks

    cs.MA 2026-04 unverdicted novelty 7.0

    PE-MAMoE combines sparsely gated mixture-of-experts actors with a non-parametric phase controller in MAPPO to maintain plasticity under dynamic user mobility and traffic, yielding 26.3% higher normalized IQM return in...

  3. Social-spatial dependencies for learning visual navigation

    cs.NE 2026-07 conditional novelty 6.0

    Neural-network agents trained in social environments learn hybrid navigation strategies that combine individual landmark use with social following, with strategy shifts driven by the ratio of skilled to unskilled soci...

  4. Embodied Human-Robot Interaction via Acoustics: A MARL Approach with AcoustoBots for Spatial Data Physicalization

    cs.RO 2026-07 conditional novelty 6.0

    AcoustoBots are mobile robots that use ultrasonic phased arrays to levitate particles at heights encoding spatial data, coordinated via MARL for collision-aware navigation.

  5. Self-CTRL: Self-Consistency Training with Reinforcement Learning

    cs.LG 2026-06 unverdicted novelty 6.0

    Self-CTRL uses RL to align LM self-explanations with behavior, boosting bias correlation to R²=0.64 and refusal prediction accuracy to 92% while cutting harm failures to 0.5%.

  6. Beyond Partner Diversity: An Influence-Based Team Steering Framework for Zero-Shot Human-Machine Teaming

    cs.AI 2026-05 unverdicted novelty 6.0

    IBTS framework uses influence shaping to improve zero-shot human-machine teaming beyond partner diversity alone, with gains shown in Overcooked-AI simulations and a 30-subject human study.

  7. Do LLM-derived graph priors improve multi-agent coordination?

    cs.LG 2026-04 unverdicted novelty 6.0

    LLM-generated coordination graph priors improve multi-agent reinforcement learning performance on MPE benchmarks, with models as small as 1.5B parameters proving effective.

  8. Overcoming Environmental Meta-Stationarity in MARL via Adaptive Curriculum and Counterfactual Group Advantage

    cs.AI 2025-06 unverdicted novelty 6.0

    CL-MARL uses an adaptive curriculum scheduler called FlexDiff and Counterfactual Group Relative Policy Advantage to break static-difficulty training in MARL and achieve higher win rates on hard StarCraft maps.

  9. Probabilistic Verification of Recurrent Neural Networks for Single and Multi-Agent Reinforcement Learning

    cs.AI 2026-05 unverdicted novelty 5.0

    RNN-ProVe uses policy-driven sampling and statistical error bounds to produce high-confidence probabilistic estimates of behavioral violations in RNN policies for single- and multi-agent POMDPs.

  10. ERPPO: Entropy Regularization-based Proximal Policy Optimization

    cs.LG 2026-05 unverdicted novelty 5.0

    ERPPO adds a DSA-based ambiguity estimator to MAPPO and switches between L1 and L2 entropy regularization to improve exploration and stability in non-stationary multi-dimensional observations.

  11. Cross-Modal Navigation with Multi-Agent Reinforcement Learning

    cs.RO 2026-05 unverdicted novelty 5.0

    CRONA is a MARL framework that uses modality-specialized agents with auxiliary beliefs and a centralized multi-modal critic to achieve better performance and efficiency than single-agent baselines on visual-acoustic n...

  12. AGMARL-DKS: An Adaptive Graph-Enhanced Multi-Agent Reinforcement Learning for Dynamic Kubernetes Scheduling

    cs.DC 2026-03 unverdicted novelty 5.0

    AGMARL-DKS uses per-node multi-agent RL with GNN state representations and stress-aware lexicographical ordering to outperform the default Kubernetes scheduler on fault tolerance, utilization, and cost for batch and m...

  13. SwarmHarness: Skill-Based Task Routing via Decentralized Incentive-Aligned AI Agent Networks

    cs.AI 2026-05 unverdicted novelty 4.0

    SwarmHarness is a proposed decentralized protocol for compute sharing among AI agents via DHT registry, load-aware routing, and credit incentives that penalize non-contributors.