Year: 2024
Type: conference-paper
Abstract: Traditionally, developing new language models (LMs) capable of addressing multiple tasks involves fine-tuning pre-trained LMs using a wide collection of datasets, a process that often incurs significant computational expenses.Model merging emerges as a cost-effective alternative, allowing the integration of existing models fine-tuned on different tasks into a single model that performs well across all tasks, eliminating the need for additional training.In this paper, we propose RankMean, an algorithm for merging fine-tuned LMs without requiring any downstream data.RankMean determines merging coefficients based on the relative rankings of weight change magnitudes and applies these coefficients for module-wise integration of various fine-tuned models.Our experimental results demonstrate that RankMean outperforms existing baseline methods on multiple benchmarks.The code is available at github.com/VITA-Group/RankMean.
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
OpenAlex ID: W4402670690
