mlsanityData to 14 Oct 2026

Purifying Task Vectors in Knowledge-Aware Subspace for Model Merging

arXiv 2510.14697 ↗First posted 16 Oct 2025cs.AIcited by 3

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

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2023GPT-4 Technical Reportcited by 18,396
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  6. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  7. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  8. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  9. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  10. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  11. 2021Program Synthesis with Large Language Modelscited by 3,637
  12. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
37 more
  1. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
  2. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
  3. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  4. 2022Editing Models with Task Arithmeticcited by 1,120
  5. 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 1,001
  6. 2018Neural Network Acceptability Judgmentscited by 958
  7. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
  8. 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 797
  9. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  10. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
  11. 2023WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instructcited by 625
  12. 2021Merging Models with Fisher-Weighted Averagingcited by 621
  13. 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
  14. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
  15. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
  16. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 269
  17. 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
  18. 2024OpenCodeInterpreter: Integrating Code Generation with Execution and Refinementcited by 247
  19. 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
  20. 2023LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Modelscited by 196
  21. 2022Language model compression with weighted low-rank factorizationcited by 195
  22. 2024SVDQuant: Absorbing Outliers by Low-Rank Components for 4-Bit Diffusion Modelscited by 170
  23. 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 169
  24. 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 147
  25. 2024Localizing Task Information for Improved Model Merging and Compressioncited by 131
  26. 2024Model merging with SVD to tie the Knotscited by 122
  27. 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 116
  28. 2024EMR-Merging: Tuning-Free High-Performance Model Mergingcited by 110
  29. 2024Representation Surgery for Multi-Task Model Mergingcited by 96
  30. 2024Parameter Competition Balancing for Model Mergingcited by 72
  31. 2025Whoever Started the Interference Should End It: Guiding Data-Free Model Merging via Task Vectorscited by 62
  32. 2023LM-Cocktail: Resilient Tuning of Language Models via Model Mergingcited by 44
  33. 2024CorDA: Context-Oriented Decomposition Adaptation of Large Language Models for Task-Aware Parameter-Efficient Fine-tuningcited by 44
  34. 2025Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descentcited by 39
  35. 2024Enabling High-Sparsity Foundational Llama Models with Efficient Pretraining and Deploymentcited by 15
  36. 2025Optimizing Singular Spectrum for Large Language Model Compressioncited by 4
  37. 2025Dynamic Context-oriented Decomposition for Task-aware Low-rank Adaptation with Less Forgetting and Faster Convergencecited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.