Skip to content

Understanding and Enforcing Weight Disentanglement in Task Arithmetic

Apr 2026 · arXiv.org · Vol abs/2604.17078 · 3 citations · 57 references
Computer Science

TL;DR

This paper first proves that TFS is a sufficient condition for weight disentanglement, and finds that TFS also gives rise to an observable geometric consequence: weight vector orthogonality, which positions TFS as the common cause for both the desired functional outcome and a measurable geometric property.

Abstract

Task arithmetic provides an efficient, training-free way to edit pre-trained models, yet lacks a fundamental theoretical explanation for its success. The existing concept of ``weight disentanglement"describes the ideal outcome of non-interfering task composition but does not reveal its underlying cause. Crucially, what intrinsic properties of the pre-trained model ($\theta_0$) or the task vectors ($\tau_t$) enable this disentanglement remains underexplored. In this paper, we introduce Task-Feature Specialization (TFS), a model's ability to allocate distinct internal features to different tasks, as the fundamental principle. We first prove that TFS is a sufficient condition for weight disentanglement. More importantly, we find that TFS also gives rise to an observable geometric consequence: weight vector orthogonality. This positions TFS as the common cause for both the desired functional outcome (disentanglement) and a measurable geometric property (orthogonality). This relationship provides the key insight for our method: since the abstract TFS property is intractable to enforce directly, we can instead promote weight disentanglement by shaping its concrete geometric consequence, orthogonality. Therefore, we propose OrthoReg, a simple and effective regularization method that actively enforces an internal orthogonal structure on weight updates ($\Delta W$) that constitute $\tau_t$ during fine-tuning. And we theoretically prove that OrthoReg promotes disentanglement. Extensive experiments demonstrate that OrthoReg consistently and significantly enhances the performance of various task arithmetic methods. Code is available at \href{https://github.com/RL-MIND/OrthoReg}{https://github.com/RL-MIND/OrthoReg}.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Training-Free Task Vectors for LLM Behavioral Control

This work introduces Training-Free Task Vectors (TFTVs), a novel method to compute task-vector-like directions without requiring fine-tuning and evaluates TFTVs on large language model behavioral control tasks and shows that they consistently amplify, suppress, and compose target behaviors while preserving general know...

G. Perin, Lucas Boscaini, André Araújo et al. · 0 citations
Preprint Aug 2026

Task-Anchored Representation Shaping for Pre-Trained Model-Based Continual Learning

TAILS resolves cross-task ambiguity at the representation level, while leaving the original PTM, method-specific modules, and classifier unchanged, and can improve classification and task-inference performance with modest parameter overhead and negligible inference cost.

Zhiming Xu, Huiyu Yi, Zheng-He Xie et al. · 0 citations
Jul 2026

The JEPA Paradox in Language: The Geometry of Linguistic Alternatives

Text-compatible JEPA objectives must preserve multiple plausible completions rather than compress them into a single latent point, showing that text-compatible JEPA objectives must preserve multiple plausible completions rather than compress them into a single latent point.

A. T. D. Dinh, K. Vo · 0 citations
#machine learning Preprint Aug 2026

When Muon Meets Task Interference: A Spectral Perspective on Continual Learning and Model Merging

This work reveals that the recent Muon optimizer as a mechanism that regulates this factor by construction tightens the interference bound for both CL and MM, positioning Muon as a principled optimizer-centric approach complementary to existing solutions.

Shan Liu, Yuehan Yin, Yinghuan Shi et al. · 0 citations
Preprint Aug 2026

The Limits of Binding in Dual Encoders

Binding failure in deployed dual encoders is thus not a dimension or smoothness limit today, but an incentive and code-structure limit, with a proved depth ceiling that remains once those are fixed.

Kin Ian Lo · 0 citations
Preprint Aug 2026

Encoded but Not Actionable: Auditing the Decode-Generate-Steer Gap in Frozen LLMs for Geometric Constraints

Large language models (LLMs) have demonstrated strong performance on structured reasoning tasks, but what they encode and whether it informs model behavior remain unclear. We investigate this question through geometric reasoning, using parametric CAD constraints as a controlled testbed for separating local pairwise rel...

M. Liang, Xin-Zhao Cheng, Faizan Wajid · 0 citations

Related blog posts

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