Adaptive Graph Pruning for Multi-Agent Communication

TL;DR

This paper introduces Adaptive Graph Pruning (AGP), a framework that dynamically adjusts the number of agents and their communication structures in multi-agent systems, leading to improved performance, efficiency, and task adaptability across various benchmarks.

Contribution

The paper presents a novel task-adaptive multi-agent collaboration framework that jointly optimizes agent quantity and communication topology through a two-stage training process.

Findings

Achieves state-of-the-art results on six benchmarks with 2.58-9.84% performance increase.

Dynamically constructs optimized communication topologies for different tasks.

Reduces token consumption by over 90%, enhancing efficiency.

Abstract

Large Language Model (LLM) based multi-agent systems have shown remarkable performance in various tasks, especially when enhanced through collaborative communication. However, current methods often rely on a fixed number of agents and static communication structures, limiting their ability to adapt to varying task complexities. In this paper, we propose Adaptive Graph Pruning (AGP), a novel task-adaptive multi-agent collaboration framework that jointly optimizes agent quantity (hard-pruning) and communication topology (soft-pruning). Specifically, our method employs a two-stage training strategy: firstly, independently training soft-pruning networks for different agent quantities to determine optimal agent-quantity-specific complete graphs and positional masks across specific tasks; and then jointly optimizing hard-pruning and soft-pruning within a maximum complete graph to dynamically configure the number of agents and their communication topologies per task. Extensive experiments demonstrate that our approach is: (1) High-performing, achieving state-of-the-art results across six benchmarks and consistently generalizes across multiple mainstream LLM architectures, with a increase in performance of $2.58\%\sim 9.84\%$; (2) Task-adaptive, dynamically constructing optimized communication topologies tailored to specific tasks, with an extremely high performance in all three task categories (general reasoning, mathematical reasoning, and code generation); (3) Token-economical, having fewer training steps and token consumption at the same time, with a decrease in token consumption of $90\%+$; and (4) Training-efficient, achieving high performance with very few training steps compared with other methods. The performance will surpass the existing baselines after about ten steps of training under six benchmarks.