mlsanityData to 7 Oct 2026

VeFA: Vector-Based Feature Space Adaptation for Robust Model Fine-Tuning

arXiv 2510.19155 ↗First posted 22 Oct 2025cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Catastrophic forgetting is a well-documented challenge in model fine-tuning, particularly when the downstream domain has limited labeled data or differs substantially from the pre-training distribution. Existing parameter-efficient fine-tuning methods largely operate in the weight space by modifying or augmenting the parameters of the pre-trained model, which can lead to models that are overly specialized to the observed downstream data. Recent studies suggest that one mechanism underlying such forgetting is the introduction of intruder dimensions into the representation space during fine-tuning. To mitigate the risk of overwriting pre-trained knowledge and to enhance robustness, we propose Vector-based Feature Adaptation (VeFA), a new fine-tuning method that operates directly in the feature space, which naturally avoids generating intruder dimensions. VeFA performs element-wise adaptation on individual features, thereby ensuring that the effective fine-tuned weights always remain within the column space of the pre-trained weight matrix. This feature-space adaptation perspective is inspired by the idea of effect equivalence modeling (EEM) of downstream lurking variables that induce distribution shifts, which posits that the influence of unobserved factors can be represented as an equivalent aggregate effect on observed features. By compensating for the effects of downstream lurking variables via a lightweight feature-level transformation, VeFA preserves the pre-trained representations and improves model generalization under distribution shift. We evaluate VeFA against LoRA on image classification, NLU, and NLG benchmarks, considering both standard fine-tuning performance and robustness; across these tasks, VeFA achieves comparable fine-tuning performance while consistently exhibiting stronger robustness.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 48 of its 73 references that are in the map. First posted on arXiv 22 Oct 2025.

Builds on

48 of 73 references.

References · 48

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  6. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  7. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  8. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  9. 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
  10. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  11. 2021Learning to Prompt for Vision-Language Modelscited by 2,269
  12. 2013Describing Textures in the Wildcited by 2,110
36 more
  1. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  2. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,488
  3. 2022Conditional Prompt Learning for Vision-Language Modelscited by 1,427
  4. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
  5. 2021CLIP-Adapter: Better Vision-Language Models with Feature Adapterscited by 1,021
  6. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
  7. 2021Robust fine-tuning of zero-shot modelscited by 785
  8. 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 722
  9. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
  10. 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 458
  11. 2020AdapterHub: A Framework for Adapting Transformerscited by 441
  12. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  13. 2017Measuring Catastrophic Forgetting in Neural Networkscited by 359
  14. 2022Tip-Adapter: Training-free Adaption of CLIP for Few-shot Classificationcited by 355
  15. 2022Prompt-aligned Gradient for Prompt Tuningcited by 339
  16. 2017Unified Deep Supervised Domain Adaptation and Generalizationcited by 322
  17. 2017The E2E Dataset: New Challenges For End-to-End Generationcited by 252
  18. 2020AdapterDrop: On the Efficiency of Adapters in Transformerscited by 223
  19. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  20. 2018Progressive Feature Alignment for Unsupervised Domain Adaptationcited by 183
  21. 2021Block Pruning For Faster Transformerscited by 176
  22. 2021Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuningcited by 145
  23. 2019Mixout: Effective Regularization to Finetune Large-scale Pretrained Language Modelscited by 141
  24. 2023LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuningcited by 132
  25. 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
  26. 2022Task Residual for Tuning Vision-Language Modelscited by 122
  27. 2020Memory-Efficient Incremental Learning Through Feature Adaptationcited by 107
  28. 2023Equivariant Architectures for Learning in Deep Weight Spacescited by 106
  29. 2024Low-Rank Few-Shot Adaptation of Vision-Language Modelscited by 103
  30. 2024LoRA vs Full Fine-tuning: An Illusion of Equivalencecited by 102
  31. 2020Cross-domain Object Detection through Coarse-to-Fine Feature Adaptationcited by 82
  32. 2020Distance-Based Regularisation of Deep Networks for Fine-Tuningcited by 47
  33. 2024Fine-Tuning is Fine, if Calibratedcited by 24
  34. 2023Fast Trainable Projection for Robust Fine-Tuningcited by 18
  35. 2025Generalized Linear Mode Connectivity for Transformerscited by 14
  36. 2024Pareto Merging: Multi-Objective Optimization for Preference-Aware Model Mergingcited by 13

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.