DyTopo: Dynamic Topology Routing for Multi-Agent Reasoning via Semantic Matching

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lu, Yuxing, Hu, Yucheng, Zhao, Xukai, Cao, Jiuxin
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912882096078848
author Lu, Yuxing
Hu, Yucheng
Zhao, Xukai
Cao, Jiuxin
author_facet Lu, Yuxing
Hu, Yucheng
Zhao, Xukai
Cao, Jiuxin
contents Multi-agent systems built from prompted large language models can improve multi-round reasoning, yet most existing pipelines rely on fixed, trajectory-wide communication patterns that are poorly matched to the stage-dependent needs of iterative problem solving. We introduce DyTopo, a manager-guided multi-agent framework that reconstructs a sparse directed communication graph at each round. Conditioned on the manager's round goal, each agent outputs lightweight natural-language query (need) and \key (offer) descriptors; DyTopo embeds these descriptors and performs semantic matching, routing private messages only along the induced edges. Across code generation and mathematical reasoning benchmarks and four LLM backbones, DyTopo consistently outperforms over the strongest baseline (avg. +6.2). Beyond accuracy, DyTopo yields an interpretable coordination trace via the evolving graphs, enabling qualitative inspection of how communication pathways reconfigure across rounds.
format Preprint
id arxiv_https___arxiv_org_abs_2602_06039
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle DyTopo: Dynamic Topology Routing for Multi-Agent Reasoning via Semantic Matching
Lu, Yuxing
Hu, Yucheng
Zhao, Xukai
Cao, Jiuxin
Artificial Intelligence
Multi-agent systems built from prompted large language models can improve multi-round reasoning, yet most existing pipelines rely on fixed, trajectory-wide communication patterns that are poorly matched to the stage-dependent needs of iterative problem solving. We introduce DyTopo, a manager-guided multi-agent framework that reconstructs a sparse directed communication graph at each round. Conditioned on the manager's round goal, each agent outputs lightweight natural-language query (need) and \key (offer) descriptors; DyTopo embeds these descriptors and performs semantic matching, routing private messages only along the induced edges. Across code generation and mathematical reasoning benchmarks and four LLM backbones, DyTopo consistently outperforms over the strongest baseline (avg. +6.2). Beyond accuracy, DyTopo yields an interpretable coordination trace via the evolving graphs, enabling qualitative inspection of how communication pathways reconfigure across rounds.
title DyTopo: Dynamic Topology Routing for Multi-Agent Reasoning via Semantic Matching
topic Artificial Intelligence
url https://arxiv.org/abs/2602.06039