DisTaC: Conditioning Task Vectors via Distillation for Robust Model Merging

Kotaro Yoshida, Yuji Naraki, Takafumi Horie, Ryotaro Shimizu, Hiroki Naganuma
8/2/2025
cs.LG

No official code found. Best implementation: katoro8989/DisTaC (4 stars, MIT, last commit 2026-02-07).

Abstract

Model merging has emerged as an efficient and flexible paradigm for multi-task learning, with numerous methods being proposed in recent years. However, these state-of-the-art techniques are typically evaluated on benchmark suites that are highly favorable to model merging, and their robustness in more realistic settings remains largely unexplored. In this work, we first investigate the vulnerabilities of model-merging methods and pinpoint the source-model characteristics that critically underlie them. Specifically, we identify two factors that are particularly harmful to the merging process: (1) disparities in task vector norms, and (2) the low confidence of the source models. To address this issue, we propose DisTaC (Distillation for Task vector Conditioning), a novel method that pre-conditions these problematic task vectors before the merge. DisTaC leverages knowledge distillation to adjust a task vector's norm and increase source-model confidence while preserving its essential task-specific knowledge. Our extensive experiments demonstrate that by pre-conditioning task vectors with DisTaC, state-of-the-art merging techniques can successfully integrate models exhibiting the harmful traits -- where they would otherwise fail -- achieving significant performance gains.

View on arXivView PDF

Code Implementations(1)

katoro8989/DisTaCCommunity57%
MIT

Source code for paper "DisTaC: Conditioning Task Vectors via Distillation for Robust Model Merging" (ICLR2026)

40PythonJul 31, 20258 months agoMIT

Similar Papers

Cite this paper

@article{yoshida2025distac,
  title  = {DisTaC: Conditioning Task Vectors via Distillation for Robust Model Merging},
  author = {Kotaro Yoshida and Yuji Naraki and Takafumi Horie and Ryotaro Shimizu and Hiroki Naganuma},
  year   = {2025},
  eprint = {2508.01148},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.01148v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.01148.svg)](https://codeofpaper.com/paper/2508.01148)

Discussion