Skip to content
Preprint

Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning

Jul 2026 · 0 citations · 45 references
Computer Science

TL;DR

A hierarchical multi-agent system in which four lightweight learned gates jointly govern agent selection, hierarchy depth, inter-agent communication, and branch pruning, which remains competitive to existing frameworks on AIME-2025, where model depth dominates.

Abstract

Multi-agent ensembling multiplies active parameters and inference cost without answering three basic questions: which agents to consult, how deeply a query should traverse a hierarchy of agents, and when inter-agent communication is worth its cost. We present GRADE (Gated Routing and Adaptive Depth for Efficient Reasoning), a hierarchical multi-agent system in which four lightweight learned gates jointly govern agent selection, hierarchy depth, inter-agent communication, and branch pruning. Training uses CoGRPO (Collaborative Group-Relative Policy Optimization), a novel critic-free recipe that adapts GRPO to multi-agent hierarchies and assigns a shared advantage signal to every gate and agent that participated in a rollout. Agent models are drawn from a hot-swappable Expert Registry; per-agent calibration maps allow experts to be replaced at inference time without retraining. At $\sim$17B average active parameters, GRADE outperforms all baselines on GSM8K, MMLUPro, and GPQA, surpassing the strongest baseline by 4.8 points on MMLUPro at half the active compute. On AIME-2025, where model depth dominates, GRADE remains competitive to existing frameworks. Ablations isolate the hierarchy and masked cross-attention as the largest contributors to accuracy, and show that per-agent calibration is necessary for safe hot-swapping.

View source

Similar papers

Preprint Aug 2026

Shared Prefixes, Better Credit: Adaptive Routing for Multi-Agent Reasoning

TreeCredit is proposed, a shared-prefix credit assignment framework for efficient adaptive MAR that modestly improves accuracy while substantially reducing inference cost, achieving a better accuracy--cost trade-off than representative MAR methods.

Yi-Qing Liu, Zi-Hao Wang, Han-Tao Yao et al. · 2 citations
#artificial intelligence Preprint Aug 2026

Learning What to Retain: Gated-Memory Routing for Efficient Collaboration in Multi-Agent LLM Systems

Gated-Memory Routing is proposed, which conditions each decision on the query and a learned execution memory, and attains the best average accuracy, exceeding the strongest baseline by 2.44 points, while reducing HumanEval inference cost by 31.9% relative to that baseline.

Rakibul Hasan Rajib, Meng Zheng, Qian Lou · 2 citations
Conference Open access Jul 2026

AgentDropout: Dynamic Redundancy Elimination for Multi-Agent Collaboration Efficiency

AgentDropout is a dynamic strategy inspired by dropout regularization in neural networks, which selectively deactivates low-contribution agents during multi-agent collaboration, suggesting that dynamic agent deactivation may be useful for deploying multi-agent LLM systems under computational budget constraints.

Zhengxi Xiao, Qi Guo, Yuyue Wang et al. · 1 citation
Jul 2026

MANTA: Multi-Agent Network Topology Adaptation for Self-Evolving Multi-Agent Systems

MANTA, a framework for Multi-Agent Network Topology Adaptation that enables communication structures to self-evolve at inference time, is introduced and shows that inference-time self-improvement can extend to the architecture of collaboration itself.

Mao-Xun Huang, Jerry Wang, Yi-Cheng Lai et al. · 0 citations
Open access 2026

AgentSearch: Learning Efficient Agentic Workflows via Deliver Tree Search

This work introduces AgentSearch, a cost-aware Monte Carlo Tree Search (MCTS) framework that constructs agentic workflows through deliberative lookahead search and attains single-episode success while reducing computational costs by up to 47%, thereby eliminating the trial-and-error exploration required by previous ada...

D. Attota, Ying Xie · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.