arXiv:2503.22178cs.LGcs.AI2025-03被引 11

自适应选择关键特征方向,减少任务干扰,提升模型融合效果

AdaRank: Adaptive Rank Pruning for Enhanced Model Merging

  • 根据任务向量动态筛选关键奇异方向,避免人工设定秩
  • 测试时通过熵最小化学习最优剪枝策略,性能差距缩小至1%以内
  • 适用于多种骨干网络和任务数,显著降低跨任务干扰

模型融合已成为将独立微调模型统一为集成框架的有前景方法,显著提升多任务学习的计算效率。近期基于SVD的技术利用低秩结构增强融合效果,但依赖手动设计的秩选择常导致跨任务干扰和次优性能。本文提出AdaRank,一种自适应选择任务向量最优奇异方向的模型融合框架。实证表明,任务向量的主要奇异分量会引发关键干扰,而跨任务与层的简单截断会损害性能。相反,AdaRank在测试阶段动态剪除造成干扰的奇异成分,通过熵最小化学习剪枝秩,为每个任务向量提供最适量信息。分析显示该方法有效缓解任务间有害重叠,实验结果表明其在多种骨干网络与任务数量下均达到当前最优性能,使微调模型间的性能差距降至约1%。

原文摘要 · Abstract (English)

Model merging has emerged as a promising approach for unifying independently fine-tuned models into an integrated framework, significantly enhancing computational efficiency in multi-task learning. Recently, several SVD-based techniques have been introduced to exploit low-rank structures for enhanced merging, but their reliance on such manually designed rank selection often leads to cross-task interference and suboptimal performance. In this paper, we propose AdaRank, a novel model merging framework that adaptively selects the most beneficial singular directions of task vectors to merge multiple models. We empirically show that the dominant singular components of task vectors can cause critical interference with other tasks, and that naive truncation across tasks and layers degrades performance. In contrast, AdaRank dynamically prunes the singular components that cause interference and offers an optimal amount of information to each task vector by learning to prune ranks during test-time via entropy minimization. Our analysis demonstrates that such method mitigates detrimental overlaps among tasks, while empirical results show that AdaRank consistently achieves state-of-the-art performance with various backbones and number of tasks, reducing the performance gap between fine-tuned models to nearly 1%.

模型融合自适应剪枝SVD多任务学习

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