arXiv:2506.11578cs.AI2025-06中稿 · TMLR 2026被引 3

小模型和大模型协作,用计划降低推理成本。

Efficient LLM Collaboration via Planning

  • 用规划器生成轻量级任务计划,指导执行模型逐步完成任务。
  • 在数学推理等任务上表现接近大模型,但推理成本大幅降低。
  • 适合资源有限却需高精度推理的场景,如本地部署或边缘计算。

大型语言模型(LLMs)在从简单到复杂任务中均表现出色,但其高昂的推理成本限制了频繁使用。相比之下,小型模型虽可免费部署且易于本地运行,但在复杂任务上的性能受限。为弥合这一矛盾,本文提出COPE——一种测试时协作框架。由规划器模型生成轻量级计划,作为中间引导,指导下游执行器模型完成任务。小模型与大模型交替充当规划器与执行器,在多阶段级联中协同解决任务。在涵盖数学推理、代码生成、开放式任务及智能体任务的多个基准测试中,实验表明COPE性能可媲美大型专有模型,同时显著降低推理API成本。结果凸显了规划作为高效推理先验的有效性。

原文摘要 · Abstract (English)

Recently, large language models (LLMs) have demonstrated strong performance, ranging from simple to complex tasks. However, while large models achieve remarkable results across diverse tasks, they often incur substantial monetary inference cost, making frequent use impractical for many applications. In contrast, small models are often freely available and easy to deploy locally, but their performance on complex tasks remains limited. This trade-off raises a natural question: how can small and large models efficiently collaborate to combine their complementary strengths? To bridge this trade-off, we propose COPE, a test-time collaboration framework. A planner model first generates a plan that serves as a lightweight intermediate that guides a downstream executor model. Small and large models take turns acting as planner and executor, exchanging plans in a multi-stage cascade to collaboratively solve tasks. Through comprehensive experiments on benchmarks spanning mathematical reasoning, code generation, open-ended tasks, and agent tasks, we demonstrate that COPE achieves performance comparable to large proprietary models, while drastically reducing the inference API cost. These results highlight planning as an effective prior for cost-efficient inference.

LLM协作推理优化计划生成

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。