GCT-MARL: Graph-Based Contrastive Transfer for Sample-Efficient Cooperative Multi-Agent Reinforcement Learning

• URL: http://arxiv.org/abs/2606.25073v1
• Date: Tue, 23 Jun 2026 18:31:27 GMT
• Title: GCT-MARL: Graph-Based Contrastive Transfer for Sample-Efficient Cooperative Multi-Agent Reinforcement Learning
• Abstract summary: We propose GCT-MARL, a transfer learning framework that builds on the multi-view graph contrastive backbone of MAIL.<n>We empirically demonstrate that the proposed framework markedly accelerates convergence on the target task.<n>We show that the framework naturally supports continual learning by sequentially chaining the two-phase transfer protocol.
• Score: 0.764671395172401
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In cooperative multi-agent reinforcement learning (MARL), from a deployment perspective, it is challenging and expensive to train agents from scratch for each new environment or task. In this work, we propose GCT-MARL, a transfer learning framework that builds on the multi-view graph contrastive backbone of MAIL and augments it with a per-view, adaptively weighted alignment loss and a two-phase training protocol specifically designed for transfer across populations of varying sizes and compositions. We empirically demonstrate that the proposed framework markedly accelerates convergence on the target task relative to from-scratch training, in both homogeneous (within-faction, varying N) and heterogeneous (cross-faction and mixed unit-type) transfer scenarios. Furthermore, we show that the framework naturally supports continual learning by sequentially chaining the two-phase transfer protocol across a series of related tasks. Overall, this work provides a unified approach to mitigating key limitations in current MARL transfer methods with new insights at both methodological and empirical levels.

Related papers

• Towards Effective Federated Multimodal Graph Learning via Navigating Multifaceted Heterogeneity [12.526349151730921]
  We propose Federated multimodal graph learning with Topology-aware Cross-modal Routing (FedTCR)<n>FedTCR employs a two-stage paradigm that comprises federated task-agnostic pre-training followed by isolated task-oriented fine-tuning.<n> Experiments across 7 domains demonstrate that FedTCR outperforms state-of-the-art baselines on both graph-centric and modality-centric tasks.
  arXiv  Detail & Related papers  (2026-08-01T12:29:38Z)
• Transferability Between Understanding and Generation in Unified Multimodal Models [35.84666508890256]
  Unified Multimodal Models (UMMs) integrate image understanding and generation within a single architecture.<n>We investigate whether training a capability on one task improves the same capability on the other without explicit supervision.
  arXiv  Detail & Related papers  (2026-07-05T17:33:59Z)
• Coordination Graphs for Constrained Multi-Agent Reinforcement Learning [4.278821961637313]
  Coordination Graphs for Constrained Multi-Agent Reinforcement Learning (CG-CMARL)<n>System decomposes the joint problem into pairwise regions, each served by a set of shared Q-functions.<n>At execution time, Max-Sum message passing coordinates actions across the factor graph, while a Lagrangian multiplier controls the objective--constraint tradeoff.
  arXiv  Detail & Related papers  (2026-06-01T14:46:16Z)
• Group Cognition Learning: Making Everything Better Through Governed Two-Stage Agents Collaboration [13.299987551113809]
  Group Cognition Learning (GCL) is a governed collaboration paradigm that applies a two-stage protocol after modality-specific encoding.<n>GCL mitigates modality dominance and coupling, establishing state-of-the-art results across both regression and classification benchmarks.
  arXiv  Detail & Related papers  (2026-05-01T03:19:34Z)
• TopoCurate:Modeling Interaction Topology for Tool-Use Agent Training [53.93696896939915]
  Training tool-use agents typically rely on Supervised Fine-Tuning (SFT) on successful trajectories and Reinforcement Learning (RL) on pass-rate-selected tasks.<n>We propose TopoCurate, an interaction-aware framework that projects multi-trial rollouts from the same task into a unified semantic quotient topology.<n>TopoCurate achieves consistent gains of 4.2% (SFT) and 6.9% (RL) over state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-03-02T10:38:54Z)
