Graph-GRPO: Stabilizing Multi-Agent Topology Learning via Group Relative Policy Optimization
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915830901506048 |
|---|---|
| author | Cang, Yueyang Zhang, Xiaoteng Zhao, Erlu Ji, Zehua Liu, Yuhang He, Yuchen Ning, Zhiyuan Yijun, Chen Que, Wenge Shi, Li |
| author_facet | Cang, Yueyang Zhang, Xiaoteng Zhao, Erlu Ji, Zehua Liu, Yuhang He, Yuchen Ning, Zhiyuan Yijun, Chen Que, Wenge Shi, Li |
| contents | Optimizing communication topology is fundamental to the efficiency and effectiveness of Large Language Model (LLM)-based Multi-Agent Systems (MAS). While recent approaches utilize reinforcement learning to dynamically construct task-specific graphs, they typically rely on single-sample policy gradients with absolute rewards (e.g., binary correctness). This paradigm suffers from severe gradient variance and the credit assignment problem: simple queries yield non-informative positive rewards for suboptimal structures, while difficult queries often result in failures that provide no learning signal. To address these challenges, we propose Graph-GRPO, a novel topology optimization framework that integrates Group Relative Policy Optimization. Instead of evaluating a single topology in isolation, Graph-GRPO samples a group of diverse communication graphs for each query and computes the advantage of specific edges based on their relative performance within the group. By normalizing rewards across the sampled group, our method effectively mitigates the noise derived from task difficulty variance and enables fine-grained credit assignment. Extensive experiments on reasoning and code generation benchmarks demonstrate that Graph-GRPO significantly outperforms state-of-the-art baselines, achieving superior training stability and identifying critical communication pathways previously obscured by reward noise. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_02701 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Graph-GRPO: Stabilizing Multi-Agent Topology Learning via Group Relative Policy Optimization Cang, Yueyang Zhang, Xiaoteng Zhao, Erlu Ji, Zehua Liu, Yuhang He, Yuchen Ning, Zhiyuan Yijun, Chen Que, Wenge Shi, Li Computation and Language Optimizing communication topology is fundamental to the efficiency and effectiveness of Large Language Model (LLM)-based Multi-Agent Systems (MAS). While recent approaches utilize reinforcement learning to dynamically construct task-specific graphs, they typically rely on single-sample policy gradients with absolute rewards (e.g., binary correctness). This paradigm suffers from severe gradient variance and the credit assignment problem: simple queries yield non-informative positive rewards for suboptimal structures, while difficult queries often result in failures that provide no learning signal. To address these challenges, we propose Graph-GRPO, a novel topology optimization framework that integrates Group Relative Policy Optimization. Instead of evaluating a single topology in isolation, Graph-GRPO samples a group of diverse communication graphs for each query and computes the advantage of specific edges based on their relative performance within the group. By normalizing rewards across the sampled group, our method effectively mitigates the noise derived from task difficulty variance and enables fine-grained credit assignment. Extensive experiments on reasoning and code generation benchmarks demonstrate that Graph-GRPO significantly outperforms state-of-the-art baselines, achieving superior training stability and identifying critical communication pathways previously obscured by reward noise. |
| title | Graph-GRPO: Stabilizing Multi-Agent Topology Learning via Group Relative Policy Optimization |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2603.02701 |