Purifying Task Vectors in Knowledge-Aware Subspace for Model Merging
Not on the map. Why?
Abstract (arXiv)
Model merging aims to integrate task-specific abilities from individually fine-tuned models into a single model without extra training. In recent model merging methods, task vector has become a fundamental building block, as it can encapsulate the residual information from finetuning. However, the merged model often suffers from notable performance degradation due to the conflicts caused by task-irrelevant redundancy in task vectors. Existing efforts in overcoming redundancy by randomly dropping elements in the parameter space involves randomness and lacks knowledge awareness. To address these challenges, in this study, we propose Purifying TAsk Vectors (PAVE) in knowledge-aware subspace. Concretely, we sample some training examples from each task, and feed them into their corresponding fine-tuned models to acquire the covariance matrices before linear layers. We then perform a context-oriented singular value decomposition, which accentuates the weight components most relevant to the target knowledge. As a result, we can split fine-tuned model weights into task-relevant and redundant components in the knowledge-aware subspace, and purify the task vector by pruning the redundant components. To induce fair pruning efforts across models, we further introduce a spectral rank allocation strategy by optimizing a normalized activated pruning error. The task vector purification by our method as a plug-and-play scheme is applicable across various task vector-based merging methods to improve their performance. In experiments, we demonstrate the effectiveness of PAVE across a diverse set of merging methods, tasks, and model architectures.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 49 of its 67 references that are in the map. First posted on arXiv 16 Oct 2025.
Builds on
49 of 67 references.
References · 49
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2023GPT-4 Technical Reportcited by 18,396
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2021Program Synthesis with Large Language Modelscited by 3,637
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
37 more
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 1,001
- 2018Neural Network Acceptability Judgmentscited by 958
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 797
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
- 2023WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instructcited by 625
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
- 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 269
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
- 2024OpenCodeInterpreter: Integrating Code Generation with Execution and Refinementcited by 247
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
- 2023LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Modelscited by 196
- 2022Language model compression with weighted low-rank factorizationcited by 195
- 2024SVDQuant: Absorbing Outliers by Low-Rank Components for 4-Bit Diffusion Modelscited by 170
- 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 169
- 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 147
- 2024Localizing Task Information for Improved Model Merging and Compressioncited by 131
- 2024Model merging with SVD to tie the Knotscited by 122
- 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 116
- 2024EMR-Merging: Tuning-Free High-Performance Model Mergingcited by 110
- 2024Representation Surgery for Multi-Task Model Mergingcited by 96
- 2024Parameter Competition Balancing for Model Mergingcited by 72
- 2025Whoever Started the Interference Should End It: Guiding Data-Free Model Merging via Task Vectorscited by 62
- 2023LM-Cocktail: Resilient Tuning of Language Models via Model Mergingcited by 44
- 2024CorDA: Context-Oriented Decomposition Adaptation of Large Language Models for Task-Aware Parameter-Efficient Fine-tuningcited by 44
- 2025Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descentcited by 39
- 2024Enabling High-Sparsity Foundational Llama Models with Efficient Pretraining and Deploymentcited by 15
- 2025Optimizing Singular Spectrum for Large Language Model Compressioncited by 4
- 2025Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergencecited by 4
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Plato's Form: Toward Backdoor Defense-as-a-Service for LLMs with Prototype Representationscited by 0
- 2026Not All Task Vectors Need Equal Rank: Energy-Proportional Allocation for Model Mergingcited by 0
- 2026Beyond Uniform Subspaces: Spectrum-Aware and Depth-Adaptive Fusion for Multi-Task Model Mergingcited by 0
- 2026Beyond Uniform Subspaces: Spectrum-Aware and Depth-Adaptive Fusion for Multi-Task Model Merging21 Sep 2026
- 2026Not All Task Vectors Need Equal Rank: Energy-Proportional Allocation for Model Merging21 Sep 2026
- 2026Plato's Form: Toward Backdoor Defense-as-a-Service for LLMs with Prototype Representations6 Feb 2026