Skip to content
Preprint

Escaping Low-Dimensional Overlap: Multi-Task Model Merging via High-Dimensional Sparse Disentanglement

Aug 2026 · 0 citations · 37 references
Computer Science

TL;DR

A sparse-representation-based merging framework that uses Sparse Autoencoders (SAEs) to project task vectors into a high-dimensional sparse feature space, enabling feature-level disentanglement before fusion is proposed.

Abstract

Model merging provides an efficient way to construct multi-task generalist models without additional training, but its performance often degrades under severe task interference. Task interference in model merging primarily stems from \textit{superposition}, where task-specific features become entangled within the parameter space. This entanglement renders conventional decomposition methods insufficient for effectively isolating useful task directions from interfering components. In this paper, we propose a sparse-representation-based merging framework that uses Sparse Autoencoders (SAEs) to project task vectors into a high-dimensional sparse feature space, enabling feature-level disentanglement before fusion. To reduce computational overhead, we further introduce a lightweight Group-Ranked Zeroth-Order Optimizer (GR-ZOO) to identify task-critical layers for selective merging. Experiments on both Qwen2.5-1.5B and Qwen2.5-7B demonstrate that our method consistently outperforms representative baselines, including Task Arithmetic, TIES-Merge, DARE, Fisher-Merge,and several recent training-free merging methods, across mathematical reasoning, code generation, instruction following, and general knowledge tasks. In a highly conflicting four-task setting on Qwen2.5-1.5B, our method further achieves a 2.78\% improvement over the strongest baseline.

View source

Similar papers

#natural language process... Preprint Sep 2026

Hierarchical Wasserstein Merging for Multi-Domain Multi-Task Learning: From Specialists to a Generalist

HWM is a representation-level framework that models each domain-task specialist as a distribution of hidden representations on a shared support, enabling either training-free specialist aggregation by Wasserstein-derived weights or training-based generalist learning through a hybrid Wasserstein alignment loss.

Ming Cheng, Jiaying Gong, Hoda Eldardiry · 0 citations
#machine learning Preprint Oct 2026

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

Model merging aims to build a multi-task model cheaply by combining the weights of individual task-specific models. To perform well across multiple tasks, most existing merging methods use an additional dataset to find the coefficients for the best linear combination of task-specific weight updates. However, we identif...

Sin-Han Yang, Shih-Cheng Huang, Chieh-Yen Lin et al. · 0 citations
#artificial intelligence Preprint Sep 2026

CoMerge: Conflict-Driven Preference Optimization for Multi-Task Model Merging

A conflict-driven preference optimization framework for model merging (CoMerge), which reformulates model merging as a preference optimization problem and utilizes a self-supervised, conflict-driven strategy that leverages the defects of naive merging methods as hard negative samples to construct preference pairs witho...

Ming-Jie Zheng, Zi-Hao Chen, Wen-Qing Chen et al. · 0 citations
#artificial intelligence Preprint Sep 2026

CASS: Contribution-Aware Structured Sparsity for Model Merging

Model merging integrates task-specific fine-tuned models into a single multi-task model, but often suffers from parameter interference caused by conflicting task-vector updates. Existing methods typically mitigate conflicts by pruning task vectors based on weight magnitude or random heuristics, treating Transformers as...

Yan Li, Gui-Ping Cao, Meng-Du Xu et al. · 0 citations
Preprint Aug 2026

TASSO: TAsk-Specific Subspace Optimization for Continual Learning of Vision-Language Models

TASSO, a new paradigm that efficiently preserves the latent space geometry while ensuring network plasticity, is introduced with two complementary techniques: subspace learning and geometry-aware knowledge distillation.

Chang-Ming Sun, Francesco Barbato, Matteo Caligiuri et al. · 0 citations
Conference Open access Sep 2026

SeMi-LoRA: Enhancing Low-Rank Adaptation via Separation and Mixing

This work proposes SeMi-LoRA (Separation and Mixing LoRA), a novel framework that enables complete high-rank updates while preserving mergeability and consistently outperforms strong PEFT baselines with favorable parameter efficiency.

Zhen-Fei Yang, Beiming Yu, Peiqin Lin et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.