让多个小模型协作答题,比单个大模型更准更快
Token-Level LLM Collaboration via FusionRoute
- 用轻量路由器在每一步选最合适的模型,并加修正项优化输出
- 在数学推理、代码生成等任务上超越单一模型和现有协作方法
- 适合资源有限但需多领域强性能的场景,如边缘设备部署
大型语言模型在不同领域各有优势,但要通用则需巨大规模,训练部署成本过高。而小型专用模型虽高效,却难以泛化。为此提出FusionRoute,一种轻量级的分词级多模型协作框架:在每步解码时,由轻量路由器同时选择最合适专家,并通过可训练的互补生成器添加修正项,优化专家的下一个词分布。不同于仅依赖固定专家输出的方法,理论分析表明纯专家路由在缺乏全局覆盖假设时无法实现最优策略。FusionRoute通过引入可训练的互补机制,扩展了有效策略空间,在温和条件下可恢复最优价值函数。实证显示,在Llama-3与Gemma-2系列模型及涵盖数学推理、代码生成、指令遵循等多任务基准上,FusionRoute优于序列级与分词级协作、模型融合和微调方法,且在各自领域任务上表现接近专业模型。
原文摘要 · Abstract (English)
Large language models (LLMs) exhibit strengths across diverse domains. However, achieving strong performance across these domains with a single general-purpose model typically requires scaling to sizes that are prohibitively expensive to train and deploy. On the other hand, while smaller domain-specialized models are much more efficient, they struggle to generalize beyond their training distributions. To address this dilemma, we propose FusionRoute, a robust and effective token-level multi-LLM collaboration framework in which a lightweight router simultaneously (i) selects the most suitable expert at each decoding step and (ii) contributes a complementary logit that refines or corrects the selected expert's next-token distribution via logit addition. Unlike existing token-level collaboration methods that rely solely on fixed expert outputs, we provide a theoretical analysis showing that pure expert-only routing is fundamentally limited: unless strong global coverage assumptions hold, it cannot in general realize the optimal decoding policy. By augmenting expert selection with a trainable complementary generator, FusionRoute expands the effective policy class and enables recovery of optimal value functions under mild conditions. Empirically, across both Llama-3 and Gemma-2 families and diverse benchmarks spanning mathematical reasoning, code generation, and instruction following, FusionRoute outperforms both sequence- and token-level collaboration, model merging, and direct fine-tuning, while remaining competitive with domain experts on their respective tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。