cs.LGNov 3, 2026

Separating Common and Unique Directions for Model Merging

Authors: Shiting Wang, Yingjie Zou, Ke Li

Organizations: Earlham Institute, United Kingdom · Living Systems Institute, University of Exeter, United Kingdom · Department of Computer Science, University of Exeter, United Kingdom · Department of Engineering, University of Exeter, United Kingdom · 

Abstract

Model merging combines multiple fine-tuned models without additional training, and arithmetic methods have emerged as a simple yet effective way to merge models without data. However, existing arithmetic methods treat task vectors in parameter space and apply a single element-wise rule to directions that can differ in mergeability. In a shared directional basis, we find a consistent two-regime structure: a low-dispersion common bulk shared across tasks and a high-dispersion task-dominated tail that carries disproportionate energy. These findings motivate Common--Unique Subspace Decomposition (CUSD), a data-free pre-merging method that separates task vectors into common and unique directional components, merges the common components with a downstream arithmetic operator, and retains unique residuals separately. Experiments across 1111 base models, four model families, and four arithmetic-based merging operators show that CUSD improves 42 of 44 model--operator combinations and achieves up to 22.5% improvement over the corresponding baselines. Our code is publicly available at https://github.com/stwang666/CUSD

Figures & tables

Appendix figures & tables19 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Merge++: Universal Merge Refinement Through Data-Free Checkpoint Inversion

    Sep 19, 2026Aditya Pola, Vineeth N. BalasubramanianModel Merging

  2. A Broader Look at Model Merging: Rethinking Implicit Regularization Induced by Task Arithmetic

    Oct 6, 2026Sin-Han Yang, Shih-Cheng Huang, Chieh-Yen Lin +3Task Vector MergingMulti-Task Optimization

  3. Model Merging: Foundations and Algorithms

    May 2, 2026Donato CrisostomiMulti-Task LearningTask Vector Merging