LARV: Data-Free Layer-wise Adaptive Rescaling Veneer for Model Merging
Not on the map. Why?
Abstract (arXiv)
Model merging aims to combine multiple fine-tuned models into a single multi-task model without access to training data. Existing task-vector merging methods such as TIES, TSV-M, and Iso-C/CTS differ in their aggregation rules but treat all layers nearly uniformly. This assumption overlooks the strong layer-wise heterogeneity in large vision transformers, where shallow layers are sensitive to interference while deeper layers encode stable task-specific features. We introduce LARV, a training-free, data-free, merger-agnostic Layer-wise Adaptive Rescaling Veneer that plugs into any task-vector merger and assigns a per-layer scale to each task vector before aggregation, and show it consistently boosts diverse merging rules. LARV adaptively suppresses shallow-layer interference and amplifies deeper-layer alignment using a simple deterministic schedule, requiring no retraining or modification to existing mergers. To our knowledge, this is the first work to perform layer-aware scaling for task-vector merging. LARV computes simple data-free layer proxies and turns them into scales through a lightweight rule; we study several instantiations within one framework (e.g., tiered two/three-level scaling with fixed values, or continuous mappings) and show that tiered choices offer the best robustness, while continuous mappings remain an ablation. LARV is orthogonal to the base merger and adds negligible cost. On FusionBench with Vision Transformers, LARV consistently improves all task-vector baselines across 8/14/20-task settings; for example, Iso-C + LARV reaches 85.9% on ViT-B/32, 89.2% on ViT-B/16, and 92.6% on ViT-L/14. Layerwise analysis and corruption tests further indicate that LARV suppresses shallow-layer interference while modestly amplifying deeper, task-stable features, turning model merging into a robust, layer-aware procedure rather than a uniform one.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 37 of its 48 references that are in the map. First posted on arXiv 10 Feb 2026.
Builds on
37 of 48 references.
References · 37
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2013Visualizing and Understanding Convolutional Networkscited by 2,278
- 2013Describing Textures in the Wildcited by 2,110
- 2020Shortcut Learning in Deep Neural Networkscited by 1,928
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,488
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
25 more
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2022Editing Models with Task Arithmeticcited by 1,076
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 791
- 2022AdaptFormer: Adapting Vision Transformers for Scalable Visual Recognitioncited by 714
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
- 2021Merging Models with Fisher-Weighted Averagingcited by 613
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
- 2019Bayesian Nonparametric Federated Learning of Neural Networkscited by 385
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 248
- 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 247
- 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 143
- 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 114
- 2024EMR-Merging: Tuning-Free High-Performance Model Mergingcited by 108
- 2025No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspacescited by 90
- 2024Parameter Competition Balancing for Model Mergingcited by 71
- 2024Merging LoRAs like Playing LEGO: Pushing the Modularity of LoRA to Extremes Through Rank-Wise Clusteringcited by 58
- 2024Multi-Task Model Merging via Adaptive Weight Disentanglementcited by 22
- 2025CAT Merging: A Training-Free Approach for Resolving Conflicts in Model Mergingcited by 22
- 2023Merging Vision Transformers from Different Tasks and Domainscited by 17
- 2025RegMean++: Enhancing Effectiveness and Generalization of Regression Mean for Model Mergingcited by 10
- 2024Rethinking Weight-Averaged Model-mergingcited by 8
Built on by
Not cited yet.