arXiv:2410.03777cs.CLcs.AI2024-10ICLR被引 30

提出Top-k联合策略,让大模型组合更高效精准

Determine-Then-Ensemble: Necessity of Top-k Union for Large Language Model Ensembling

  • 聚焦各模型前k个候选词的并集进行融合,避开全词汇对齐
  • 在多个基准上显著超越现有方法,性能提升明显
  • 适合需要高效模型集成的场景,尤其关注计算效率

大语言模型在不同任务中表现出不同的强弱项,促使研究探索模型集成以发挥其互补优势。然而,现有大模型集成方法常忽视模型兼容性,且在全词汇空间上对概率对齐效率低下。本研究通过实证分析发现,模型性能、词汇量大小和响应风格是影响集成效果的关键因素,揭示模型间兼容性对有效集成至关重要。基于此,我们提出一种简单有效的模型筛选策略,识别出兼容模型。同时,引入新的 extsc{Uni}on extsc{T}op-$k$ extsc{E}nsembling ( extsc{UniTE}) 方法,通过聚焦各模型输出的前k个词的并集进行融合,避免全词汇对齐,显著降低计算开销。在多个基准上的广泛评估表明, extsc{UniTE} 显著优于现有方法,为大模型集成提供了更高效的框架。

原文摘要 · Abstract (English)

Large language models (LLMs) exhibit varying strengths and weaknesses across different tasks, prompting recent studies to explore the benefits of ensembling models to leverage their complementary advantages. However, existing LLM ensembling methods often overlook model compatibility and struggle with inefficient alignment of probabilities across the entire vocabulary. In this study, we empirically investigate the factors influencing ensemble performance, identifying model performance, vocabulary size, and response style as key determinants, revealing that compatibility among models is essential for effective ensembling. This analysis leads to the development of a simple yet effective model selection strategy that identifies compatible models. Additionally, we introduce the \textsc{Uni}on \textsc{T}op-$k$ \textsc{E}nsembling (\textsc{UniTE}), a novel approach that efficiently combines models by focusing on the union of the top-k tokens from each model, thereby avoiding the need for full vocabulary alignment and reducing computational overhead. Extensive evaluations across multiple benchmarks demonstrate that \textsc{UniTE} significantly enhances performance compared to existing methods, offering a more efficient framework for LLM ensembling.

大模型集成Top-k融合高效推理

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