DeAR: Decentralized Agentic Reasoning via Capability Grounding and Collaborative Thought Navigation
Authors: Xing Wei, Changmeng Zheng, XiaoYong Wei, Xiufen Ye, Qing Li
Organizations: College of Intelligent Systems Science and Engineering, Harbin Engineering University · Department of Computing, The Hong Kong Polytechnic University
Existing agentic reasoning systems typically rely on centralized protocols. This design introduces routing bottlenecks and static role allocations that often fail when handling complex multimodal queries. We propose DeAR (Decentralized Agentic Reasoning), a framework that shifts from central control to autonomous peer-to-peer collaboration. DeAR is built on three mechanisms: (1) decentralized capability grounding for query-dependent agent specialization, (2) thought map navigation for targeted peer interactions, and (3) topology update for adaptive error correction. Evaluations across 9 diverse multimodal reasoning and text-based QA benchmarks indicate that DeAR consistently outperforms recent baseline methods, validating that decentralized and adaptive collaboration among agents enhances accuracy in knowledge-intensive reasoning tasks. The source code will be available at https://open_upon_acceptance.
Figures & tables
Figure 1: Framework comparison on a multimodal query ("How many people in the image were born after World War II?"). (a) Single agent fails due to restricted knowledge domains. (b) Centralized framework fails as the judge bottleneck propagates incorrect inputs. (c) DeAR (Ours) succeeds by grounding capabilities and navigating an adaptive thought map to collaboratively verify facts and yield the correct answer.
Figure 2: An overview of the De centralized A gentic R easoning framework.
Figure 3: Thought Map Navigation Construction among Agents
Method
MMMU
MathVista
ChartQA
ScienceQA
FQA
GPS
MWP
TQA
VQA
ALL
NAT
SOC
LAN
ALL
Baseline Models (Single Agent)
LLaMA-2-13B ( Liu et al. 2023 )
-
26.8
29.3
16.1
32.3
26.3
26.10
-
44.1
41.2
43.9
43.08
InternVL2.5-26B ( Chen et al. 2024b )
51.80
38.0
35.0
30.0
40.0
37.0
36.03
-
-
-
-
-
MiniCPM-V-2.6 ( Yao et al. 2024 )
45.11
51.7
27.4
39.8
42.5
34.7
39.89
-
59.5
57.0
59.6
58.70
Qwen2-VL-72B ( Wang et al. 2024a )
46.21
55.9
34.7
29.7
58.8
42.4
41.34
88.30
-
-
-
-
Table 1: Zero-shot evaluation on four multimodal benchmarks (fine-grained metrics reported for MathVista and ScienceQA). ’-’ denotes unreported data. Agent counts: Cache-of-Thought (2); MUG, C2R (3); MAD-Vote, Corvid, Insight-V, AutoGen, AgentVerse, DyLAN, ReConcile, and DeAR (4). Best results in bold .
Method
NQ
TriviaQA
PopQA
2Wiki
HotpotQA
EM
Δ EM
F1
Δ F1
EM
Δ EM
F1
Δ F1
EM
Δ EM
F1
Δ F1
EM
Δ EM
F1
Δ F1
EM
Δ EM
F1
Δ F1
Single Agent Framework
Vanilla Gen
17.40
+29.79
26.27
+27.86
56.60
+4.87
65.50
+7.54
19.20
+20.54
23.33
+23.87
8.60
+42.53
16.50
+44.74
16.80
+31.51
23.88
+29.86
Multi-Agent Frameworks
MAD ( Du et al. 2023 ) (ICML 2024)
21.80
+25.39
33.11
+21.02
56.40
+5.07
66.39
+6.65
21.40
+18.34
28.28
+18.92
18.20
+32.93
25.13
+36.11
23.00
+25.31
32.79
+20.95
IRCoT ( Trivedi et al. 2023 ) (ACL 2023)
28.60
+18.59
37.36
+16.77
47.20
+14.27
54.56
+18.48
27.00
+12.74
33.02
+14.18
32.80
+18.33
31.19
+30.05
25.20
+23.11
34.40
+19.34
Table 2: Overall evaluation results of the proposed DeAR framework and other baselines on five text-only QA benchmarks. Δ EM and Δ F1 denote the performance gap between DeAR and each baseline ( Δ=DeAR score−baseline score ). Darker gray cells mark the best performance, and lighter gray cells mark the second-best performance among all methods.
Figure 4: Analysis of the topology update’s decay factor α .
Figure 5: Case Study of the Reasoning with Centralized and Decentralized Multi-Agent Collaboration on Q&A.
Number of Agents Activated
Frequency (%)
1 Agent
14.3
2 Agents
21.8
3 Agents
26.4
4 Agents
37.5
Table 3: Frequency of activation for varying numbers of agents on the MathVista dataset.
Large reasoning models improve performance by generating extended chain-of-thought (CoT) reasoning, but this behavior becomes inefficient when applied to LLM agents. Current LLM agents often generate verbose textual reasoning at every decision step and allocate reasoning effort nearly uniformly across turns, leading to substantial inefficiency in multi-turn agentic trajectories. We propose Adaptive Latent Agentic Reasoning (ALAR), a dual-mode framework that uses compact latent reasoning for routine turns and selectively escalates to explicit chain-of-thought when deeper deliberation is needed. ALAR learns latent reasoning by using the agent's actions as supervision anchors and is further optimized to use latent reasoning when it is sufficient for task success and reserve explicit CoT for harder decisions. Experiments on agentic search and tool-use benchmarks show that ALAR maintains comparable or better task accuracy while substantially reducing generated tokens by up to 43.6% in search and 84.6% in tool use. These results demonstrate that ALAR improves the accuracy-efficiency trade-off of LLM agents by reducing unnecessary textual reasoning while preserving explicit deliberation for harder decision steps.
Dongwon Jung, Peng Shi, Yi Zhang +2
University of California, Davis · University of Waterloo · Greenshoe, Inc.
Multi-agent debate (MAD) systems leverage collective intelligence to enhance reasoning capabilities, yet existing approaches struggle to simultaneously optimize accuracy, consensus formation, and computational efficiency. Static topology methods lack adaptability to task complexity variations, while external LLM-based coordination risks introducing privileged knowledge that compromises debate neutrality. This work presents RUMAD (Reinforcement-Unifying Multi-Agent Debate), a novel framework that formulates dynamic communication topology control in MAD as a reinforcement learning (RL) problem. RUMAD employs a content-agnostic observation scheme that captures high-level debate dynamics avoiding access to raw agent reasoning content. RUMAD uses a multi-objective reward to model solution quality, cohesion and efficiency. A PPO-trained controller dynamically adjusts edge weights in the communication graph, while a dual-threshold mechanism enables fine-grained control over both agent activation and information visibility. Experimental evaluation across MMLU, GSM8K, and GPQA benchmarks demonstrates that RUMAD achieves substantial efficiency gains, reducing token costs by over 80%, while still improving reasoning accuracy compared to single LLM model and multiple MAD baselines. Notably, RUMAD trained exclusively on MMLU exhibits robust zero-shot generalization to out-of-domain (OOD) tasks, indicating that the learned communication strategies capture task-independent principles of effective multi-agent coordination. These results establish RUMAD as a efficient and robust approach for deploying multi-agent reasoning application with practical resource constraints.
Chao Wang, Han Lin, Huaze Tang +2
Tsinghua University, Shenzhen, China · Zhejiang University, Hangzhou, China
Complex question answering across text, tables and images requires integrating diverse information sources. A framework supporting specialized processing with coordination and interpretability is needed. We introduce DeALOG, a decentralized multi-agent framework for multimodal question answering. It uses specialized agents: Table, Context, Visual, Summarizing and Verification, that communicate through a shared natural-language log as persistent memory. This log-based approach enables collaborative error detection and verification without central control, improving robustness. Evaluations on FinQA, TAT-QA, CRT-QA, WikiTableQuestions, FeTaQA, and MultiModalQA show competitive performance. Analysis confirms the importance of the shared log, agent specialization, and verification for accuracy. DeALOG, provides a scalable approach through modular components using natural-language communication.