mlsanityData to 7 Oct 2026

Label-Free Cross-Task LoRA Merging with Null-Space Compression

arXiv 2603.26317 ↗First posted 27 Mar 2026cs.CV cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Model merging combines independently fine-tuned checkpoints without joint multi-task training. In the era of foundation-model, fine-tuning with Low-Rank Adaptation (LoRA) is prevalent, making LoRA merging a promising target. Existing approaches can work in homogeneous settings where all target tasks are classification but often fail when tasks span classification and regression. Approaches using entropy-based surrogates do not apply to regression and are costly for large language models due to long token sequences. We introduce Null-Space Compression (NSC) Merging, a label-free, output-agnostic method that sets merge weights from adapter geometry. Our key observation is that during LoRA finetuning the down-projection factor A in Delta W = BA compresses its null space, and the compression correlates with performance. NSC uses this as an optimization signal for merging that can generalize across classification, regression, and sequence generation. NSC achieves state-of-the-art performance across twenty heterogeneous vision tasks with balanced gains where prior methods overfit subsets of tasks. It also outperforms baselines on six NLI benchmarks and on vision-language evaluations for VQA and image captioning, demonstrating scalability and effectiveness.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 76 of its 109 references that are in the map. First posted on arXiv 27 Mar 2026.

Builds on

76 of 109 references.

References · 76

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  4. 2024The Llama 3 Herd of Modelscited by 14,192
  5. 2023Visual Instruction Tuningcited by 7,792
  6. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  8. 2023Improved Baselines with Visual Instruction Tuningcited by 4,362
  9. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  10. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  11. 2015A large annotated corpus for learning natural language inferencecited by 1,837
  12. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,488
38 more
  1. 2022ChartQA: A Benchmark for Question Answering about Charts with Visual and Logical Reasoningcited by 1,449
  2. 2020DocVQA: A Dataset for VQA on Document Imagescited by 1,288
  3. 2020Gradient Surgery for Multi-Task Learningcited by 1,210
  4. 2022Editing Models with Task Arithmeticcited by 1,076
  5. 2014Deep Visual-Semantic Alignments for Generating Image Descriptionscited by 966
  6. 2018VizWiz Grand Challenge: Answering Visual Questions from Blind Peoplecited by 852
  7. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
  8. 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 791
  9. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
  10. 2021Merging Models with Fisher-Weighted Averagingcited by 613
  11. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
  12. 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 441
  13. 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
  14. 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
  15. 2021IconQA: A New Benchmark for Abstract Diagram Understanding and Visual Language Reasoningcited by 262
  16. 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 247
  17. 2021Efficiently Identifying Task Groupings for Multi-Task Learningcited by 218
  18. 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 178
  19. 2023Concept Sliders: LoRA Adaptors for Precise Control in Diffusion Modelscited by 148
  20. 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 143
  21. 2023Model Breadcrumbs: Scaling Multi-Task Model Merging with Sparse Maskscited by 130
  22. 2024Localizing Task Information for Improved Model Merging and Compressioncited by 130
  23. 2024Model merging with SVD to tie the Knotscited by 118
  24. 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 114
  25. 2024EMR-Merging: Tuning-Free High-Performance Model Mergingcited by 108
  26. 2024Representation Surgery for Multi-Task Model Mergingcited by 95
  27. 2025No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspacescited by 90
  28. 2024Merging Multi-Task Models via Weight-Ensembling Mixture of Expertscited by 85
  29. 2024Multi-LoRA Composition for Image Generationcited by 80
  30. 2023Model Merging by Uncertainty-Based Gradient Matchingcited by 77
  31. 2023FAMO: Fast Adaptive Multitask Optimizationcited by 74
  32. 2023Parameter Efficient Multi-task Model Fusion with Partial Linearizationcited by 64
  33. 2025Whoever Started the Interference Should End It: Guiding Data-Free Model Merging via Task Vectorscited by 59
  34. 2024Merging LoRAs like Playing LEGO: Pushing the Modularity of LoRA to Extremes Through Rank-Wise Clusteringcited by 58
  35. 2025Unlocking Efficient Long-to-Short LLM Reasoning with Model Mergingcited by 58
  36. 2024MetaGPT: Merging Large Language Models Using Model Exclusive Task Arithmeticcited by 53
  37. 2024LoRA Soups: Merging LoRAs for Practical Skill Composition Taskscited by 49
  38. 2025Bring Reason to Vision: Understanding Perception and Reasoning through Model Mergingcited by 40

50 most cited of 76 All 76 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.