让不同专家模型在隐空间协作,一次推理就实现更强的综合能力。
Mixture of Thoughts: Learning to Aggregate What Experts Think, Not Just What They Say
- 用轻量路由选专家,主专家在共享隐空间跨注意力融合同伴思想。
- 在5个内分布和3个外分布测试中,比现有方法平均提升2.92%。
- 无需多轮交互或模型融合,适合快速部署的多模型协同系统。
开源大语言模型正朝特定领域(如数学、代码、通用推理)专业化发展,推动了利用多个模型互补优势的系统设计。现有方法要么将查询分配给少数专家独立生成,要么通过高成本的多轮交互聚合输出,要么将权重融合为单一模型——通常要求架构一致。本文提出混合思想(Mixture of Thoughts, MoT),一种基于全局路由的异构专家间隐空间协作机制。对每个查询,轻量级路由器选择前K名专家并指定主专家;统一放置的交互层将隐藏状态投影至共享隐空间,主专家在此对活跃同伴执行交叉注意力。预训练专家保持冻结,仅训练路由器与轻量交互层,采用新联合训练目标同时优化专家选择与协作效果。在五个内分布(ID)和三个外分布(OOD)基准上,MoT分别优于当前路由与聚合类最优方法Avengers,提升0.38%和2.92%。此外,显著超越表现最佳的单模型。该方法实现单次推理,运行时接近路由基线,无迭代聚合开销。提供了一种实用的异构大模型协同方案。代码已公开于https://github.com/jacobfa/mot。
原文摘要 · Abstract (English)
Open-source Large Language Models (LLMs) increasingly specialize by domain (e.g., math, code, general reasoning), motivating systems that leverage complementary strengths across models. Prior multi-LLM approaches either (i) route a query to one or a few experts and generate independently, (ii) aggregate outputs from each model via costly multi-turn exchanges, or (iii) fuse weights into a single model-typically requiring architectural homogeneity. We introduce Mixture of Thoughts (MoT), a simple method for latent-level collaboration among heterogeneous experts under a global routing scheme. For each query, a lightweight router selects top-$K$ experts and designates a primary expert; uniformly placed interaction layers project hidden states into a shared latent space where the primary expert performs cross-attention over its active (selected) peers. Pre-trained experts remain frozen; only the router and the lightweight interaction layers are trained with a novel joint training objective that improves both the expert selection and inter-expert collaboration. Across five in-distribution (ID) and three out-of-distribution (OOD) benchmarks, MoT surpasses the current routing and aggregation-based state-of-the-art, Avengers, by $+0.38\%$ and $+2.92\%$, respectively. Further, MoT significantly outperforms the best-performing single model. It achieves this with single-pass inference, runtime comparable to routing baselines, and none of the overheads of iterative aggregation. MoT offers a simple latent-space mechanism for combining heterogeneous LLMs, a practical step toward broader multi-LLM collaboration. Our code is publicly available at https://github.com/jacobfa/mot.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。