• Multi-Agent Model-Based Reinforcement Learning with Joint State-Action Learned Embeddings [10.36125908359289]
  We present a novel model-based multi-agent reinforcement learning framework.<n>We design a world model trained with variational auto-encoders and augment the model using the state-action learned embedding.<n>By coupling imagined trajectories with SALE-based action values, the agents acquire a richer understanding of how their choices influence collective outcomes.
  arXiv  Detail & Related papers  (2026-02-13T01:57:21Z)
• Multi-agent In-context Coordination via Decentralized Memory Retrieval [39.106914463842685]
  Large transformer models, trained on diverse datasets, have demonstrated impressive few-shot performance on previously unseen tasks.<n>In cooperative Multi-Agent Reinforcement Learning (MARL), where agents must coordinate toward a shared goal, decentralized policy deployment can lead to mismatches in task alignment and reward assignment.<n>We introduce Multi-agent In-context Coordination via Decentralized Memory Retrieval (MAICC), a novel approach designed to enhance coordination by fast adaptation.
  arXiv  Detail & Related papers  (2025-11-13T07:08:31Z)
• Offline Multi-agent Reinforcement Learning via Score Decomposition [51.23590397383217]
  offline cooperative multi-agent reinforcement learning (MARL) faces unique challenges due to distributional shifts.<n>This work is the first work to explicitly address the distributional gap between offline and online MARL.
  arXiv  Detail & Related papers  (2025-05-09T11:42:31Z)
• Combat Urban Congestion via Collaboration: Heterogeneous GNN-based MARL for Coordinated Platooning and Traffic Signal Control [14.302023260372563]
  This paper proposes an innovative solution to tackle challenges based on heterogeneous graph multi-agent reinforcement learning and traffic theories.<n>We design platoon and signal control as distinct reinforcement learning agents with their own set of observations, actions, and reward functions to optimize traffic flow.<n>We evaluate our approach through SUMO simulations, which show convergent results in terms of both travel time and fuel consumption, and superior performance compared to other adaptive signal control methods.
  arXiv  Detail & Related papers  (2023-10-17T02:46:04Z)
• MA2CL:Masked Attentive Contrastive Learning for Multi-Agent Reinforcement Learning [128.19212716007794]
  We propose an effective framework called textbfMulti-textbfAgent textbfMasked textbfAttentive textbfContrastive textbfLearning (MA2CL) MA2CL encourages learning representation to be both temporal and agent-level predictive by reconstructing the masked agent observation in latent space. Our method significantly improves the performance and sample efficiency of different MARL algorithms and outperforms other methods in various vision-based and state-based scenarios.
  arXiv  Detail & Related papers  (2023-06-03T05:32:19Z)
• Learning Reward Machines in Cooperative Multi-Agent Tasks [75.79805204646428]
  This paper presents a novel approach to Multi-Agent Reinforcement Learning (MARL) It combines cooperative task decomposition with the learning of reward machines (RMs) encoding the structure of the sub-tasks. The proposed method helps deal with the non-Markovian nature of the rewards in partially observable environments.
  arXiv  Detail & Related papers  (2023-03-24T15:12:28Z)
• Multi-Task Learning as a Bargaining Game [63.49888996291245]
  In Multi-task learning (MTL), a joint model is trained to simultaneously make predictions for several tasks. Since the gradients of these different tasks may conflict, training a joint model for MTL often yields lower performance than its corresponding single-task counterparts. We propose viewing the gradients combination step as a bargaining game, where tasks negotiate to reach an agreement on a joint direction of parameter update.
  arXiv  Detail & Related papers  (2022-02-02T13:21:53Z)
• Cooperative Policy Learning with Pre-trained Heterogeneous Observation Representations [51.8796674904734]
  We propose a new cooperative learning framework with pre-trained heterogeneous observation representations. We employ an encoder-decoder based graph attention to learn the intricate interactions and heterogeneous representations.
  arXiv  Detail & Related papers  (2020-12-24T04:52:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.