EvolveRouter: Co-Evolving Routing and Prompt for Multi-Agent Question Answering

• URL: http://arxiv.org/abs/2604.05149v1
• Date: Mon, 06 Apr 2026 20:24:54 GMT
• Title: EvolveRouter: Co-Evolving Routing and Prompt for Multi-Agent Question Answering
• Abstract summary: We propose a trainable framework that addresses limitations by jointly improving agent quality and collaboration structure.<n>Evolve consistently outperforms SOTA routing baselines in both F1 and exact match.
• Score: 39.31752433999864
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Large language model agents often exhibit complementary strengths, making routing a promising approach for multi-agent question answering. However, existing routing methods remain limited in two important ways: they typically optimize over a fixed pool of agents without improving the agents themselves, and they often rely on rigid collaboration schemes that cannot adapt the number of participating agents to the query. We propose EvolveRouter, a trainable framework that addresses both limitations by jointly improving agent quality and collaboration structure. First, EvolveRouter couples graph-based query routing with targeted instruction refinement in a closed-loop co-evolution process, allowing router diagnostics to guide agent improvement while refined agents provide cleaner supervision for routing. Second, it introduces an adaptive inference strategy that dynamically determines the effective collaboration size for each query through router-weighted answer agreement. Together, these designs enable more capable and more efficient multi-agent reasoning. Experiments on five question answering benchmarks show that EvolveRouter consistently outperforms SOTA routing baselines in both F1 and exact match, while further analysis confirms the benefits of closed-loop refinement and adaptive collaboration.

Related papers

• Rubric-Guided Process Reward for Stepwise Model Routing [18.58577344135632]
  Stepwise model routing improves the efficiency of Large Reasoning Models (LRMs) by assigning each reasoning step to a suitable model.<n>Recent methods formulate routing as a sequential decision process and train the router with reinforcement learning.<n>We propose RoRo, a rubric-guided process reward framework for stepwise model routing.
  arXiv  Detail & Related papers  (2026-05-28T03:42:24Z)
• AgentGate: A Lightweight Structured Routing Engine for the Internet of Agents [25.130481441368207]
  We present AgentGate, a lightweight structured routing engine for candidate-aware agent dispatch.<n>Instead of treating routing as unrestricted text generation, AgentGate decomposes it into two stages: action decision and structural grounding.<n>Experiments show that compact models can provide competitive routing performance in constrained settings.
  arXiv  Detail & Related papers  (2026-04-08T05:22:16Z)
• Efficient and Interpretable Multi-Agent LLM Routing via Ant Colony Optimization [58.59491516762626]
  We propose AMRO-S, an efficient and interpretable routing framework for Multi-Agent Systems (MAS)<n>AMRO-S models MAS routing as a semantic-conditioned path selection problem, enhancing routing performance through three key mechanisms.<n>Extensive experiments on five public benchmarks and high-concurrency stress tests demonstrate that AMRO-S consistently improves the quality--cost trade-off over strong routing baselines.
  arXiv  Detail & Related papers  (2026-03-13T12:26:05Z)
• TCAndon-Router: Adaptive Reasoning Router for Multi-Agent Collaboration [0.9564467981235256]
  Multi-Agent Systems (MAS) have become a powerful paradigm for building high performance intelligent applications.<n>Within these systems, the router responsible for determining which expert agents should handle a given query plays a crucial role in overall performance.<n>To address these challenges, we propose TCAndon-TCAR: an adaptive reasoning router for multi-agent collaboration.<n>Experiments on public datasets and real enterprise data demonstrate that TCAR significantly improves routing accuracy, reduces routing conflicts, and remains robust in ambiguous scenarios.
  arXiv  Detail & Related papers  (2026-01-08T03:17:33Z)
• AgentRouter: A Knowledge-Graph-Guided LLM Router for Collaborative Multi-Agent Question Answering [51.07491603393163]
  tAgent is a framework that formulates multi-agent QA as a knowledge-graph-guided routing problem supervised by empirical performance signals.<n>By leveraging soft supervision and weighted aggregation of agent outputs, Agent learns principled collaboration schemes that capture the complementary strengths of diverse agents.
  arXiv  Detail & Related papers  (2025-10-06T23:20:49Z)
• RCR-Router: Efficient Role-Aware Context Routing for Multi-Agent LLM Systems with Structured Memory [57.449129198822476]
  RCR is a role-aware context routing framework for multi-agent large language model (LLM) systems.<n>It dynamically selects semantically relevant memory subsets for each agent based on its role and task stage.<n>A lightweight scoring policy guides memory selection, and agent outputs are integrated into a shared memory store.
  arXiv  Detail & Related papers  (2025-08-06T21:59:34Z)
• AnyMAC: Cascading Flexible Multi-Agent Collaboration via Next-Agent Prediction [77.62279834617475]
  We propose a new framework that rethinks multi-agent coordination through a sequential structure rather than a graph structure.<n>Our method focuses on two key directions: (1) Next-Agent Prediction, which selects the most suitable agent role at each step, and (2) Next-Context Selection, which enables each agent to selectively access relevant information from any previous step.
  arXiv  Detail & Related papers  (2025-06-21T18:34:43Z)
• Talk to Right Specialists: Routing and Planning in Multi-agent System for Question Answering [47.29580414645626]
  RopMura is a novel multi-agent system that integrates multiple knowledge bases into a unified RAG-based agent.<n>RopMura features two key components: a router that intelligently selects the most relevant agents based on knowledge boundaries and a planner that decomposes complex multi-hop queries into manageable steps.
  arXiv  Detail & Related papers  (2025-01-14T03:25:26Z)
• PARCO: Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization [25.209951743372855]
  PARCO is a reinforcement learning framework designed to construct high-quality solutions for multi-agent tasks efficiently.<n>We evaluate PARCO in multi-agent vehicle routing and scheduling problems, where our approach outperforms state-of-the-art learning methods.
  arXiv  Detail & Related papers  (2024-09-05T17:49:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.