Leveraging Submodule Linearity Enhances Task Arithmetic Performance in LLMs
Not on the map. Why?
Abstract (arXiv)
Task arithmetic is a straightforward yet highly effective strategy for model merging, enabling the resultant model to exhibit multi-task capabilities. Recent research indicates that models demonstrating linearity enhance the performance of task arithmetic. In contrast to existing methods that rely on the global linearization of the model, we argue that this linearity already exists within the model's submodules. In particular, we present a statistical analysis and show that submodules (e.g., layers, self-attentions, and MLPs) exhibit significantly higher linearity than the overall model. Based on these findings, we propose an innovative model merging strategy that independently merges these submodules. Especially, we derive a closed-form solution for optimal merging weights grounded in the linear properties of these submodules. Experimental results demonstrate that our method consistently outperforms the standard task arithmetic approach and other established baselines across different model scales and various tasks. This result highlights the benefits of leveraging the linearity of submodules and provides a new perspective for exploring solutions for effective and practical multi-task model merging.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 40 of its 46 references that are in the map. First posted on arXiv 15 Apr 2025.
Builds on
40 of 46 references.
References · 40
- 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
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,165
- 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
- 2018On Lazy Training in Differentiable Programmingcited by 675
28 more
- 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
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
- 2019Cosmos QA: Machine Reading Comprehension with Contextual Commonsense Reasoningcited by 285
- 2023Physics of Language Models: Part 3.1, Knowledge Storage and Extractioncited by 270
- 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 254
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
- 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Modelscited by 221
- 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 191
- 2022Patching open-vocabulary models by interpolating weightscited by 190
- 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 179
- 2023Composing Parameter-Efficient Modules with Arithmetic Operationscited by 156
- 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
- 2024Knowledge Fusion of Large Language Modelscited by 115
- 2024Branch-Train-MiX: Mixing Expert LLMs into a Mixture-of-Experts LLMcited by 109
- 2022Model Ratatouille: Recycling Diverse Models for Out-of-Distribution Generalizationcited by 97
- 2023A Paradigm Shift in Machine Translation: Boosting Translation Performance of Large Language Modelscited by 89
- 2024Merging Multi-Task Models via Weight-Ensembling Mixture of Expertscited by 85
- 2019Reasoning Over Paragraph Effects in Situationscited by 79
- 2023Model Merging by Uncertainty-Based Gradient Matchingcited by 77
- 2023Parameter Efficient Multi-task Model Fusion with Partial Linearizationcited by 65
- 2024From Yes-Men to Truth-Tellers: Addressing Sycophancy in Large Language Models with Pinpoint Tuningcited by 54
- 2024LoRA Soups: Merging LoRAs for Practical Skill Composition Taskscited by 52
- 2024Interpreting and Improving Large Language Models in Arithmetic Calculationcited by 45
- 2024Training-Free Pretrained Model Mergingcited by 32
- 2024On the Emergence of Cross-Task Linearity in the Pretraining-Finetuning Paradigmcited by 26
- 2023Tangent Transformers for Composition, Privacy and Removalcited by 13
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Layer-wise Swapping for Generalizable Multilingual Safetycited by 2
- 2026M-Loss: Quantifying Model Merging Compatibility with Limited Unlabeled Datacited by 2
- 2026When Model Merging Breaks Routing: Training-Free Calibration for MoEcited by 1
- 2026Exploring Information Seeking Agent Consolidationcited by 0
- 2026When Model Merging Breaks Routing: Training-Free Calibration for MoE2 Jun 2026
- 2026M-Loss: Quantifying Model Merging Compatibility with Limited Unlabeled Data9 Feb 2026
- 2026Exploring Information Seeking Agent Consolidation31 Jan 2026
- 2026Layer-wise Swapping for Generalizable Multilingual Safety30 Jan 2026