CLAIMAOct 3, 2023

A Dynamic LLM-Powered Agent Network for Task-Oriented Agent Collaboration

Georgia TechTsinghua
arXiv:2310.02170v2257 citationsh-index: 35
AI Analysis

This work addresses the need for more flexible and efficient multi-agent systems in AI, offering a domain-specific solution for tasks like code generation and reasoning.

The paper tackles the problem of fixed agent numbers and static communication structures in LLM-powered agent collaboration by proposing DyLAN, a framework that dynamically selects and teams agents for tasks, resulting in up to 25.0% accuracy improvement on MMLU subjects.

Recent studies show that collaborating multiple large language model (LLM) powered agents is a promising way for task solving. However, current approaches are constrained by using a fixed number of agents and static communication structures. In this work, we propose automatically selecting a team of agents from candidates to collaborate in a dynamic communication structure toward different tasks and domains. Specifically, we build a framework named Dynamic LLM-Powered Agent Network ($\textbf{DyLAN}$) for LLM-powered agent collaboration, operating a two-stage paradigm: (1) Team Optimization and (2) Task Solving. During the first stage, we utilize an $\textit{agent selection}$ algorithm, based on an unsupervised metric called $\textit{Agent Importance Score}$, enabling the selection of best agents according to their contributions in a preliminary trial, oriented to the given task. Then, in the second stage, the selected agents collaborate dynamically according to the query. Empirically, we demonstrate that DyLAN outperforms strong baselines in code generation, decision-making, general reasoning, and arithmetic reasoning tasks with moderate computational cost. On specific subjects in MMLU, selecting a team of agents in the team optimization stage improves accuracy by up to 25.0% in DyLAN.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes