Beyond Task Vectors: Selective Task Arithmetic Based on Importance Metrics
Not on the map. Why?
Abstract (arXiv)
Pretrained models have revolutionized deep learning by enabling significant performance improvements across a wide range of tasks, leveraging large-scale, pre-learned knowledge representations. However, deploying these models in real-world multi-task learning (MTL) scenarios poses substantial challenges, primarily due to high computational costs and inefficiencies in inference. Traditional approaches such as pruning, quantization, and knowledge distillation have been explored to mitigate these issues, but they often fall short in fully addressing the complexities of multi-task environments. This paper introduces textbfunderlineSelective textbfunderlineTask textbfunderlineArithmetic underline(STA), a training-free framework designed to enhance multi-task performance through task-specific parameter fusion. STA addresses three key challenges: (i) Parameter importance diversity: Recognizing that different tasks relie on distinct parameters, STA employs a loss-sensitive parameter importance metric derived from a first-order Taylor expansion to accurately measure the importance of parameters for each task. (ii) Over-reliance on hyperparameter tuning: By enhancing the sparsity of task vectors through parameter importance metrics, STA reduces the need for extensive hyperparameter tuning, thereby improving the generalization and robustness of the model. (iii) Neglect of other abilities in task arithmetic: Previous works have largely overlooked the potential for more precise task forgetting. STA leverages its parameter importance metric to achieve more controlled and effective task forgetting, minimizing the impact of noisy elements that can degrade model performance. Experimental results demonstrate that STA achieves superior multi-task performance across benchmarks and excellent performance in task forgetting.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 20 of its 27 references that are in the map. First posted on arXiv 25 Nov 2024.
Builds on
20 of 27 references.
References · 20
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2013Describing Textures in the Wildcited by 2,125
- 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
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2021Robust fine-tuning of zero-shot modelscited by 797
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
8 more
- 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 191
- 2024Parameter Competition Balancing for Model Mergingcited by 72
- 2024Convolution Meets LoRA: Parameter Efficient Finetuning for Segment Anything Modelcited by 69
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 64
- 2022ColD Fusion: Collaborative Descent for Distributed Multitask Finetuningcited by 52
- 2020A Gradient Flow Framework For Analyzing Network Pruningcited by 36
- 2023Seeking Neural Nuggets: Knowledge Transfer in Large Language Models from a Parametric Perspectivecited by 17
- 2023Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs "Difficult" Downstream Tasks in LLMscited by 13
Built on by
Citing papers per year: 2025: 8; 2026: 3.
11 papers.
- 2025Representation Engineering for Large-Language Models: Survey and Research Challengescited by 21
- 2025Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflictscited by 13
- 2025Model Merging Scaling Laws in Large Language Modelscited by 12
- 2025Scalable Model Merging with Progressive Layer-wise Distillationcited by 10
- 2025Layer-Aware Task Arithmetic: Disentangling Task-Specific and Instruction-Following Knowledgecited by 6
- 2025Optimal Brain Iterative Merging: Mitigating Interference in LLM Mergingcited by 2
- 2026AnyEdit++: Adaptive Long-Form Knowledge Editing via Bayesian Surprisecited by 2
- 2025You Only Train Once: A Flexible Training Framework for Code Vulnerability Detection Driven by Vul-Vectorcited by 0
- 2025Look the Other Way: Designing 'Positive' Molecules with Negative Data via Task Arithmeticcited by 0
- 2026Saliency-Aware Model Mergingcited by 0
- 2026CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocationcited by 0
- 2026CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation13 Aug 2026
- 2026AnyEdit++: Adaptive Long-Form Knowledge Editing via Bayesian Surprise31 May 2026
- 2026Saliency-Aware Model Merging30 May 2026
- 2025Model Merging Scaling Laws in Large Language Models29 Sep 2025
- 2025Look the Other Way: Designing 'Positive' Molecules with Negative Data via Task Arithmetic23 Jul 2025
- 2025You Only Train Once: A Flexible Training Framework for Code Vulnerability Detection Driven by Vul-Vector12 Mar 2025
- 2025Layer-Aware Task Arithmetic: Disentangling Task-Specific and Instruction-Following Knowledge27 Feb 2025
- 2025Representation Engineering for Large-Language Models: Survey and Research Challenges24 Feb 2025
- 2025Scalable Model Merging with Progressive Layer-wise Distillation18 Feb 2025
- 2025Optimal Brain Iterative Merging: Mitigating Interference in LLM Merging17 Feb 2025
- 2025Task Arithmetic in Trust Region: A Training-Free Model Merging Approach to Navigate Knowledge Conflicts25 Jan 2025
Similar, not cited
Close in wording, no citation either way
- 2025How Many Parameters Does Your Task Really Need? Task Specific Pruning with LLM-Sieve
- 2026Distilling Linearized Behavior into Non-Linear Fine-Tuning for Effective Task Arithmetic
- 2026Per-parameter Task Arithmetic for Unlearning in Large Language Models
- 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Models
- 2026DIPrune: Task-Aware Token Pruning with Dual Importance for Efficient Multimodal Language Models
- 2025You Had One Job: Per-Task Quantization Using LLMs' Hidden Representations
- 2025ThanoRA: Task Heterogeneity-Aware Multi-Task Low-Rank Adaptation
- 2025Injecting Imbalance Sensitivity for Multi-Task Learning