Task Matrices: Linear Maps for Cross-Model Finetuning Transfer
Not on the map. Why?
Abstract (arXiv)
Results in interpretability suggest that large vision and language models learn implicit linear encodings when models are biased by in-context prompting. However, the existence of similar linear representations in more general adaptation regimes has not yet been demonstrated. In this work, we develop the concept of a task matrix, a linear transformation from a base to finetuned embedding state. We demonstrate that for vision and text models and ten different datasets, a base model augmented with a task matrix achieves results surpassing linear probes, sometimes approaching finetuned levels. Our results validate the existence of cross-layer linear encodings between pretrained and finetuned architectures. Moreover, we show that a data-based approximation for such encodings is both efficient and generalizable to multiple domains. We make our implementation publicly available.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 35 of its 53 references that are in the map. First posted on arXiv 16 Dec 2025.
Builds on
35 of 53 references.
References · 35
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2015A large annotated corpus for learning natural language inferencecited by 1,837
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,488
- 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
23 more
- 2016Understanding intermediate layers using linear classifier probescited by 1,279
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
- 2014How transferable are features in deep neural networks?cited by 1,216
- 2022Editing Models with Task Arithmeticcited by 1,076
- 2022Mass-Editing Memory in a Transformercited by 976
- 2019Right for the Wrong Reasons: Diagnosing Syntactic Heuristics in Natural Language Inferencecited by 864
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 791
- 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 679
- 2019BLiMP: The Benchmark of Linguistic Minimal Pairs for Englishcited by 553
- 2019Benign Overfitting in Linear Regressioncited by 544
- 2023Dissecting Recall of Factual Associations in Auto-Regressive Language Modelscited by 512
- 2020Efficient Intent Detection with Dual Sentence Encoderscited by 419
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
- 2024AlphaEdit: Null-Space Constrained Knowledge Editing for Language Modelscited by 224
- 2023Linearity of Relation Decoding in Transformer Language Modelscited by 190
- 2021Benchmarking Representation Learning for Natural World Image Collectionscited by 167
- 2020Better Fine-Tuning by Reducing Representational Collapsecited by 156
- 2023Jump to Conclusions: Short-Cutting Transformers With Linear Transformationscited by 89
- 2023High-dimensional analysis of double descent for linear regression with random projectionscited by 47
- 2023Double Descent Demystified: Identifying, Interpreting & Ablating the Sources of a Deep Learning Puzzlecited by 36
- 2023Identifying Linear Relational Concepts in Large Language Modelscited by 12
- 2025Linear Relational Decoding of Morphology in Language Modelscited by 1
Built on by
Not cited yet.