← 返回时间线

paper

CERA-MoA: Co-Evolving Routing Mechanisms with Continually Learning LLM Agents

arXiv ↗
ID
2609.18779
分类
—
首次捕获
2026-09-18
状态
unread
作者
Jiaxuan Jiang, Liyuan He, Zhixuan Fang
信号
🔥 8

信号历史

  • 2026-09-18HF Daily Papers · 🔥4
  • 2026-09-19HF Daily Papers · 🔥5
  • 2026-09-20HF Daily Papers · 🔥6
  • 2026-09-21HF Daily Papers · 🔥8
暂无信号数据

摘要

Current Mixture-of-Agents (MoA) paradigms generally treat query routing and agent fine-tuning as separate processes, limiting their ability to respond to evolving agent capabilities. This disconnect prevents routing strategies from adapting to evolving agent capabilities during post-training and prevents agents from achieving synergistic data-driven specialization. To resolve this, we introduce CERA-MoA (Co-Evolving Router with continually learning Agents for Mixture-of-Agents), an iterative reinforcement learning framework where the dynamic router and independent agent policies co-evolve. We design a predictive familiarity estimator that leverages mid-layer hidden states to evaluate semantic competence among agents, avoiding the overhead of full rollouts. Based on these familiarity scores, a cumulative-threshold adaptive routing mechanism dynamically activates a tailored minimal agent subset, achieving a trade-off between task performance and efficiency. By proactively allocating targeted training samples to agents based on their evolving competence, CERA-MoA promotes capability differentiation. Extensive experiments across various domains demonstrate that CERA-MoA outperforms state-of-the-art static-agent routing and fix-workflow fine-tuning baselines.

我的笔记

还没有笔记。

在 GitHub 上写笔记 ↗(新建 content/notes/2609.18779.md,PR 合并后本页自动更新)