pith. sign in

Graph-of-Agents: A Graph-based Framework for Multi-Agent LLM Collaboration

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

With an ever-growing zoo of LLMs and benchmarks, the need to orchestrate multiple models for improved task performance has never been more pressing. While frameworks like Mixture-of-Agents (MoA) attempt to coordinate LLMs, they often fall short in terms of (1) selecting relevant agents, (2) facilitating effective intra-agent communication, and (3) integrating responses efficiently. In this work, we propose Graph-of-Agents (GoA), a new graph-based framework for modeling multi-agent LLM communication. Our approach begins with node sampling, selecting only the most relevant agents by leveraging model cards that summarize each model's domain, task specialization, and other characteristics. Next, we construct edges between the selected agents by evaluating their responses against one another to determine relevance ordering. Directed message passing is then performed from highly relevant agents to less relevant ones to enhance their responses, followed by reverse message passing to refine the original responses of the more relevant agents. Finally, the updated responses are aggregated via graph-based pooling (e.g., max or mean pooling) to produce a single, unified answer. We evaluate GoA on diverse multi-domain benchmarks (MMLU, MMLU-Pro, GPQA) and domain-specific benchmarks (MATH, HumanEval, MedMCQA), with an agent pool of 6 LLMs spanning multiple domains. Surprisingly, GoA achieves superior performance using only 3 selected agents, outperforming recent multi-agent LLM baselines that utilize all 6 agents simultaneously. By adopting a graph structure, GoA offers both scalability and effectiveness through structured message passing-positioning it as a strong candidate for navigating the challenges of the ever-growing LLM zoo. Code is available at: https://github.com/UNITES-Lab/GoA.

fields

cs.AI 1 cs.GT 1

years

2026 2

verdicts

UNVERDICTED 2

clear filters

representative citing papers

DarkForest: Less Talk, Higher Accuracy for Multi-Agent LLMs

cs.AI · 2026-05-24 · unverdicted · novelty 5.0

DarkForest improves multi-agent LLM reasoning via independent agents, semantic clustering of responses, and calibrated belief estimation with controlled communication, yielding up to 30.7% better benchmark metrics and 6.5x lower token consumption than heavy-communication baselines.

citing papers explorer

Showing 2 of 2 citing papers after filters.

  • From Talking Words to Sharing Thoughts: Scalable Multi-LLM Aggregation via Structured Message Passing cs.GT · 2026-05-29 · unverdicted · none · ref 5 · internal anchor

    A bipartite factor graph with message-passing protocol and asymmetric damping aggregates multi-LLM predictions, cutting token use by 97% and API calls by 6X while outperforming baselines on MMLU, MMLU-Pro, GPQA, and MedMCQA.

  • DarkForest: Less Talk, Higher Accuracy for Multi-Agent LLMs cs.AI · 2026-05-24 · unverdicted · none · ref 7 · internal anchor

    DarkForest improves multi-agent LLM reasoning via independent agents, semantic clustering of responses, and calibrated belief estimation with controlled communication, yielding up to 30.7% better benchmark metrics and 6.5x lower token consumption than heavy-communication baselines.