Gradient-Sign Masking for Task Vector Transport Across Pre-Trained Models
Not on the map. Why?
Abstract (arXiv)
When a new release of a foundation model is published, practitioners typically need to repeat fine-tuning, even if the same task was already tackled in the previous version. A promising alternative is to reuse the parameter changes (i.e., task vectors) that capture how a model adapts to a specific task. However, these vectors often fail to transfer across different pre-trained models because their parameter spaces are misaligned. In this work, we show that successful transfer depends strongly on the gradient-sign structure of the new model. Based on this insight, we propose GradFix, which approximates the ideal sign structure and leverages it to transfer knowledge using only a handful of labeled samples. Notably, this requires no additional fine-tuning: we only compute a few target-model gradients without parameter updates and mask the source task vector accordingly. This yields an update that is locally aligned with the target loss landscape, effectively rebasing the task vector onto the new pre-training. We provide a theoretical guarantee that our method ensures first-order descent. Empirically, we demonstrate significant performance gains on vision and language benchmarks, consistently outperforming naive task vector addition and few-shot fine-tuning. We further show that transporting task vectors improves multi-task and multi-source model merging. Code is available at https://github.com/fillo-rinaldi/GradFix.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 38 of its 52 references that are in the map. First posted on arXiv 7 Oct 2025.
Builds on
38 of 52 references.
References · 38
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2023GPT-4 Technical Reportcited by 18,396
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2023Visual Instruction Tuningcited by 7,869
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2022Scaling Instruction-Finetuned Language Modelscited by 3,024
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,850
26 more
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2022Reproducible scaling laws for contrastive language-image learningcited by 1,173
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 797
- 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 650
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 310
- 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Modelscited by 221
- 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 179
- 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 147
- 2025No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspacescited by 96
- 2023Transformer Fusion with Optimal Transportcited by 36
- 2025Accurate and Efficient Low-Rank Model Merging in Core Spacecited by 29
- 2024A Second-Order Perspective on Model Compositionality and Incremental Learningcited by 18
- 2025Update Your Transformer to the Latest Release: Re-Basin of Task Vectorscited by 17
- 2024PLeaS -- Merging Models with Permutations and Least Squarescited by 16
- 2024ATM: Improving Model Merging by Alternating Tuning and Mergingcited by 11
- 2024Enhancing Large Language Model Performance with Gradient-Based Parameter Selectioncited by 9
- 2025Modular Embedding Recomposition for Incremental Learningcited by 3
- 2024SignSGD with Federated Votingcited by 2
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Transporting Task Vectors across Different Architectures without Trainingcited by 6
- 2026Distilling Linearized Behavior into Non-Linear Fine-Tuning for Effective Task Arithmeticcited by 1
- 2026Model Merging: Foundations and Algorithmscited by 0
- 2026Bilinear Coordinate Alignment for Training-Free Task-Vector Transfercited by 0
- 2026Bilinear Coordinate Alignment for Training-Free Task-Vector Transfer27 May 2026
- 2026Distilling Linearized Behavior into Non-Linear Fine-Tuning for Effective Task Arithmetic18 May 2026
- 2026Model Merging: Foundations and Algorithms2 May 2026
- 2026Transporting Task Vectors across Different Architectures without Training13 Feb 2026