arXiv:2510.14163cs.LGcs.AI2025-10被引 3

提出可逆模型融合方法,让压缩后的模型能恢复原任务性能。

Towards Reversible Model Merging For Low-rank Weights

  • 通过构建线性组合基底,实现低秩模型的可逆融合。
  • 在多个数据集和模型规模上显著优于现有方法。
  • 无需数据、高效灵活,适合需回溯原始模型的场景。

模型融合旨在将多个微调模型合并为一组权重,在所有源任务上表现良好。然而,以往方法忽视了模型被压缩为低秩表示(如LoRA或训练后SVD)的情形。本文首次表明,对低秩权重使用传统融合方法会导致性能严重下降。为此,我们提出一种新思路:不将所有适配器合并为单一权重,而是构建一个紧凑的基底,使原始任务特定模型可通过线性组合恢复。这将融合重新定义为生成可重建的模型空间,而非单一融合模型。关键在于,需要时可还原为任一原始模型,因为专用模型始终优于通用融合模型。基于此,我们提出可逆模型融合(RMM),一种高效、无数据、灵活的方法,提供权重基底与任务系数的闭式解。大量实验表明,RMM在多种数据集和模型规模下持续优于现有方法,显著保留低秩压缩模型的性能。

原文摘要 · Abstract (English)

Model merging aims to combine multiple fine-tuned models into a single set of weights that performs well across all source tasks. While prior work has shown that merging can approximate the performance of individual fine-tuned models for each task, it largely overlooks scenarios where models are compressed into low-rank representations, either through low-rank adaptation (LoRA) or post-training singular value decomposition (SVD). We first demonstrate that applying conventional merging methods to low-rank weights leads to severe performance degradation in the merged model. Motivated by this phenomenon, we propose a fundamentally different approach: instead of collapsing all adapters into one set of weights, we construct a compact basis (e.g., an equivalent of holding two or more models) from which original task-specific models can be recovered via linear combination. This reframes merging as generating a reconstruction-capable model space rather than producing a single merged model. Crucially, this allows us to ``revert'' to each individual model when needed, recognizing that no merged model can consistently outperform one specialized for its task. Building on this insight, we introduce our method, Reversible Model Merging (RMM), an efficient, data-free, and flexible method that provides a closed-form solution for selecting the optimal basis of model weights and task-specific coefficients for linear combination. Extensive experiments across diverse datasets and model scales demonstrate that RMM consistently outperforms existing merging approaches, preserving the performance of low-rank compressed models by a significant margin.

模型融合低秩压缩可逆学习

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