论文

Routed Continual Learning:用 LLM 路由器解决智能体经验复用难题

Routed Continual Learning

精选理由

arXiv 上这篇论文把智能体持续学习变成路由问题,实测比全局历史省 65-72% 成本,做 Agent 记忆设计可以看看。

论文提出 Routed Continual Learning(Routed CL)架构,把智能体过往轨迹按问题聚类,每个簇从固定的记忆系统库中选一种来维护状态,并由 LLM 路由器在每次运行前决定复用还是新建簇。评测使用 6 个 CL-Bench 任务的 301 个实例与 τ³-Bench 的 97 个银行类实例交错构成的数据流。在 4 个语言模型、5 组匹配 rollout 的测试中,Routed CL 相比单一全局 ICL 历史将归一化奖励提升 15-30%,API 成本降低 65-72%。论文还引入 Context Memory Adapter 来衔接记忆系统与智能体循环。

原文 · arXiv cs.LG

Routed Continual Learning

Agents deployed at scale repeatedly encounter related problems, and it is natural to let them learn from each other's experience rather than starting over each time. Unfortunately, there is no single way to retain that experience that works well across settings, and no way to know in advance which future problems a given experience will help with. A global history preserves every detail but becomes expensive and mixes together experience that may not belong together; compressing that history into one fixed representation limits the cost but can throw away valuable details. We introduce Routed Continual Learning (Routed CL), an architecture that decides how to partition and retain experience. Past trajectories are grouped into clusters, each of which maintains state using one memory system from a fixed library. Before each run, an LLM-based router either reuses an existing cluster or creates a new one, basing its decision on the problem statement, memory system descriptions, and cluster summaries. We also introduce Context Memory Adapter, which mediates between the memory system and the agentic loop. We evaluate the architecture on a heterogeneous stream that interleaves 301 instances from the six CL-Bench tasks with 97 banking instances from $τ^3$-Bench. Across four language models and five matched rollouts, Routed Continual Learning raises normalized reward over a single global in-context learning (ICL) history by 15-30% of the maximum attainable normalized reward, achieves higher mean normalized reward than ICL-only clustering, and reduces estimated API cost by 65-72% relative to Global ICL. These results support approaching continual learning as a routing problem that chooses both a learning mechanism and a state cluster rather than committing to one representation globally.