Stay Unique, Stay Efficient: Preserving Model Personality in Multi-Task Merging
Not on the map. Why?
Abstract (arXiv)
Model merging has emerged as a promising paradigm for enabling multi-task capabilities without additional training. However, traditional basic merging methods often experience performance degradation due to parameter conflicts, even when applied to similar tasks. While recent personalized merging frameworks successfully preserve task-specific information to maintain performance, they typically incur storage overhead. In this paper, we propose Decomposition, Thresholding, and Scaling (DTS), an approximation-based personalized merging framework that pushes task-specific storage efficiency. DTS first applies singular value decomposition to the task-specific information and retains only a small subset of singular values and vectors. It then introduces a novel thresholding strategy that partitions singular vector elements into groups and assigns a scaling factor to each group. To enable generalization to unseen tasks, we further extend DTS with a variant that fuses task-specific information in a data-free manner based on the semantic similarity of task characteristics. Extensive experiments demonstrate that DTS consistently outperforms state-of-the-art baselines while requiring only 1% extra storage per task. Furthermore, experiments on unseen tasks show that the DTS variant achieves significantly better generalization performance. Our code is available at https://github.com/krumpguo/DTS.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 60 of its 81 references that are in the map. First posted on arXiv 1 Dec 2025.
Builds on
60 of 81 references.
References · 60
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2023Qwen Technical Reportcited by 3,273
- 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 2013Describing Textures in the Wildcited by 2,110
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,488
38 more
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2022Editing Models with Task Arithmeticcited by 1,076
- 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 998
- 2018Neural Network Acceptability Judgmentscited by 952
- 2017A Survey on Multi-Task Learningcited by 838
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 791
- 2021BBQ: A Hand-Built Bias Benchmark for Question Answeringcited by 683
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
- 2021Merging Models with Fisher-Weighted Averagingcited by 613
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
- 2020Fine-Tuning Pretrained Language Models: Weight Initializations, Data Orders, and Early Stoppingcited by 377
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 248
- 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 143
- 2024Localizing Task Information for Improved Model Merging and Compressioncited by 130
- 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 119
- 2024Model merging with SVD to tie the Knotscited by 118
- 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 114
- 2024EMR-Merging: Tuning-Free High-Performance Model Mergingcited by 108
- 2025No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspacescited by 90
- 2023Soft Merging of Experts with Adaptive Routingcited by 88
- 2024Merging Multi-Task Models via Weight-Ensembling Mixture of Expertscited by 85
- 2024Merging LoRAs like Playing LEGO: Pushing the Modularity of LoRA to Extremes Through Rank-Wise Clusteringcited by 58
- 2024MetaGPT: Merging Large Language Models Using Model Exclusive Task Arithmeticcited by 53
- 2024AIM: Adaptive Inference of Multi-Modal LLMs via Token Merging and Pruningcited by 43
- 2024Gradient Reweighting: Towards Imbalanced Class-Incremental Learningcited by 37
- 2025Model Merging in Pre-training of Large Language Modelscited by 36
- 2025Multi-Granular Spatio-Temporal Token Merging for Training-Free Acceleration of Video LLMscited by 30
- 2025Accurate and Efficient Low-Rank Model Merging in Core Spacecited by 28
- 2025RobustMerge: Parameter-Efficient Model Merging for MLLMs with Direction Robustnesscited by 25
- 2025Mix Data or Merge Models? Balancing the Helpfulness, Honesty, and Harmlessness of Large Language Model via Model Mergingcited by 23
- 2025CAT Merging: A Training-Free Approach for Resolving Conflicts in Model Mergingcited by 22
- 2024MAP: Low-compute Model Merging with Amortized Pareto Fronts via Quadratic Approximationcited by 20
- 2024Importance-Based Token Merging for Efficient Image and Video Generationcited by 20
- 2024DaWin: Training-free Dynamic Weight Interpolation for Robust Adaptationcited by 19
- 2023Merging Vision Transformers from Different Tasks and Domainscited by 17
- 2025Mitigating Parameter Interference in Model Merging via Sharpness-Aware Fine-Tuningcited by 16
50 most cited of 60 All 60 (JSON)
Built on by
Citing papers per year: 2026: 2.
2 papers.